Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7996830
S. Raju, Sai Boddepalli, Suraj Gampa, Qiben Yan, J. Deogun
Cloud-centric cognitive cellular networks utilize dynamic spectrum access and opportunistic network access technologies as a means to mitigate spectrum crunch and network demand. However, furnishing a carrier with personally identifiable information for user setup increases the risk of profiling in cognitive cellular networks, wherein users seek secondary access at various times with multiple carriers. Moreover, network access provisioning — assertion, authentication, authorization, and accounting — implemented in conventional cellular networks is inadequate in the cognitive space, as it is neither spontaneous nor scalable. In this paper, we propose a privacy-enhancing user identity management system using blockchain technology which places due importance on both anonymity and attribution, and supports end-to-end management from user assertion to usage billing. The setup enables network access using pseudonymous identities, hindering the reconstruction of a subscriber's identity. Our test results indicate that this approach diminishes access provisioning duration by up to 4x, decreases network signaling traffic by almost 40%, and enables near real-time user billing that may lead to approximately 3x reduction in payments settlement time.
{"title":"Identity management using blockchain for cognitive cellular networks","authors":"S. Raju, Sai Boddepalli, Suraj Gampa, Qiben Yan, J. Deogun","doi":"10.1109/ICC.2017.7996830","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996830","url":null,"abstract":"Cloud-centric cognitive cellular networks utilize dynamic spectrum access and opportunistic network access technologies as a means to mitigate spectrum crunch and network demand. However, furnishing a carrier with personally identifiable information for user setup increases the risk of profiling in cognitive cellular networks, wherein users seek secondary access at various times with multiple carriers. Moreover, network access provisioning — assertion, authentication, authorization, and accounting — implemented in conventional cellular networks is inadequate in the cognitive space, as it is neither spontaneous nor scalable. In this paper, we propose a privacy-enhancing user identity management system using blockchain technology which places due importance on both anonymity and attribution, and supports end-to-end management from user assertion to usage billing. The setup enables network access using pseudonymous identities, hindering the reconstruction of a subscriber's identity. Our test results indicate that this approach diminishes access provisioning duration by up to 4x, decreases network signaling traffic by almost 40%, and enables near real-time user billing that may lead to approximately 3x reduction in payments settlement time.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"9 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82697633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Damage caused by malware is a serious problem that needs to be addressed. The recent rise in the spread of evasive malware has made it difficult to detect it at the pre-infection timing. Malware detection at post-infection timing is a promising approach that fulfills this gap. Given this background, this work aims to identify likely malware-infected devices from the measurement of Internet traffic. The advantage of the traffic-measurement-based approach is that it enables us to monitor a large number of clients. If we find a client as a source of malicious traffic, the client is likely a malware-infected device. Since the majority of malware today makes use of the web as a means to communicate with the C&C servers that reside on the external network, we leverage information recorded in the HTTP headers to discriminate between malicious and legitimate traffic. To make our approach scalable and robust, we develop the automatic template generation scheme that drastically reduces the amount of information to be kept while achieving the high accuracy of classification; since it does not make use of any domain knowledge, the approach should be robust against changes of malware. We apply several classifiers, which include machine learning algorithms, to the extracted templates and classify traffic into two categories: malicious and legitimate. Our extensive experiments demonstrate that our approach discriminates between malicious and legitimate traffic with up to 97.1% precision while maintaining the false positive below 1.0%.
{"title":"BotDetector: A robust and scalable approach toward detecting malware-infected devices","authors":"Sho Mizuno, Mitsuhiro Hatada, Tatsuya Mori, Shigeki Goto","doi":"10.1109/ICC.2017.7997372","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997372","url":null,"abstract":"Damage caused by malware is a serious problem that needs to be addressed. The recent rise in the spread of evasive malware has made it difficult to detect it at the pre-infection timing. Malware detection at post-infection timing is a promising approach that fulfills this gap. Given this background, this work aims to identify likely malware-infected devices from the measurement of Internet traffic. The advantage of the traffic-measurement-based approach is that it enables us to monitor a large number of clients. If we find a client as a source of malicious traffic, the client is likely a malware-infected device. Since the majority of malware today makes use of the web as a means to communicate with the C&C servers that reside on the external network, we leverage information recorded in the HTTP headers to discriminate between malicious and legitimate traffic. To make our approach scalable and robust, we develop the automatic template generation scheme that drastically reduces the amount of information to be kept while achieving the high accuracy of classification; since it does not make use of any domain knowledge, the approach should be robust against changes of malware. We apply several classifiers, which include machine learning algorithms, to the extracted templates and classify traffic into two categories: malicious and legitimate. Our extensive experiments demonstrate that our approach discriminates between malicious and legitimate traffic with up to 97.1% precision while maintaining the false positive below 1.0%.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"46 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83283953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7997150
Zinelaabidine Nadir, Miloud Bagaa, T. Taleb
Internet Protocol Television (IPTV) has become widely used to deliver TV channels over the Internet. Tremendous efforts have been carried out for making IPTV services an alternative to traditional TV by offering low-cost TV channels. The cloud network offers many advantages that give more flexibility for sharing the content and reducing the cost for endusers. In this paper, we explore the strength of cloud by allowing different users to create cost-efficient TV channels on top of the cloud. The proposed algorithm reduces the cost by exploring the shared content in the cloud network. The simultaneous streaming of the content shared among different channels will reduce the number of streams in the network, and consequently the otherwise incurred cost. This can be achieved through a smart scheduling mechanism that schedules the streaming of the same video to a large number of channels at the same time. The obtained results prove the efficiency of the proposed solution in terms of cost efficiency.
{"title":"Cost aware caching and streaming scheduling for efficient cloud based TV","authors":"Zinelaabidine Nadir, Miloud Bagaa, T. Taleb","doi":"10.1109/ICC.2017.7997150","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997150","url":null,"abstract":"Internet Protocol Television (IPTV) has become widely used to deliver TV channels over the Internet. Tremendous efforts have been carried out for making IPTV services an alternative to traditional TV by offering low-cost TV channels. The cloud network offers many advantages that give more flexibility for sharing the content and reducing the cost for endusers. In this paper, we explore the strength of cloud by allowing different users to create cost-efficient TV channels on top of the cloud. The proposed algorithm reduces the cost by exploring the shared content in the cloud network. The simultaneous streaming of the content shared among different channels will reduce the number of streams in the network, and consequently the otherwise incurred cost. This can be achieved through a smart scheduling mechanism that schedules the streaming of the same video to a large number of channels at the same time. The obtained results prove the efficiency of the proposed solution in terms of cost efficiency.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86428520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7996499
Sara Retal, Miloud Bagaa, T. Taleb, H. Flinck
Content Delivery Networks (CDNs) emerged to manage the great amount of content, as well as the transmissions over long distances. In recent years, this concept proves to be a promising solution for emergent enterprises. In this paper, we present a Content Delivery Network as a Service (CDNaaS) platform which can create virtual machines (VMs) through a network of data centers and provide a customized slice of CDN to users. CDNaaS manages a great number of videos by means of caches, transcoders, and streamers hosted in different VMs. However, an optimal placement of VMs with adequate flavors for the different images is required to obtain an efficient slice of CDN. In this work, we argue the need to find a convenient slice for the CDN owner while respecting his performance requirements and minimizing as much as possible the incurred cost. We first formulate the VMs placement problem as two Linear Integer problem solutions, aiming at minimizing the cost and maximizing the quality of experience of streaming. Then, extensive simulation results are presented to illustrate the effectiveness of the proposed models.
{"title":"Content delivery network slicing: QoE and cost awareness","authors":"Sara Retal, Miloud Bagaa, T. Taleb, H. Flinck","doi":"10.1109/ICC.2017.7996499","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996499","url":null,"abstract":"Content Delivery Networks (CDNs) emerged to manage the great amount of content, as well as the transmissions over long distances. In recent years, this concept proves to be a promising solution for emergent enterprises. In this paper, we present a Content Delivery Network as a Service (CDNaaS) platform which can create virtual machines (VMs) through a network of data centers and provide a customized slice of CDN to users. CDNaaS manages a great number of videos by means of caches, transcoders, and streamers hosted in different VMs. However, an optimal placement of VMs with adequate flavors for the different images is required to obtain an efficient slice of CDN. In this work, we argue the need to find a convenient slice for the CDN owner while respecting his performance requirements and minimizing as much as possible the incurred cost. We first formulate the VMs placement problem as two Linear Integer problem solutions, aiming at minimizing the cost and maximizing the quality of experience of streaming. Then, extensive simulation results are presented to illustrate the effectiveness of the proposed models.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"222 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75547939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7996378
Eriko Mogi, T. Ohtsuki
A variability of R-R intervals that represent the peak-to-peak intervals of the heartbeats indicates the mental condition. Doppler radar can capture the information of heartbeats with less burden on subjects, which leads to less stress of subjects. However, non-contact heartbeat detection using Doppler radar is easily affected by respiration and body movements. In this paper, we propose a detection algorithm of R-R intervals based on the spectrogram. Our algorithm determines the frequency bands containing the heartbeats components from the frequencies that might respond to heartbeats in the spectrogram. We integrate the amplitudes of frequencies due to heartbeats within the frequency band to eliminate the noise caused by respiration and small body movements. Then, we detect peaks in the integrated amplitudes of frequencies corresponding to heartbeats. In general, the R-R intervals do not largely change between two adjacent intervals. Thus, we set a threshold to the difference of two adjacent peak-to-peak intervals that are detected. If the peak-to-peak interval is judged not corresponding to an R-R interval by the threshold, we remove the corresponding peak and interpolate a peak based on the adjacent peak-to-peak intervals. Through experiments, we show that when the subjects were sitting still, our algorithm improved the detection accuracy of the R-R intervals compared with our previous algorithm that was able to achieve a better detection accuracy than the other existing algorithms. Moreover, we confirmed that the improvement of the detection accuracy is effective to accurately calculate the stress index.
{"title":"Heartbeat detection with Doppler radar based on spectrogram","authors":"Eriko Mogi, T. Ohtsuki","doi":"10.1109/ICC.2017.7996378","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996378","url":null,"abstract":"A variability of R-R intervals that represent the peak-to-peak intervals of the heartbeats indicates the mental condition. Doppler radar can capture the information of heartbeats with less burden on subjects, which leads to less stress of subjects. However, non-contact heartbeat detection using Doppler radar is easily affected by respiration and body movements. In this paper, we propose a detection algorithm of R-R intervals based on the spectrogram. Our algorithm determines the frequency bands containing the heartbeats components from the frequencies that might respond to heartbeats in the spectrogram. We integrate the amplitudes of frequencies due to heartbeats within the frequency band to eliminate the noise caused by respiration and small body movements. Then, we detect peaks in the integrated amplitudes of frequencies corresponding to heartbeats. In general, the R-R intervals do not largely change between two adjacent intervals. Thus, we set a threshold to the difference of two adjacent peak-to-peak intervals that are detected. If the peak-to-peak interval is judged not corresponding to an R-R interval by the threshold, we remove the corresponding peak and interpolate a peak based on the adjacent peak-to-peak intervals. Through experiments, we show that when the subjects were sitting still, our algorithm improved the detection accuracy of the R-R intervals compared with our previous algorithm that was able to achieve a better detection accuracy than the other existing algorithms. Moreover, we confirmed that the improvement of the detection accuracy is effective to accurately calculate the stress index.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"8 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85534834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7996835
S. Raju, Sai Boddepalli, Neelabjo Choudhury, Qiben Yan, J. Deogun
Cognitive cellular networks can enable opportunistic network access but their effectiveness relies on adaptive handoff algorithms. However, in cognitive radio networks the usufructuary rights of a secondary user are rescinded due to the unanticipated appearance of a primary user causing potential service disruption. In order to provide uninterrupted service to a cognitive cellular user, we propose elastic handoff as a composite framework of conventional cellular and voluntary spectrum handoffs. As with spectrum handoff, elastic handoff grants secondary users spectrum access while insulating them against the arrival of primary users. On the other hand, it is similar to cellular handoff in providing secondary users service assurance. The setup also offers users multiple network access choices, and affords carriers the means to generate additional revenue by capitalizing on excess capacity. We use a blockchain-based spectrum exchange and smart contracts to implement elastic handoff. Our tests show that user-initiated elastic handoff may reduce call drops by up to half compared to observations from a conventional cellular market, and network-initiated elastic handoff can improve a carrier's revenue maximization prospects.
{"title":"Design and analysis of elastic handoff in cognitive cellular networks","authors":"S. Raju, Sai Boddepalli, Neelabjo Choudhury, Qiben Yan, J. Deogun","doi":"10.1109/ICC.2017.7996835","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996835","url":null,"abstract":"Cognitive cellular networks can enable opportunistic network access but their effectiveness relies on adaptive handoff algorithms. However, in cognitive radio networks the usufructuary rights of a secondary user are rescinded due to the unanticipated appearance of a primary user causing potential service disruption. In order to provide uninterrupted service to a cognitive cellular user, we propose elastic handoff as a composite framework of conventional cellular and voluntary spectrum handoffs. As with spectrum handoff, elastic handoff grants secondary users spectrum access while insulating them against the arrival of primary users. On the other hand, it is similar to cellular handoff in providing secondary users service assurance. The setup also offers users multiple network access choices, and affords carriers the means to generate additional revenue by capitalizing on excess capacity. We use a blockchain-based spectrum exchange and smart contracts to implement elastic handoff. Our tests show that user-initiated elastic handoff may reduce call drops by up to half compared to observations from a conventional cellular market, and network-initiated elastic handoff can improve a carrier's revenue maximization prospects.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"4 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89039042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7996426
I. Osahon, E. Pikasis, S. Rajbhandari, W. Popoola
We propose and experimentally demonstrate for the first time, M-PAM transmission through a hybrid POF/VLC downlink using off-the-shelf components. The link consists of 60 m SI-POF and 1 m VLC and with the aid of a blue filter, the link has an effective bandwidth of 17 MHz. Conventional adaptive decision feedback equaliser (DFE) and multi-layer perceptron DFE (MLP-DFE) are also implemented and their bit error rate (BER) performances are measured and compared with offline (MATLAB) implementation. For the conventional DFE, the achievable data rates at a BER of 10−3 are 60, 91.5 and 80 Mbps for M = 2, 4 and 8 respectively. Higher data rates are achieved for MLP-DFE at the same BER of 10−3 as we obtained 61.5, 95 and 85 Mbps for M = 2, 4 and 8 respectively. Thus, we show that MLP-DFE offers superior BER performance than conventional DFE for higher PAM level.
我们首次提出并实验证明了M-PAM通过使用现成组件的混合POF/VLC下行链路传输。该链路由60 m SI-POF和1 m VLC组成，在蓝色滤波器的帮助下，链路的有效带宽为17 MHz。实现了传统的自适应决策反馈均衡器(DFE)和多层感知器(MLP-DFE)，并测量了它们的误码率(BER)性能，并与离线(MATLAB)实现进行了比较。对于传统DFE，当M = 2、4和8时，在BER为10−3时可实现的数据速率分别为60、91.5和80 Mbps。与M = 2、4和8时分别获得的61.5、95和85 Mbps相比，在相同BER为10−3的情况下，MLP-DFE获得了更高的数据速率。因此，我们发现MLP-DFE在更高的PAM水平下比传统DFE具有更好的BER性能。
{"title":"Hybrid POF/VLC link with M-PAM and MLP equaliser","authors":"I. Osahon, E. Pikasis, S. Rajbhandari, W. Popoola","doi":"10.1109/ICC.2017.7996426","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996426","url":null,"abstract":"We propose and experimentally demonstrate for the first time, M-PAM transmission through a hybrid POF/VLC downlink using off-the-shelf components. The link consists of 60 m SI-POF and 1 m VLC and with the aid of a blue filter, the link has an effective bandwidth of 17 MHz. Conventional adaptive decision feedback equaliser (DFE) and multi-layer perceptron DFE (MLP-DFE) are also implemented and their bit error rate (BER) performances are measured and compared with offline (MATLAB) implementation. For the conventional DFE, the achievable data rates at a BER of 10−3 are 60, 91.5 and 80 Mbps for M = 2, 4 and 8 respectively. Higher data rates are achieved for MLP-DFE at the same BER of 10−3 as we obtained 61.5, 95 and 85 Mbps for M = 2, 4 and 8 respectively. Thus, we show that MLP-DFE offers superior BER performance than conventional DFE for higher PAM level.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"22 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73740666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7996357
I. Farris, T. Taleb, A. Iera, H. Flinck
Edge Cloud infrastructure will play a key role in extending the range of supported real-time cloud applications, by guaranteeing extremely fast response times. However, user mobility requires fast relocation of service instances, which represents an open challenge for resource-constrained cloudlets interconnected by high-latency and low-bandwidth links. In this paper, we investigate container-based virtualization techniques to support dynamic Mobile Edge Computing (MEC) environments. In particular, we design a framework to guarantee fast response time, by proactively exploiting service replication. A preliminary performance analysis is conducted to identify the possible advantages introduced by the proposed approach compared to classic migration procedures.
{"title":"Lightweight service replication for ultra-short latency applications in mobile edge networks","authors":"I. Farris, T. Taleb, A. Iera, H. Flinck","doi":"10.1109/ICC.2017.7996357","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996357","url":null,"abstract":"Edge Cloud infrastructure will play a key role in extending the range of supported real-time cloud applications, by guaranteeing extremely fast response times. However, user mobility requires fast relocation of service instances, which represents an open challenge for resource-constrained cloudlets interconnected by high-latency and low-bandwidth links. In this paper, we investigate container-based virtualization techniques to support dynamic Mobile Edge Computing (MEC) environments. In particular, we design a framework to guarantee fast response time, by proactively exploiting service replication. A preliminary performance analysis is conducted to identify the possible advantages introduced by the proposed approach compared to classic migration procedures.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"37 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76453799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7996664
Shunya Iwata, T. Ohtsuki, P. Kam
In this paper, we derive the analytical expressions for the secure outage probability in a single-input single-output (SISO) system over fading, in which both the main and eavesdropper channels are subject to κ-μ fading. Many authors have analyzed the secrecy performance of such a SISO system over various fading models. More recently, a lower bound on the secure outage probability over κ-μ fading has been reported. However, the exact analytical expression of secure outage probability over κ-μ fading has not been obtained. The problem with using the lower bound is that we are not sure about the tightness of the bound. Our result is an exact expression which is verified by Monte-Carlo simulations. Furthermore, it enables us to examine the behavior of the secure outage probability as a function of the fading parameters of both the main and eavesdropper channels for given values of the average signal-to-noise power ratio (SNR) over these channels. Exact expressions for the case of Nakagami-m and Rician fading models for both the main and eavesdropper channels are also obtained and verified by simulations.
{"title":"Secure outage probability over κ-μ fading channels","authors":"Shunya Iwata, T. Ohtsuki, P. Kam","doi":"10.1109/ICC.2017.7996664","DOIUrl":"https://doi.org/10.1109/ICC.2017.7996664","url":null,"abstract":"In this paper, we derive the analytical expressions for the secure outage probability in a single-input single-output (SISO) system over fading, in which both the main and eavesdropper channels are subject to κ-μ fading. Many authors have analyzed the secrecy performance of such a SISO system over various fading models. More recently, a lower bound on the secure outage probability over κ-μ fading has been reported. However, the exact analytical expression of secure outage probability over κ-μ fading has not been obtained. The problem with using the lower bound is that we are not sure about the tightness of the bound. Our result is an exact expression which is verified by Monte-Carlo simulations. Furthermore, it enables us to examine the behavior of the secure outage probability as a function of the fading parameters of both the main and eavesdropper channels for given values of the average signal-to-noise power ratio (SNR) over these channels. Exact expressions for the case of Nakagami-m and Rician fading models for both the main and eavesdropper channels are also obtained and verified by simulations.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"14 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87773596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2017-07-28DOI: 10.1109/ICC.2017.7997415
T. Pham, Diep N. Nguyen, E. Dutkiewicz, A. McEwan, P. Leong
The causality of gait freezing in patients with advanced Parkinson's disease is still not fully understood. Clinicians are interested in investigating the freezing of gait (FoG) histogram of patients in their daily life. To that end, one needs a real-time signal processing platform that can help record freezing information (e.g., timing and the duration of every gait freezing occurrences). Wearable wireless sensors have been proposed to monitor FoG epochs. Existing automated methods using accelerometers have been introduced with high accuracy performance only for subject-dependent settings (e.g., an individual offline training process). This is a troublesome for large scale out-of-lab deployment and time-consuming. In this work, we used spectral coherence analysis for accelerometer data to apply an anomaly detection approach. Conventional features such as energy and freezing index are introduced to help refine normal epochs while the anomaly scores from spectral coherence measures define FoG epochs. Using this new set of features, our new FoG detector for subject-independent settings achieves the mean ±SD sensitivity (specificity) of 89.2±0.3% (95.6 ± 0.3%). To our best knowledge, this is the best performance for automated subject-independent approaches in literature of freezing of gait detection.
{"title":"Wearable healthcare systems: A single channel accelerometer based anomaly detector for studies of gait freezing in Parkinson's disease","authors":"T. Pham, Diep N. Nguyen, E. Dutkiewicz, A. McEwan, P. Leong","doi":"10.1109/ICC.2017.7997415","DOIUrl":"https://doi.org/10.1109/ICC.2017.7997415","url":null,"abstract":"The causality of gait freezing in patients with advanced Parkinson's disease is still not fully understood. Clinicians are interested in investigating the freezing of gait (FoG) histogram of patients in their daily life. To that end, one needs a real-time signal processing platform that can help record freezing information (e.g., timing and the duration of every gait freezing occurrences). Wearable wireless sensors have been proposed to monitor FoG epochs. Existing automated methods using accelerometers have been introduced with high accuracy performance only for subject-dependent settings (e.g., an individual offline training process). This is a troublesome for large scale out-of-lab deployment and time-consuming. In this work, we used spectral coherence analysis for accelerometer data to apply an anomaly detection approach. Conventional features such as energy and freezing index are introduced to help refine normal epochs while the anomaly scores from spectral coherence measures define FoG epochs. Using this new set of features, our new FoG detector for subject-independent settings achieves the mean ±SD sensitivity (specificity) of 89.2±0.3% (95.6 ± 0.3%). To our best knowledge, this is the best performance for automated subject-independent approaches in literature of freezing of gait detection.","PeriodicalId":6517,"journal":{"name":"2017 IEEE International Conference on Communications (ICC)","volume":"11 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83902908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：