Telecare Medicine Information System enables patients to get healthcare services at home expediently and efficiently. Authentication and key agreement protocol suited for TMIS protect patient's privacy via the unsecure network. Recently, numerous protocols have been proposed intend to safeguard the communication between patients and server. However, most of them have high computation overhead and security problems. In this paper, we aim to propose a secure and effective authentication and key agreement protocol using smartcard and password for TMIS. The protocol is based on elliptic curve cryptography. Through security analysis we illustrate that our protocol is secure to resist some known attacks and provide user anonymity. Furthermore, by comparing with other related protocols we show our protocol is superior in security and performance aspects.
{"title":"A Secure Authentication and Key Agreement Protocol for Telecare Medicine Information System","authors":"Xuanang Li, Zhiming Zheng, Xiao Zhang","doi":"10.1109/NGMAST.2015.75","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.75","url":null,"abstract":"Telecare Medicine Information System enables patients to get healthcare services at home expediently and efficiently. Authentication and key agreement protocol suited for TMIS protect patient's privacy via the unsecure network. Recently, numerous protocols have been proposed intend to safeguard the communication between patients and server. However, most of them have high computation overhead and security problems. In this paper, we aim to propose a secure and effective authentication and key agreement protocol using smartcard and password for TMIS. The protocol is based on elliptic curve cryptography. Through security analysis we illustrate that our protocol is secure to resist some known attacks and provide user anonymity. Furthermore, by comparing with other related protocols we show our protocol is superior in security and performance aspects.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132241281","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}
In this paper, we address the fault-tolerant routing problem in a heterogeneous wireless sensor network consisting of several resource-rich supernodes, and large number of energy-constrained sensor nodes. We propose the immune cooperative multi-particle-swarm algorithm (ICMPSA) to provide fast routing recovery method, in order to maintain K disjoint paths from each source node to the nearest supernode, and the available path from supernode to the sink. The key concept of our method is to efficiently repair the broken links between intercluster supernodes or intracluster sensor nodes with less network resources. Performance and analysis results of our ICMPSA based routing fault-tolerant protocol approve that it can provide reliable communication with fast bio-heuristic routing recovery mechanism, thus extend the lifetime of WSNs.
{"title":"Routing Fault-Tolerance for Heterogeneous WSNs Based on an Immune Cooperative Multi-Particle-Swarm Algorithm","authors":"Yifan Hu, Xiaoming Wu, Fu-Qiang Wang, Yong Pang, Xiangzhi Liu, Jianqiang Zhang, Yong Fu","doi":"10.1109/NGMAST.2015.11","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.11","url":null,"abstract":"In this paper, we address the fault-tolerant routing problem in a heterogeneous wireless sensor network consisting of several resource-rich supernodes, and large number of energy-constrained sensor nodes. We propose the immune cooperative multi-particle-swarm algorithm (ICMPSA) to provide fast routing recovery method, in order to maintain K disjoint paths from each source node to the nearest supernode, and the available path from supernode to the sink. The key concept of our method is to efficiently repair the broken links between intercluster supernodes or intracluster sensor nodes with less network resources. Performance and analysis results of our ICMPSA based routing fault-tolerant protocol approve that it can provide reliable communication with fast bio-heuristic routing recovery mechanism, thus extend the lifetime of WSNs.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116101673","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}
The strong development of the Internet of Things (IoT) is changing traditional perceptions of the current Internet towards a vision of smart objects interacting with each other. In this vision e-health applications are one of the most promising applications in IoT. However, security issues are the major obstacle for their deployment. Among these issues, authentication of the different interconnected entities and exchanged data confidentiality constitutes the main concerns for users that need to be addressed. In this paper, we propose a new lightweight authentication scheme for an e-health application. This scheme allows both of sensors and the Base Station (BS) to authenticate each other in order to secure the collection of health-related data. Our scheme uses nonces and Keyed-Hash message authentication (HMAC) to check the integrity of authentication exchanges. In addition, it provides authentication with less energy consumption, and it terminates with a session key agreement between each sensor and the Base Station. To assess our scheme, we carry out a performance and security analysis. The obtained results show that our scheme saves energy. In addition, it is resistant against different types of attacks.
{"title":"A Lightweight Authentication Scheme for E-Health Applications in the Context of Internet of Things","authors":"Hamza Khemissa, Djamel Tandjaoui","doi":"10.1109/NGMAST.2015.31","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.31","url":null,"abstract":"The strong development of the Internet of Things (IoT) is changing traditional perceptions of the current Internet towards a vision of smart objects interacting with each other. In this vision e-health applications are one of the most promising applications in IoT. However, security issues are the major obstacle for their deployment. Among these issues, authentication of the different interconnected entities and exchanged data confidentiality constitutes the main concerns for users that need to be addressed. In this paper, we propose a new lightweight authentication scheme for an e-health application. This scheme allows both of sensors and the Base Station (BS) to authenticate each other in order to secure the collection of health-related data. Our scheme uses nonces and Keyed-Hash message authentication (HMAC) to check the integrity of authentication exchanges. In addition, it provides authentication with less energy consumption, and it terminates with a session key agreement between each sensor and the Base Station. To assess our scheme, we carry out a performance and security analysis. The obtained results show that our scheme saves energy. In addition, it is resistant against different types of attacks.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126100607","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}
A substitution network is a temporary network that self-deploys to dynamically replace a portion of a damaged infrastructure by means of a fleet of mobile routers. Some efficient solutions deploy robots based on active measurements. A robot/node in the network may use active link monitoring to assess the link quality towards its neighbors through the use of probe packets. Such probe packets are sent periodically at a given rate, and so, the accuracy of the measurements depends on the number and the frequency of exchanged packets. However, exchanging probe packets is energy and bandwidth consuming, thus active monitoring is considered as a costly mechanism. Even so, active link monitoring is a technique widely used on many network protocols. In this paper, we focus on an adaptive positioning algorithm (APOLO) to self-deploy a network. APOLO is based on active monitoring to gather essential information from nodes. Therefore, we show how autoregressive estimation may be used to reduce the overhead caused by the active measuring technique. Moreover, it is possible to use surrogate data rather than real data to feed APOLO without impacting its performance.
{"title":"An Autoregressive Estimator for Overhead Reduction in Substitution Networks","authors":"K. Miranda, N. Mitton, V. Ramos","doi":"10.1109/NGMAST.2015.55","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.55","url":null,"abstract":"A substitution network is a temporary network that self-deploys to dynamically replace a portion of a damaged infrastructure by means of a fleet of mobile routers. Some efficient solutions deploy robots based on active measurements. A robot/node in the network may use active link monitoring to assess the link quality towards its neighbors through the use of probe packets. Such probe packets are sent periodically at a given rate, and so, the accuracy of the measurements depends on the number and the frequency of exchanged packets. However, exchanging probe packets is energy and bandwidth consuming, thus active monitoring is considered as a costly mechanism. Even so, active link monitoring is a technique widely used on many network protocols. In this paper, we focus on an adaptive positioning algorithm (APOLO) to self-deploy a network. APOLO is based on active monitoring to gather essential information from nodes. Therefore, we show how autoregressive estimation may be used to reduce the overhead caused by the active measuring technique. Moreover, it is possible to use surrogate data rather than real data to feed APOLO without impacting its performance.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128587808","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}
M. Chenait, B. Zebbane, Lyes Boufennara, Lotfi Haouaya, Chafika Benzaid, N. Badache
In wireless sensor networks, preserving sensing k-coverage with energy constraint is a basic issue drawing increasing attentions. In fact, the k-coverage configuration is extensively exploited to ensure that each location is covered by at least k active sensor nodes. However, most of these algorithms incur several drawbacks like: i) The need of a global view of the monitored field ii) Redundant sensor occurrence, and iii) Considerably high computation cost. We propose, in this paper, (LSEA) a distributed Lightweight Sector Eligibility Algorithm that settles all of the above critical problems and prove that a monitored area is k-covered with very low cost. LSEA proves that whether a sensor is eligible to sleep (redundant) or stay active can be accurately determined by simply checking if its neighbours belong to a well known set of points within its sensing range (Flower Area). LSEA has a computational complexity of O(N), where N is the number of neighboring nodes, lower than the complexity of many other eligibility algorithms. Simulation results confirm the theoretical analysis.
{"title":"LSEA: Light Weight Sector Eligibility Algorithm for k-Coverage in Wireless Sensor Networks","authors":"M. Chenait, B. Zebbane, Lyes Boufennara, Lotfi Haouaya, Chafika Benzaid, N. Badache","doi":"10.1109/NGMAST.2015.66","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.66","url":null,"abstract":"In wireless sensor networks, preserving sensing k-coverage with energy constraint is a basic issue drawing increasing attentions. In fact, the k-coverage configuration is extensively exploited to ensure that each location is covered by at least k active sensor nodes. However, most of these algorithms incur several drawbacks like: i) The need of a global view of the monitored field ii) Redundant sensor occurrence, and iii) Considerably high computation cost. We propose, in this paper, (LSEA) a distributed Lightweight Sector Eligibility Algorithm that settles all of the above critical problems and prove that a monitored area is k-covered with very low cost. LSEA proves that whether a sensor is eligible to sleep (redundant) or stay active can be accurately determined by simply checking if its neighbours belong to a well known set of points within its sensing range (Flower Area). LSEA has a computational complexity of O(N), where N is the number of neighboring nodes, lower than the complexity of many other eligibility algorithms. Simulation results confirm the theoretical analysis.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116189122","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}
R. D. Sparrow, A. A. Adekunle, R. J. Berry, R. Farnish
Unmanned control vehicles are used for a variety of scenarios where the user can conduct a task from a remote location, scenarios include surveillance, disaster recovery and agricultural farming. The operation of unmanned vehicles is generally conducted over a wireless communication medium. The nature of the wireless broadcast allows attackers to exploit security vulnerabilities through passive and active attacks, consequently, cryptography is often selected as a countermeasure to the aforementioned attacks. This paper analyses simulation undertaken to identify the affect of cryptographic constructs on the Quality of Service (QoS) and Quality of Experience (QoE) of controlling an unmanned vehicle. Results indicate that standardised AEAD cryptographic approaches can increase the additional distance travelled by a unmanned vehicle over multiple hops communications up to 110 meters per second.
{"title":"The Affect of Two Cryptographic Constructs on QoS and QoE for Unmanned Control Vehicles","authors":"R. D. Sparrow, A. A. Adekunle, R. J. Berry, R. Farnish","doi":"10.1109/NGMAST.2015.46","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.46","url":null,"abstract":"Unmanned control vehicles are used for a variety of scenarios where the user can conduct a task from a remote location, scenarios include surveillance, disaster recovery and agricultural farming. The operation of unmanned vehicles is generally conducted over a wireless communication medium. The nature of the wireless broadcast allows attackers to exploit security vulnerabilities through passive and active attacks, consequently, cryptography is often selected as a countermeasure to the aforementioned attacks. This paper analyses simulation undertaken to identify the affect of cryptographic constructs on the Quality of Service (QoS) and Quality of Experience (QoE) of controlling an unmanned vehicle. Results indicate that standardised AEAD cryptographic approaches can increase the additional distance travelled by a unmanned vehicle over multiple hops communications up to 110 meters per second.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125981863","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}
Wireless Sensor Networks is extensively used in many of applications related to different fields. Some of those applications deal with confidential and critical data that must be protected from unauthorized access. Some other systems use WSNs that are deployed in very harsh environments with limited energy resources. Those systems cannot tolerate network failures that can be caused by network intruders. In this paper, an efficient intrusion detection model is introduced. The model uses intelligent techniques to detect intrusions. Two different architectures are introduced. The first architecture represents the level of sensor node, sink node, and base station. The second architecture represents the levels of sensor and sink nodes. This work proposes two intrusion detection algorithms, one uses a supervised learning mechanism to be used on the level of the sensor node and the other uses an unsupervised learning mechanism to be used on the levels of both the sink node and base station. The output of the algorithms is a set of detection rules which are structured in the form of binary tree. The introduced algorithms provided a high detection accuracy using less number of selected features, compared to previous work for intrusion detection, which decreases the complexity and the processing time. The proposed learning algorithms used only 10% of the data for training. An enhancement for J48 classification algorithm is also introduced which decreases the size of the algorithm's decision tree and makes it suitable to be used for intrusion detection in WSNs.
{"title":"Distributed Intrusion Detection System for Wireless Sensor Networks","authors":"K. Medhat, R. Ramadan, I. Talkhan","doi":"10.1109/NGMAST.2015.29","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.29","url":null,"abstract":"Wireless Sensor Networks is extensively used in many of applications related to different fields. Some of those applications deal with confidential and critical data that must be protected from unauthorized access. Some other systems use WSNs that are deployed in very harsh environments with limited energy resources. Those systems cannot tolerate network failures that can be caused by network intruders. In this paper, an efficient intrusion detection model is introduced. The model uses intelligent techniques to detect intrusions. Two different architectures are introduced. The first architecture represents the level of sensor node, sink node, and base station. The second architecture represents the levels of sensor and sink nodes. This work proposes two intrusion detection algorithms, one uses a supervised learning mechanism to be used on the level of the sensor node and the other uses an unsupervised learning mechanism to be used on the levels of both the sink node and base station. The output of the algorithms is a set of detection rules which are structured in the form of binary tree. The introduced algorithms provided a high detection accuracy using less number of selected features, compared to previous work for intrusion detection, which decreases the complexity and the processing time. The proposed learning algorithms used only 10% of the data for training. An enhancement for J48 classification algorithm is also introduced which decreases the size of the algorithm's decision tree and makes it suitable to be used for intrusion detection in WSNs.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131419441","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}
A. Morris, C. Patsakis, M. Dragone, A. Manzoor, V. Cahill, Mélanie Bouroche
Mobile applications envisaged in the Smart City rely on the capacity of acquiring context from a vast array of sensors and other data sources, to deliver context-aware services at an urban scale whilst leveraging the Internet of Things (IoT). This work analyses existing context dissemination techniques, encompassing both probabilistic and deterministic algorithms, and advocates the case for ACT (Adaptive Context Tries), a novel urban scale technique with a dissemination complexity and context availability that fulfils the requirements of Context-Aware Smart City applications. A number of enabling technologies and middleware solutions already exists supporting the provision and the sharing of context in small scale scenarios. It also shows that existing context dissemination techniques used in State of the Art middleware do not provide solutions that support context-aware applications in urban scale and dynamic, mobile environments. Results show ACT provides a scalable approach that incurs logarithmic growth in overhead with respect to the number of participating peers in the system without compromising the completeness, reliability, or timeliness of disseminated context.
{"title":"Urban Scale Context Dissemination in the Internet of Things: Challenge Accepted","authors":"A. Morris, C. Patsakis, M. Dragone, A. Manzoor, V. Cahill, Mélanie Bouroche","doi":"10.1109/NGMAST.2015.62","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.62","url":null,"abstract":"Mobile applications envisaged in the Smart City rely on the capacity of acquiring context from a vast array of sensors and other data sources, to deliver context-aware services at an urban scale whilst leveraging the Internet of Things (IoT). This work analyses existing context dissemination techniques, encompassing both probabilistic and deterministic algorithms, and advocates the case for ACT (Adaptive Context Tries), a novel urban scale technique with a dissemination complexity and context availability that fulfils the requirements of Context-Aware Smart City applications. A number of enabling technologies and middleware solutions already exists supporting the provision and the sharing of context in small scale scenarios. It also shows that existing context dissemination techniques used in State of the Art middleware do not provide solutions that support context-aware applications in urban scale and dynamic, mobile environments. Results show ACT provides a scalable approach that incurs logarithmic growth in overhead with respect to the number of participating peers in the system without compromising the completeness, reliability, or timeliness of disseminated context.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134163364","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}
Jan Franz Palngipang, Miguel Luis Ting, Rowel Atienza
Interactive digital displays are now finding their way in various public spaces as tools for information dissemination. Current methods of deploying such technologies include installation of large screens along with expensive and bulky dedicated machines making them costly for multiple deployments. Interaction with these displays is done through sensors or through mobile applications but often fail to fully engage the user with the display. These implementations are plagued by content management and presentation issues, oftentimes multiple contents obstructing each other. To solve these problems, we developed BBCast, a cloud-based interactive bulletin board. Having the system deployed on the cloud eliminates the need for dedicated servers on site, therefore cutting cost and saving space. Interaction with the display is done through an Android application integrated with social media services to fully engage the user, allowing users share content in ways that they are accustomed to. The displayed contents are organized in a grid where a particular media type goes to its corresponding widget. This project was deployed in the lobby of an academic institution where at least 1,000 people pass by everyday and tested for Quality of Experience.
{"title":"BBCast: Cloud-Based Interactive Public Bulletin Board","authors":"Jan Franz Palngipang, Miguel Luis Ting, Rowel Atienza","doi":"10.1109/NGMAST.2015.33","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.33","url":null,"abstract":"Interactive digital displays are now finding their way in various public spaces as tools for information dissemination. Current methods of deploying such technologies include installation of large screens along with expensive and bulky dedicated machines making them costly for multiple deployments. Interaction with these displays is done through sensors or through mobile applications but often fail to fully engage the user with the display. These implementations are plagued by content management and presentation issues, oftentimes multiple contents obstructing each other. To solve these problems, we developed BBCast, a cloud-based interactive bulletin board. Having the system deployed on the cloud eliminates the need for dedicated servers on site, therefore cutting cost and saving space. Interaction with the display is done through an Android application integrated with social media services to fully engage the user, allowing users share content in ways that they are accustomed to. The displayed contents are organized in a grid where a particular media type goes to its corresponding widget. This project was deployed in the lobby of an academic institution where at least 1,000 people pass by everyday and tested for Quality of Experience.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"73 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113962407","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}
High precision spectrum sensing is a critical component in cognitive radio systems. This is more critical when our interested bandwidth is very wide in noisy channel environments. There are many detection ways for spectrum sensing, but each of them has their problems. In this paper we use cyclostationary feature detection which is robust against noise uncertainty, but it needs very high sampling rate, especially when the interested frequency band is wideband. Hence its computational and hardware cost are high, Compressive sensing is a new sub-Nyquist sampling method, which asserts can completely recover specific signals, which are sparse in a certain domain. This paper helps to reduce the required sampling rate of cyclic detector by using the compressive sensing procedure and exploiting the sparsity of the cyclic features in the two-dimensional cyclic spectrum domain. In addition this paper proposes new scheme for reformulating the linear relationship between the compressive samples acquired in frequency domain and the two-dimensional cyclic spectrum. Simulations show that the proposed spectrum sensing scheme can reduce the required sampling rate with little performance loss, and is robust against noise uncertainty in low SNR conditions, also show that the reconstruction accuracy and probability of detection for proposed scheme is higher than for existence methods.
{"title":"Compressive Wideband Spectrum Sensing in Cognitive Radio Systems Based on Cyclostationary Feature Detection","authors":"Mohammad-Ali Damavandi, S. Nader-Esfahani","doi":"10.1109/NGMAST.2015.30","DOIUrl":"https://doi.org/10.1109/NGMAST.2015.30","url":null,"abstract":"High precision spectrum sensing is a critical component in cognitive radio systems. This is more critical when our interested bandwidth is very wide in noisy channel environments. There are many detection ways for spectrum sensing, but each of them has their problems. In this paper we use cyclostationary feature detection which is robust against noise uncertainty, but it needs very high sampling rate, especially when the interested frequency band is wideband. Hence its computational and hardware cost are high, Compressive sensing is a new sub-Nyquist sampling method, which asserts can completely recover specific signals, which are sparse in a certain domain. This paper helps to reduce the required sampling rate of cyclic detector by using the compressive sensing procedure and exploiting the sparsity of the cyclic features in the two-dimensional cyclic spectrum domain. In addition this paper proposes new scheme for reformulating the linear relationship between the compressive samples acquired in frequency domain and the two-dimensional cyclic spectrum. Simulations show that the proposed spectrum sensing scheme can reduce the required sampling rate with little performance loss, and is robust against noise uncertainty in low SNR conditions, also show that the reconstruction accuracy and probability of detection for proposed scheme is higher than for existence methods.","PeriodicalId":217588,"journal":{"name":"2015 9th International Conference on Next Generation Mobile Applications, Services and Technologies","volume":"602 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116334326","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
扫码关注我们
求助内容：
应助结果提醒方式：