Pub Date : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685428
B. Turan, A. Uyrus, Osman Nuri Koç, Emrah Kar, S. Coleri
Heterogeneous vehicular communications aim to improve the reliability, security and delay performance of vehicle-to-vehicle (V2V) communications, by utilizing multiple commu-nication technologies. Predicting the path loss through conventional fitting based models and radio frequency (RF) jamming detection through rule based models of different communication schemes fail to address comprehensive mobility and jamming scenarios. In this paper, we propose a machine learning based adaptive link quality estimation and jamming detection scheme for the optimum selection and aggregation of IEEE 802.11p and Vehicular Visible Light Communications (V-VLC) technologies targeting reliable V2V communications. We propose to use Random Forest regression and classifier based algorithms, where multiple individual learners with diversity are trained by using measurement data and the final result is obtained by averaging outputs of all learners. We test our framework on real-world road measurement data, demonstrating up to 2.34 dB and 0.56 dB Mean Absolute Error (MAE) improvement for V-VLC and IEEE 802.11p path loss prediction compared to fitting based models, respectively. The proposed jamming presence detection scheme yields 88.3% accuracy to detect noise interference injection for IEEE 802.11p links, yielding 3% better prediction performance than previously proposed deep convolutional neural network (DCNN) based scheme.
{"title":"Machine Learning Aided Path Loss Estimator and Jammer Detector for Heterogeneous Vehicular Networks","authors":"B. Turan, A. Uyrus, Osman Nuri Koç, Emrah Kar, S. Coleri","doi":"10.1109/GLOBECOM46510.2021.9685428","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685428","url":null,"abstract":"Heterogeneous vehicular communications aim to improve the reliability, security and delay performance of vehicle-to-vehicle (V2V) communications, by utilizing multiple commu-nication technologies. Predicting the path loss through conventional fitting based models and radio frequency (RF) jamming detection through rule based models of different communication schemes fail to address comprehensive mobility and jamming scenarios. In this paper, we propose a machine learning based adaptive link quality estimation and jamming detection scheme for the optimum selection and aggregation of IEEE 802.11p and Vehicular Visible Light Communications (V-VLC) technologies targeting reliable V2V communications. We propose to use Random Forest regression and classifier based algorithms, where multiple individual learners with diversity are trained by using measurement data and the final result is obtained by averaging outputs of all learners. We test our framework on real-world road measurement data, demonstrating up to 2.34 dB and 0.56 dB Mean Absolute Error (MAE) improvement for V-VLC and IEEE 802.11p path loss prediction compared to fitting based models, respectively. The proposed jamming presence detection scheme yields 88.3% accuracy to detect noise interference injection for IEEE 802.11p links, yielding 3% better prediction performance than previously proposed deep convolutional neural network (DCNN) based scheme.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116620171","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 : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685967
B. Maham
In this paper, we consider a downlink Cloud Radio Access Network (Cloud-RAN) transmission, served by multiple beamformed remote radio head (RRHs) coordinated by base band units (BBUs), toward a typical mobile user. Assuming ultra-dense 5G and beyond network operating in millimeter wave (mm-Waves) bands, we modeled channels as a concatenation of Nakagami-m and binary blockage. In addition, it is assumed there are multiple interfering nodes nearby. We evaluate the system performance in terms of outage probability, after calculating channel distributions. Moreover, the impact of random blockage and interference on the performance of Nakagami-blockage channels with multiple RRHs are investigated by simulations.
{"title":"Performance Analysis of Ultra-Dense Millimeter Wave Cloud-RAN under Blockage and Interference","authors":"B. Maham","doi":"10.1109/GLOBECOM46510.2021.9685967","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685967","url":null,"abstract":"In this paper, we consider a downlink Cloud Radio Access Network (Cloud-RAN) transmission, served by multiple beamformed remote radio head (RRHs) coordinated by base band units (BBUs), toward a typical mobile user. Assuming ultra-dense 5G and beyond network operating in millimeter wave (mm-Waves) bands, we modeled channels as a concatenation of Nakagami-m and binary blockage. In addition, it is assumed there are multiple interfering nodes nearby. We evaluate the system performance in terms of outage probability, after calculating channel distributions. Moreover, the impact of random blockage and interference on the performance of Nakagami-blockage channels with multiple RRHs are investigated by simulations.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129497206","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 : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685592
Marion Dumay, D. Barthel, L. Toutain, Julien Lecoeuvre
The Internet of Things (IoT) paradigm brings together various applications and use cases, in several domains such as Smart City, e-Health, Industrial IoT, etc. The characteristics of these applications range from high-data rate streams to sporadic transmissions of small packets, including critical and low-latency traffic. Some of them such as telemetering, smart agriculture, asset tracking and environment monitoring also require an extended coverage and a long battery life (up to 10 years). Both non-3GPP and 3GPP technologies, such as Sigfox, LoraWAN, NB-IoT and LTE-M, were specifically designed to meet these specific requirements, by reducing for instance the bandwidth and the achievable data rate. These networks are so constrained that it is very challenging for them to support a standard, interoperable network stack, including security protocols. Nevertheless, these features would be highly desirable in order to ease and accelerate the deployment of IoT solutions involving various types of devices, from very constrained low-power sensors to high data rate cameras and critical actuators. In this paper, we study standard, interoperable and secure solutions and we show how Static Context Header Compression (SCHC), a generic compression and fragmentation mechanism, can be used to enable their support over constrained IoT networks. With our implementation, typical messages are shrunk from 80-100 bytes down to as little as 20-30 bytes.
{"title":"Effective interoperability and security support for constrained IoT networks","authors":"Marion Dumay, D. Barthel, L. Toutain, Julien Lecoeuvre","doi":"10.1109/GLOBECOM46510.2021.9685592","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685592","url":null,"abstract":"The Internet of Things (IoT) paradigm brings together various applications and use cases, in several domains such as Smart City, e-Health, Industrial IoT, etc. The characteristics of these applications range from high-data rate streams to sporadic transmissions of small packets, including critical and low-latency traffic. Some of them such as telemetering, smart agriculture, asset tracking and environment monitoring also require an extended coverage and a long battery life (up to 10 years). Both non-3GPP and 3GPP technologies, such as Sigfox, LoraWAN, NB-IoT and LTE-M, were specifically designed to meet these specific requirements, by reducing for instance the bandwidth and the achievable data rate. These networks are so constrained that it is very challenging for them to support a standard, interoperable network stack, including security protocols. Nevertheless, these features would be highly desirable in order to ease and accelerate the deployment of IoT solutions involving various types of devices, from very constrained low-power sensors to high data rate cameras and critical actuators. In this paper, we study standard, interoperable and secure solutions and we show how Static Context Header Compression (SCHC), a generic compression and fragmentation mechanism, can be used to enable their support over constrained IoT networks. With our implementation, typical messages are shrunk from 80-100 bytes down to as little as 20-30 bytes.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"42 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129852484","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 : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685130
Yilin Zhao, Yijie Xun, Jiajia Liu
Nowadays, more and more external interfaces are added into intelligent and connected vehicles. The in-vehicle network, especially the controller area network (CAN), is no longer a closed environment, which provides more approaches for attackers to invade. To resist attacks, numerous researchers have proposed intrusion detection systems (IDSs). However, attackers can intrude CAN bus in a more advanced way, such as masquerade attack, which leads to failures of most IDS. To counter masquerade attacks, we propose an efficient vehicle IDS based on clock behavior, called VehicleCIDS. First, the system uses recursive least squares (RLS) algorithm to estimate the clock behavior of each electronic control unit (ECU). Then, a statistical method called empirical rule is used to detect attack messages. Finally, it utilizes dynamic time warping (DTW) to identify attackers. The experimental results on real vehicles show that the recognition rate of VehicleCIDS can achieve 98.52% in intrusion detection and 87.71% in attacker identification.
{"title":"VehicleCIDS: An Efficient Vehicle Intrusion Detection System Based on Clock Behavior","authors":"Yilin Zhao, Yijie Xun, Jiajia Liu","doi":"10.1109/GLOBECOM46510.2021.9685130","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685130","url":null,"abstract":"Nowadays, more and more external interfaces are added into intelligent and connected vehicles. The in-vehicle network, especially the controller area network (CAN), is no longer a closed environment, which provides more approaches for attackers to invade. To resist attacks, numerous researchers have proposed intrusion detection systems (IDSs). However, attackers can intrude CAN bus in a more advanced way, such as masquerade attack, which leads to failures of most IDS. To counter masquerade attacks, we propose an efficient vehicle IDS based on clock behavior, called VehicleCIDS. First, the system uses recursive least squares (RLS) algorithm to estimate the clock behavior of each electronic control unit (ECU). Then, a statistical method called empirical rule is used to detect attack messages. Finally, it utilizes dynamic time warping (DTW) to identify attackers. The experimental results on real vehicles show that the recognition rate of VehicleCIDS can achieve 98.52% in intrusion detection and 87.71% in attacker identification.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129959141","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 : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685033
Kohei Yamamoto, Koji Endo, T. Ohtsuki
Remote sensing of heartbeat offers various applications in the medical and health care fields. To realize non-contact heartbeat detection, an FMCW (Frequency Modulated Continuous Wave) radar-based heartbeat detection method has been investigated. The conventional FMCW radar-based heartbeat detection method estimates a range from an FMCW radar to a subject and extracts heartbeat components from phase changes for the range. However, the range suitable for extracting heartbeat components can change over time due to respiration and body fluctuation. Thus, when the SNR (Signal-to-Noise Ratio) of heartbeat components over phase changes is low at the estimated range, the accuracy of heartbeat detection tends to degrade. In this paper, we propose a MIMO (Multiple-Input Multiple-Output) FMCW radar-based heartbeat detection method based on space diversity. A MIMO FMCW radar can estimate the range for multiple beam directions and obtain phase changes for a space specified with the range and the beam direction. The SNR of heartbeat components over phase changes differs from one space to another. Taking it into account, the proposed method detects heartbeat by exploiting the space diversity of phase changes. The experimental results showed that compared to the detection method using only one phase change, the proposed method using phase changes for multiple spaces detected heartbeat accurately, which is brought by the diversity effect of phase changes for multiple spaces.
{"title":"Remote Sensing of Heartbeat based on Space Diversity Using MIMO FMCW Radar","authors":"Kohei Yamamoto, Koji Endo, T. Ohtsuki","doi":"10.1109/GLOBECOM46510.2021.9685033","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685033","url":null,"abstract":"Remote sensing of heartbeat offers various applications in the medical and health care fields. To realize non-contact heartbeat detection, an FMCW (Frequency Modulated Continuous Wave) radar-based heartbeat detection method has been investigated. The conventional FMCW radar-based heartbeat detection method estimates a range from an FMCW radar to a subject and extracts heartbeat components from phase changes for the range. However, the range suitable for extracting heartbeat components can change over time due to respiration and body fluctuation. Thus, when the SNR (Signal-to-Noise Ratio) of heartbeat components over phase changes is low at the estimated range, the accuracy of heartbeat detection tends to degrade. In this paper, we propose a MIMO (Multiple-Input Multiple-Output) FMCW radar-based heartbeat detection method based on space diversity. A MIMO FMCW radar can estimate the range for multiple beam directions and obtain phase changes for a space specified with the range and the beam direction. The SNR of heartbeat components over phase changes differs from one space to another. Taking it into account, the proposed method detects heartbeat by exploiting the space diversity of phase changes. The experimental results showed that compared to the detection method using only one phase change, the proposed method using phase changes for multiple spaces detected heartbeat accurately, which is brought by the diversity effect of phase changes for multiple spaces.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128411052","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 : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685598
Hafsa Benaddi, Mohammed Jouhari, Khalil Ibrahimi, A. Benslimane
With considerable demand for higher throughput, greater capacity, and lower latency for consumers, the Internet of Things (IoT) network is anticipated to meet the desired security and privacy requirements. This study provides high transaction throughput on critical IoT applications, particularly Bitcoin security against double-spending attacks. To this end, we investigated the signaling game approach to model the interaction between two miners while considering players behavior (malicious or honest miners) and the incoming transaction throughput. To the best of our knowledge, this is the first work that exploits the signaling game to cover the incoming transactions randomness waiting for validation, which influences the honest miners behavior. With extensive simulations, we show that our proposed signaling game reduces the impact of double-spending attacks on IoT transactions. The results also illustrate the benefit of using the signaling game to model the interaction between two miners while handling the incomplete information of the incoming transactions and the type of miners.
{"title":"Securing IoT Transactions Against Double-Spending Attacks based on Signaling Game Approach","authors":"Hafsa Benaddi, Mohammed Jouhari, Khalil Ibrahimi, A. Benslimane","doi":"10.1109/GLOBECOM46510.2021.9685598","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685598","url":null,"abstract":"With considerable demand for higher throughput, greater capacity, and lower latency for consumers, the Internet of Things (IoT) network is anticipated to meet the desired security and privacy requirements. This study provides high transaction throughput on critical IoT applications, particularly Bitcoin security against double-spending attacks. To this end, we investigated the signaling game approach to model the interaction between two miners while considering players behavior (malicious or honest miners) and the incoming transaction throughput. To the best of our knowledge, this is the first work that exploits the signaling game to cover the incoming transactions randomness waiting for validation, which influences the honest miners behavior. With extensive simulations, we show that our proposed signaling game reduces the impact of double-spending attacks on IoT transactions. The results also illustrate the benefit of using the signaling game to model the interaction between two miners while handling the incomplete information of the incoming transactions and the type of miners.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128272502","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 : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685059
Fernando García Sanz, M. Ebrahimi, A. Johnsson
Transfer learning has been proposed as an approach for leveraging already learned knowledge in a new environment, especially when the amount of training data is limited. However, due to the dynamic nature of future networks and cloud infrastructures, a new environment may differ from the one the model is trained and transferred from. In this paper, we propose and evaluate an approach based on neural networks for heterogeneous transfer learning that addresses model transfer between environments with different input feature sets, which is a natural consequence of network and cloud re-orchestration. We quantify the transfer gain, and empirically show positive gain in a majority of cases. Further, we study the impact of neural-network architectures on the transfer gain, providing tradeoff insights for multiple cases. The evaluation of the approach is performed using data traces collected from a testbed that runs a Video-on-Demand service and a Key-Value Store under various load conditions.
{"title":"On Heterogeneous Transfer Learning for Improved Network Service Performance Prediction","authors":"Fernando García Sanz, M. Ebrahimi, A. Johnsson","doi":"10.1109/GLOBECOM46510.2021.9685059","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685059","url":null,"abstract":"Transfer learning has been proposed as an approach for leveraging already learned knowledge in a new environment, especially when the amount of training data is limited. However, due to the dynamic nature of future networks and cloud infrastructures, a new environment may differ from the one the model is trained and transferred from. In this paper, we propose and evaluate an approach based on neural networks for heterogeneous transfer learning that addresses model transfer between environments with different input feature sets, which is a natural consequence of network and cloud re-orchestration. We quantify the transfer gain, and empirically show positive gain in a majority of cases. Further, we study the impact of neural-network architectures on the transfer gain, providing tradeoff insights for multiple cases. The evaluation of the approach is performed using data traces collected from a testbed that runs a Video-on-Demand service and a Key-Value Store under various load conditions.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128573930","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 : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685463
Masoumeh Moradian, Aresh Dadlani
In this paper, we aim to derive the average age of information (AAoI) associated with the static link scheduling policies in a buffer-aided two-way relay network, where two sources exchange their updates through an intermediate relay equipped with data buffers. With regard to buffer-aided relaying, we consider the two-mode relaying scheme, where each time slot is dedicated to either broadcast or multiple access mode. Moreover, the link scheduling policy is considered to be static, which randomizes between broadcast and multiple access modes when the relay is backlogged and chooses the multiple access mode, otherwise. We establish AAoI corresponding to the sources in terms of steady-state probabilities of buffers at the relay for different instants of the network. Through numerical results, we show that the joint status of the queues at the relay has a significant effect on determining the optimal static link scheduling policy and further validate our analytical approach via simulations.
{"title":"Average Age of Information in Two-Way Relay Networks with Service Preemptions","authors":"Masoumeh Moradian, Aresh Dadlani","doi":"10.1109/GLOBECOM46510.2021.9685463","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685463","url":null,"abstract":"In this paper, we aim to derive the average age of information (AAoI) associated with the static link scheduling policies in a buffer-aided two-way relay network, where two sources exchange their updates through an intermediate relay equipped with data buffers. With regard to buffer-aided relaying, we consider the two-mode relaying scheme, where each time slot is dedicated to either broadcast or multiple access mode. Moreover, the link scheduling policy is considered to be static, which randomizes between broadcast and multiple access modes when the relay is backlogged and chooses the multiple access mode, otherwise. We establish AAoI corresponding to the sources in terms of steady-state probabilities of buffers at the relay for different instants of the network. Through numerical results, we show that the joint status of the queues at the relay has a significant effect on determining the optimal static link scheduling policy and further validate our analytical approach via simulations.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128600513","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 : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685882
Xiaowei Liang, Bin Shen, Taiping Cui, Longyang Huang
Due to the non-cooperative coexistence mechanism between the primary users (PUs) and secondary users (SUs), seeking secondary spectrum opportunities is usually unreliable by merely relying on traditional spectrum sensing technology. As one kind of auxiliary information, the mutual location information of the PUs and SUs can assist in determining whether the SU's access to the licensed frequency band (LFB) will interfere the PU. Aiming to identify the LFB status at different locations, we propose a low-complexity neighborhood-based weighted centroid localization (NB-WCL) algorithm to first solve the SU localization problem in the cognitive radio network (CRN). The proposed algorithm is therefore capable of setting the LFB-access flag for the SUs subsequently, based on their positioning results. The root mean square error (RMSE) of the proposed two-dimensional position estimation algorithm is analyzed. Theoretical analysis and experimental results suggest that the proposed algorithm outperforms some existing conventional localization algorithms with more robustness and better error performance. The proposed algorithm can serve as a practically effective candidate solution for LFB status identification in the CRN.
由于主用户(pu)和次用户(su)之间存在非合作共存机制，单纯依靠传统的频谱感知技术寻求次频谱机会往往是不可靠的。作为一种辅助信息，PU和SU之间的相互位置信息可以帮助判断SU对LFB (license frequency band)的接入是否会对PU造成干扰。为了识别不同位置的LFB状态，我们提出了一种低复杂度的基于邻域的加权质心定位(NB-WCL)算法，首次解决了认知无线网络(CRN)中的SU定位问题。因此，该算法能够根据su的定位结果，随后为su设置lfb访问标志。分析了二维位置估计算法的均方根误差(RMSE)。理论分析和实验结果表明，该算法比现有的传统定位算法具有更强的鲁棒性和更好的误差性能。该算法可作为CRN中LFB状态识别的一种实际有效的候选解决方案。
{"title":"Weighted Centroid Location Based Spectrum Status Identification in Cognitive Radio Network","authors":"Xiaowei Liang, Bin Shen, Taiping Cui, Longyang Huang","doi":"10.1109/GLOBECOM46510.2021.9685882","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685882","url":null,"abstract":"Due to the non-cooperative coexistence mechanism between the primary users (PUs) and secondary users (SUs), seeking secondary spectrum opportunities is usually unreliable by merely relying on traditional spectrum sensing technology. As one kind of auxiliary information, the mutual location information of the PUs and SUs can assist in determining whether the SU's access to the licensed frequency band (LFB) will interfere the PU. Aiming to identify the LFB status at different locations, we propose a low-complexity neighborhood-based weighted centroid localization (NB-WCL) algorithm to first solve the SU localization problem in the cognitive radio network (CRN). The proposed algorithm is therefore capable of setting the LFB-access flag for the SUs subsequently, based on their positioning results. The root mean square error (RMSE) of the proposed two-dimensional position estimation algorithm is analyzed. Theoretical analysis and experimental results suggest that the proposed algorithm outperforms some existing conventional localization algorithms with more robustness and better error performance. The proposed algorithm can serve as a practically effective candidate solution for LFB status identification in the CRN.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128632762","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 : 2021-12-01DOI: 10.1109/GLOBECOM46510.2021.9685538
S. Misra, P. K. Deb, Kartik Saini
In this paper, we present a method for dynamically selecting leaders in a master-slave communication model in a swarm of micro-Unmanned Aerial Vehicles (UAVs). With the growing size of the UAV swarm in complex missions, it becomes a challenge to control them for efficient execution of missions. In a traditional centralized communication model where all UAVs in the swarm are controlled directly through ground control, channel capacity limits the number of UAVs in the swarm which restricts the scalability. In the context of low-power miniature drones, we limit the communication of the ground Base Station (gBS) with only one UAV (leader) which controls the rest of the UAVs (followers). Towards this, we propose a greedy heuristic method for selecting the UAV leader that requires minimal time to communicate with the gBS in real-time. The proposed master-slave model enhances the scalability of the swarm by improving the utilization of channel resources. Simulation results demonstrate that the proposed dynamic leader selection enhances the lifetime of the entire network with a multifold decrease in energy consumption, compared to the state-of-the-art. Additionally, the lifetime of the network also decreases on operating with a single UAV leader. We also observe reductions in delays by almost 60% and an increase in data rate by 50%.
{"title":"Dynamic Leader Selection in a Master-Slave Architecture-Based Micro UAV Swarm","authors":"S. Misra, P. K. Deb, Kartik Saini","doi":"10.1109/GLOBECOM46510.2021.9685538","DOIUrl":"https://doi.org/10.1109/GLOBECOM46510.2021.9685538","url":null,"abstract":"In this paper, we present a method for dynamically selecting leaders in a master-slave communication model in a swarm of micro-Unmanned Aerial Vehicles (UAVs). With the growing size of the UAV swarm in complex missions, it becomes a challenge to control them for efficient execution of missions. In a traditional centralized communication model where all UAVs in the swarm are controlled directly through ground control, channel capacity limits the number of UAVs in the swarm which restricts the scalability. In the context of low-power miniature drones, we limit the communication of the ground Base Station (gBS) with only one UAV (leader) which controls the rest of the UAVs (followers). Towards this, we propose a greedy heuristic method for selecting the UAV leader that requires minimal time to communicate with the gBS in real-time. The proposed master-slave model enhances the scalability of the swarm by improving the utilization of channel resources. Simulation results demonstrate that the proposed dynamic leader selection enhances the lifetime of the entire network with a multifold decrease in energy consumption, compared to the state-of-the-art. Additionally, the lifetime of the network also decreases on operating with a single UAV leader. We also observe reductions in delays by almost 60% and an increase in data rate by 50%.","PeriodicalId":200641,"journal":{"name":"2021 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129315619","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
扫码关注我们
求助内容：
应助结果提醒方式：