Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710155
Uyoata Uyoata, M. Dlodlo, Joyce B. Mwangama
Device-to-device (D2D) multicast communication can be employed in distributing popular content among similarly interested groups thereby reducing the load on the network. When the network multicasts a requested file to a cluster or group of users, some members of a cluster may not receive the sent data correctly and so may require re-transmission by other selected group members through D2D multicast communication. In analysing D2D communication, the availability of perfect channel information (CSI) is mostly assumed. Hence the need for a channel uncertainty aware D2D multicast communication analysis. In this paper a multicast D2D communication underlaying uplink cellular communication is formulated as a robust optimisation problem that caters for uncertainty in the interference channels between D2D multicast groups within a cell. K-means algorithm is employed to create D2D groups. Using simulations, the impact of factoring in channel uncertainty is demonstrated. The gains of group communication is also shown through simulation as increasing the number of groups provides a pronounced increase in D2D data rate specifically in moving from 2 to 3 groups there is an increase of 2 bps/Hz. Furthermore, the effect of D2D group dimension on the transmission data rate is also shown through the numerical results with a drop of upto 0.5 bps/Hz for a variation of 20 to 60 m.
{"title":"Robust Multicast Device-to-Device Communication","authors":"Uyoata Uyoata, M. Dlodlo, Joyce B. Mwangama","doi":"10.1109/ANTS.2018.8710155","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710155","url":null,"abstract":"Device-to-device (D2D) multicast communication can be employed in distributing popular content among similarly interested groups thereby reducing the load on the network. When the network multicasts a requested file to a cluster or group of users, some members of a cluster may not receive the sent data correctly and so may require re-transmission by other selected group members through D2D multicast communication. In analysing D2D communication, the availability of perfect channel information (CSI) is mostly assumed. Hence the need for a channel uncertainty aware D2D multicast communication analysis. In this paper a multicast D2D communication underlaying uplink cellular communication is formulated as a robust optimisation problem that caters for uncertainty in the interference channels between D2D multicast groups within a cell. K-means algorithm is employed to create D2D groups. Using simulations, the impact of factoring in channel uncertainty is demonstrated. The gains of group communication is also shown through simulation as increasing the number of groups provides a pronounced increase in D2D data rate specifically in moving from 2 to 3 groups there is an increase of 2 bps/Hz. Furthermore, the effect of D2D group dimension on the transmission data rate is also shown through the numerical results with a drop of upto 0.5 bps/Hz for a variation of 20 to 60 m.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128830996","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 : 2018-12-01DOI: 10.1109/ants.2018.8710047
{"title":"ANTS 2018 Other Reviewers","authors":"","doi":"10.1109/ants.2018.8710047","DOIUrl":"https://doi.org/10.1109/ants.2018.8710047","url":null,"abstract":"","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127949661","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}
Recent advances in sensor technology has influenced various aspects of human-life. It has highly improved the monitoring and control applications. Precision agriculture is one such application that requires real-time monitoring of agricultural field to take smarter decisions. A deterministic deployment strategy in Wireless Sensor Networks (WSNs) is used to deploy sensor nodes in a predefine deployment pattern to cover the entire monitoring region. This paper presents a system that monitors the agricultural field in real-time by using a single mobile sink in WSNs. We use the square deployment pattern for placement of the sensors in the agriculture field. A prototype is also developed and tested on real-time agricultural field data. The prototype uses temperature, humidity, and soil moisture sensors attached with NodeMCU. The system uses Wi-Fi for transferring the data collected from sensors to the mobile sink.
{"title":"A Real-time Precision Agriculture Monitoring System using Mobile Sink in WSNs","authors":"Ashish Gupta, Hari Prabhat Gupta, Preti Kumari, Rahul Mishra, Surbhi Saraswat, Tanima Dutta","doi":"10.1109/ANTS.2018.8710048","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710048","url":null,"abstract":"Recent advances in sensor technology has influenced various aspects of human-life. It has highly improved the monitoring and control applications. Precision agriculture is one such application that requires real-time monitoring of agricultural field to take smarter decisions. A deterministic deployment strategy in Wireless Sensor Networks (WSNs) is used to deploy sensor nodes in a predefine deployment pattern to cover the entire monitoring region. This paper presents a system that monitors the agricultural field in real-time by using a single mobile sink in WSNs. We use the square deployment pattern for placement of the sensors in the agriculture field. A prototype is also developed and tested on real-time agricultural field data. The prototype uses temperature, humidity, and soil moisture sensors attached with NodeMCU. The system uses Wi-Fi for transferring the data collected from sensors to the mobile sink.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121441931","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710154
Camden Thatcher, Subrata Acharya
This research identifies a conceptual e-Prescription system based on blockchain technology. The system utilizes cryptocurrency principles applied to the electronic prescription processes to achieve its goals. This e-Prescription system can be utilized as a combatant to the nationwide opioid crisis as a potential Prescription Drug Monitoring System (PDMP). While not a fully evaluated system, the proof of concept results presented have significant demonstrated potential. Moreover, the concepts can be used to create a system that can serve as an inspiration to use blockchain technology in healthcare applications.
{"title":"Pharmaceutical uses of Blockchain Technology","authors":"Camden Thatcher, Subrata Acharya","doi":"10.1109/ANTS.2018.8710154","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710154","url":null,"abstract":"This research identifies a conceptual e-Prescription system based on blockchain technology. The system utilizes cryptocurrency principles applied to the electronic prescription processes to achieve its goals. This e-Prescription system can be utilized as a combatant to the nationwide opioid crisis as a potential Prescription Drug Monitoring System (PDMP). While not a fully evaluated system, the proof of concept results presented have significant demonstrated potential. Moreover, the concepts can be used to create a system that can serve as an inspiration to use blockchain technology in healthcare applications.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123214686","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710090
Santoshkumar Sabat, P. Sharma, A. Gandhi
In this paper, a mobile secondary user (SU) having in-band full-duplex (FD) ability is considered. We investigate the effect of the SU mobility and residual self-interference (RSI) on sensing performance. The fading channel between primary and secondary users is considered to be time-selective frequency flat Rayleigh fading channel. The RSI channel is also assumed to be Rayleigh fading channel. We analytically derive the closed form expressions for false alarm and detection probabilities. Moreover we analyse the receiver operating characteristics (ROC) and total error rate (TER) performance using energy detector (ED). The results show that the sensing performance degrades with increase in secondary user’s speed and also due to RSI. The results are verified through Monte Carlo simulations.
{"title":"Spectrum Sensing in Mobile Full-Duplex Cognitive Radio","authors":"Santoshkumar Sabat, P. Sharma, A. Gandhi","doi":"10.1109/ANTS.2018.8710090","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710090","url":null,"abstract":"In this paper, a mobile secondary user (SU) having in-band full-duplex (FD) ability is considered. We investigate the effect of the SU mobility and residual self-interference (RSI) on sensing performance. The fading channel between primary and secondary users is considered to be time-selective frequency flat Rayleigh fading channel. The RSI channel is also assumed to be Rayleigh fading channel. We analytically derive the closed form expressions for false alarm and detection probabilities. Moreover we analyse the receiver operating characteristics (ROC) and total error rate (TER) performance using energy detector (ED). The results show that the sensing performance degrades with increase in secondary user’s speed and also due to RSI. The results are verified through Monte Carlo simulations.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115668984","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710053
R. Ravichandran, M. Moorthy, S. Seetharaman
As networks grow in size, heterogeneity and complexity, automated management and end-to-end orchestration to maintain service-level agreements (SLAs) becomes essential. With the advent of 5G, network slicing adds another dimension to this challenge. Cognitive functions play a key role in autonomic orchestration, and as cognitive functions increase in number, variety and are increasingly distributed in order to play a more effective role. In such a scenario, effective end-to-end orchestration of the cognitive functions is vital to reap the full benefits of the available intelligence for automated operation. Existing work in orchestrating cognitive functions has limitations in scope and coverage, and addresses only certain aspects. We propose a dynamic, impact-aware and context-aware end-to-end orchestration of cognitive functions in the network, resulting in improved overall SLA adherence of all services and network slices, and improved operational efficiency by minimizing human intervention.
{"title":"Mechanism of dynamic, impact-aware and context-aware orchestration of cognitive functions in 5G networks","authors":"R. Ravichandran, M. Moorthy, S. Seetharaman","doi":"10.1109/ANTS.2018.8710053","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710053","url":null,"abstract":"As networks grow in size, heterogeneity and complexity, automated management and end-to-end orchestration to maintain service-level agreements (SLAs) becomes essential. With the advent of 5G, network slicing adds another dimension to this challenge. Cognitive functions play a key role in autonomic orchestration, and as cognitive functions increase in number, variety and are increasingly distributed in order to play a more effective role. In such a scenario, effective end-to-end orchestration of the cognitive functions is vital to reap the full benefits of the available intelligence for automated operation. Existing work in orchestrating cognitive functions has limitations in scope and coverage, and addresses only certain aspects. We propose a dynamic, impact-aware and context-aware end-to-end orchestration of cognitive functions in the network, resulting in improved overall SLA adherence of all services and network slices, and improved operational efficiency by minimizing human intervention.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130761600","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710071
Deepak Nadig, Eun-Sung Jung, R. Kettimuthu, Ian T Foster, N. Rao, B. Ramamurthy
Data transfer in wide-area networks has been long studied in different contexts, from data sharing among data centers to online access to scientific data. Many software tools and platforms have been developed to facilitate easy, reliable, fast, and secure data transfer over wide area networks, such as GridFTP, FDT, bbcp, mdtmFTP, and XDD. However, few studies have shown the full capabilities of existing data transfer tools from the perspective of whether such tools have fully adopted state-of-the-art techniques through meticulous comparative evaluations. In this paper, we evaluate the performance of the four highperformance data transfer tools (GridFTP, FDT, mdtmFTP, and XDD) in various environments. Our evaluation suggests that each tool has strengths and weaknesses. FDT and GridFTP perform consistently in diverse environments. XDD and mdtmFTP show improved performance in limited environments and datasets during our evaluation. Unlike other studies on data transfer tools, we also evaluate the predictability of the tools’ performance, an important factor for scheduling different stages of science workflows. Performance predictability also helps in (auto)tuning the configurable parameters of the data transfer tool. We apply statistical learning techniques such as linear/polynomial regression, and k-nearest neighbors (kNN), to assess the performance predictability of each tool using its control parameters. Our results show that we can achieve good prediction performance for GridFTP and mdtmFTP using linear regression and kNN, respectively.
{"title":"Comparative Performance Evaluation of High-performance Data Transfer Tools","authors":"Deepak Nadig, Eun-Sung Jung, R. Kettimuthu, Ian T Foster, N. Rao, B. Ramamurthy","doi":"10.1109/ANTS.2018.8710071","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710071","url":null,"abstract":"Data transfer in wide-area networks has been long studied in different contexts, from data sharing among data centers to online access to scientific data. Many software tools and platforms have been developed to facilitate easy, reliable, fast, and secure data transfer over wide area networks, such as GridFTP, FDT, bbcp, mdtmFTP, and XDD. However, few studies have shown the full capabilities of existing data transfer tools from the perspective of whether such tools have fully adopted state-of-the-art techniques through meticulous comparative evaluations. In this paper, we evaluate the performance of the four highperformance data transfer tools (GridFTP, FDT, mdtmFTP, and XDD) in various environments. Our evaluation suggests that each tool has strengths and weaknesses. FDT and GridFTP perform consistently in diverse environments. XDD and mdtmFTP show improved performance in limited environments and datasets during our evaluation. Unlike other studies on data transfer tools, we also evaluate the predictability of the tools’ performance, an important factor for scheduling different stages of science workflows. Performance predictability also helps in (auto)tuning the configurable parameters of the data transfer tool. We apply statistical learning techniques such as linear/polynomial regression, and k-nearest neighbors (kNN), to assess the performance predictability of each tool using its control parameters. Our results show that we can achieve good prediction performance for GridFTP and mdtmFTP using linear regression and kNN, respectively.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115854466","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710170
Mayank Swarnkar, N. Hubballi, Nikhil Tripathi, M. Conti
Traffic classification finds its application in the implementation of various services like Quality of Service (QoS) and security monitoring. In today’s networks, a significant portion of traffic is generated from mobile applications. Thus, a robust and accurate mobile application traffic classification technique is needed. In this paper, we propose AppHunter, a mobile application classification technique to classify Android applications using Deep Packet Inspection (DPI). Unlike previously known mobile application classification techniques, AppHunter is an unsupervised approach and does not require training with flows explicitly collected for each application. AppHunter extracts required fields from HTTP/HTTPS header of a flow and compares them with application details extracted from Google Playstore. We test the classification performance of AppHunter with two publicly available datasets and one dataset generated by simulating more than thousand applications in our testbed setup and report the results. We also show an application of AppHunter by using its rules for network traffic filtering and shaping.
{"title":"AppHunter: Mobile Application Traffic Classification","authors":"Mayank Swarnkar, N. Hubballi, Nikhil Tripathi, M. Conti","doi":"10.1109/ANTS.2018.8710170","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710170","url":null,"abstract":"Traffic classification finds its application in the implementation of various services like Quality of Service (QoS) and security monitoring. In today’s networks, a significant portion of traffic is generated from mobile applications. Thus, a robust and accurate mobile application traffic classification technique is needed. In this paper, we propose AppHunter, a mobile application classification technique to classify Android applications using Deep Packet Inspection (DPI). Unlike previously known mobile application classification techniques, AppHunter is an unsupervised approach and does not require training with flows explicitly collected for each application. AppHunter extracts required fields from HTTP/HTTPS header of a flow and compares them with application details extracted from Google Playstore. We test the classification performance of AppHunter with two publicly available datasets and one dataset generated by simulating more than thousand applications in our testbed setup and report the results. We also show an application of AppHunter by using its rules for network traffic filtering and shaping.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"04 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128862015","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 : 2018-12-01DOI: 10.1109/ants.2018.8710157
The 3GPP has designed the authentication and key agreement (AKA) protocol for the 5G network to overcome the security deficiencies found in (Evolved Packet Service) EPS-AKA protocol of Long Term Evolution-Advanced (LTE-A) network. However, the existing 5G-AKA protocol is vulnerable to several attacks such as impersonation, man-in-the-middle, and denial of service attack. The identified protocol vulnerabilities would enable an adversary to impersonate the legitimate mobile user and the serving network. In addition, the communication entities incur high computational overhead. In this paper, we propose the generic construction for efficient and secure AKA protocol in the 5G network. For the correctness of the protocol, the formal verification is carried out using the AVISPA tool. In addition, the security analysis illustrates that the protocol fulfills all the security requirements and is secure against the known attacks. Moreover, the performance evaluation of the protocol shows less communication and computation overhead during the AKA process of 5G network.
{"title":"A Generic Construction for Efficient and Secure AKA Protocol in 5G Network","authors":"","doi":"10.1109/ants.2018.8710157","DOIUrl":"https://doi.org/10.1109/ants.2018.8710157","url":null,"abstract":"The 3GPP has designed the authentication and key agreement (AKA) protocol for the 5G network to overcome the security deficiencies found in (Evolved Packet Service) EPS-AKA protocol of Long Term Evolution-Advanced (LTE-A) network. However, the existing 5G-AKA protocol is vulnerable to several attacks such as impersonation, man-in-the-middle, and denial of service attack. The identified protocol vulnerabilities would enable an adversary to impersonate the legitimate mobile user and the serving network. In addition, the communication entities incur high computational overhead. In this paper, we propose the generic construction for efficient and secure AKA protocol in the 5G network. For the correctness of the protocol, the formal verification is carried out using the AVISPA tool. In addition, the security analysis illustrates that the protocol fulfills all the security requirements and is secure against the known attacks. Moreover, the performance evaluation of the protocol shows less communication and computation overhead during the AKA process of 5G network.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115774423","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 : 2018-12-01DOI: 10.1109/ANTS.2018.8710134
M. Santhoshkumar, Dony J. Muttath, K. Premkumar
We consider a Cognitive Radio Network having one Primary User (PU) and N Secondary Users (SUs). In this paper, we study the problem of joint channel–sensing and channel– access for SUs. When the channel is in use by the PU, the signal that the PU sends and the channel fading gains are unknown to SUs. The channel sensing problem that we consider is detecting whether or not there is an unknown signal (with random fading) in noise. For this channel–sensing problem, we propose a sequential detection procedure based on the energy of samples that each SU observes. As soon as an SU detects the idle/busy state of the channel, it broadcasts it’s local decision to all other SUs. We propose a global decision rule that makes a decision that the channel is idle, only if at least $Gamma$ out of N SUs have broadcast idle local decisions; otherwise, the global decision rule makes a decision that the channel is busy. Also, the channel access is provided to the SU that is the first one to broadcast an idle decision. We study the detection and false-alarm performance of our proposed procedure, and compare the performance with that of Sequential Probability Ratio Test (SPRT) based sensing procedure. From the Receiver Operating Characteristic (ROC), and the average sample number (ASN) metrics, we observe that our energy based sequential sensing procedure yields a better probability of detection than the SPRT based procedure for a given probability of false-alarm. Also, as the threshold on the number of idle local decisions $Gamma$ increases, probability of detection also increases, but at the cost of detection delay.
{"title":"Joint Distributed Sensing and Channel Access in Cognitive Radio Networks","authors":"M. Santhoshkumar, Dony J. Muttath, K. Premkumar","doi":"10.1109/ANTS.2018.8710134","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710134","url":null,"abstract":"We consider a Cognitive Radio Network having one Primary User (PU) and N Secondary Users (SUs). In this paper, we study the problem of joint channel–sensing and channel– access for SUs. When the channel is in use by the PU, the signal that the PU sends and the channel fading gains are unknown to SUs. The channel sensing problem that we consider is detecting whether or not there is an unknown signal (with random fading) in noise. For this channel–sensing problem, we propose a sequential detection procedure based on the energy of samples that each SU observes. As soon as an SU detects the idle/busy state of the channel, it broadcasts it’s local decision to all other SUs. We propose a global decision rule that makes a decision that the channel is idle, only if at least $Gamma$ out of N SUs have broadcast idle local decisions; otherwise, the global decision rule makes a decision that the channel is busy. Also, the channel access is provided to the SU that is the first one to broadcast an idle decision. We study the detection and false-alarm performance of our proposed procedure, and compare the performance with that of Sequential Probability Ratio Test (SPRT) based sensing procedure. From the Receiver Operating Characteristic (ROC), and the average sample number (ASN) metrics, we observe that our energy based sequential sensing procedure yields a better probability of detection than the SPRT based procedure for a given probability of false-alarm. Also, as the threshold on the number of idle local decisions $Gamma$ increases, probability of detection also increases, but at the cost of detection delay.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133564223","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
扫码关注我们
求助内容：
应助结果提醒方式：