Pub Date : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9652995
B. Kraczek, Nicholas Woolsey
Barrage relay networks (BRNs) are a type of ad hoc wireless network with current and proposed uses in military, disaster response, industrial and vehicle-to-vehicle applications. BRNs are designed specifically to operate robustly without any information about the relative positions of other nodes on the network. The nodes in a specific connection within a BRN are determined by the formation of a controlled barrage region (CBR). There is a trade-off between reliability and node utilization or the number of nodes that are reserved for a single unicast link. In a previous paper, we investigated the suitability of BRNs for higher-density networks, which are anticipated with the explosion of network-connected devices. We showed that node utilization increases superlinearly with both node density and the distance between source and destination, calling into question the suitability of BRNs for use in high-density networks. In this paper we use a connected graph model to show that CBR formation algorithm generates a specific geometry in the limit of infinite node density. Applying this geometry to a more physically realistic random channel model (RCM) with finite node density, we propose tuning the model by scaling the transmission power of receivers. The transmit power is based on received signal strength during the sending of request to send (RTS) and clear to send (CTS) packets, used to determine the nodes used in the CBR. We show that in discrete event simulations this signal strength scaling can reduce the utilization while simultaneously improving the probability of CBR formation.
{"title":"Geometry-Informed Transmission Strength Scaling in Barrage Relay Networks","authors":"B. Kraczek, Nicholas Woolsey","doi":"10.1109/MILCOM52596.2021.9652995","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652995","url":null,"abstract":"Barrage relay networks (BRNs) are a type of ad hoc wireless network with current and proposed uses in military, disaster response, industrial and vehicle-to-vehicle applications. BRNs are designed specifically to operate robustly without any information about the relative positions of other nodes on the network. The nodes in a specific connection within a BRN are determined by the formation of a controlled barrage region (CBR). There is a trade-off between reliability and node utilization or the number of nodes that are reserved for a single unicast link. In a previous paper, we investigated the suitability of BRNs for higher-density networks, which are anticipated with the explosion of network-connected devices. We showed that node utilization increases superlinearly with both node density and the distance between source and destination, calling into question the suitability of BRNs for use in high-density networks. In this paper we use a connected graph model to show that CBR formation algorithm generates a specific geometry in the limit of infinite node density. Applying this geometry to a more physically realistic random channel model (RCM) with finite node density, we propose tuning the model by scaling the transmission power of receivers. The transmit power is based on received signal strength during the sending of request to send (RTS) and clear to send (CTS) packets, used to determine the nodes used in the CBR. We show that in discrete event simulations this signal strength scaling can reduce the utilization while simultaneously improving the probability of CBR formation.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127205334","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-11-29DOI: 10.1109/MILCOM52596.2021.9652917
I. Ahmed, H. Sadjadpour, S. Yousefi
We consider a class of resource allocation problems given a set of unconditional constraints whose objective function satisfies Bellman's optimality principle. Such problems are ubiquitous in wireless communication, signal processing, and networking. These constrained combinatorial optimization problems are, in general, NP-Hard. This paper proposes two algorithms to solve this class of problems using a dynamic programming framework assisted by an information-theoretic measure. We demonstrate that the proposed algorithms ensure optimal solutions under carefully chosen conditions and use significantly reduced computational resources. We substantiate our claims by solving the power-constrained bit allocation problem in 5G massive Multiple-Input Multiple-Output receivers using the proposed approach.
{"title":"Constrained Resource Allocation Problems in Communications: An Information-assisted Approach","authors":"I. Ahmed, H. Sadjadpour, S. Yousefi","doi":"10.1109/MILCOM52596.2021.9652917","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652917","url":null,"abstract":"We consider a class of resource allocation problems given a set of unconditional constraints whose objective function satisfies Bellman's optimality principle. Such problems are ubiquitous in wireless communication, signal processing, and networking. These constrained combinatorial optimization problems are, in general, NP-Hard. This paper proposes two algorithms to solve this class of problems using a dynamic programming framework assisted by an information-theoretic measure. We demonstrate that the proposed algorithms ensure optimal solutions under carefully chosen conditions and use significantly reduced computational resources. We substantiate our claims by solving the power-constrained bit allocation problem in 5G massive Multiple-Input Multiple-Output receivers using the proposed approach.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127351246","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-11-29DOI: 10.1109/MILCOM52596.2021.9653063
Xinyuan Wang
As more organizations are moving their IT infrastructures from on-premises to the cloud, cloud security breaches have just surpassed on-premises breaches. There is a pressing need to develop practical and deployable cyber defense capabilities to protect the enormous amount of potentially vulnerable binary applications in the cloud from previously unseen cyberattacks. In this paper, we present CloudImmu, a practical cloud cyber defense system that is built upon a novel combination of binary rewriting and instrumentation techniques, virtual machine introspection and hypervisor level anomaly detection techniques. Our immunization tool has successfully “immunized” large real world binary applications such as bash, Snort, and our experiments with real world exploits have shown that CloudImmu can detect and block cyberattacks on properly immunized, otherwise vulnerable binary applications in virtual machines in real-time without using any prior knowledge of the attacks. Our benchmark experiments show that CloudImmu incurs less than 1.06% overall run-time performance overhead on typical applications with typical workloads.
{"title":"CloudImmu: Transparent Protection of Binary Applications in the Cloud","authors":"Xinyuan Wang","doi":"10.1109/MILCOM52596.2021.9653063","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653063","url":null,"abstract":"As more organizations are moving their IT infrastructures from on-premises to the cloud, cloud security breaches have just surpassed on-premises breaches. There is a pressing need to develop practical and deployable cyber defense capabilities to protect the enormous amount of potentially vulnerable binary applications in the cloud from previously unseen cyberattacks. In this paper, we present CloudImmu, a practical cloud cyber defense system that is built upon a novel combination of binary rewriting and instrumentation techniques, virtual machine introspection and hypervisor level anomaly detection techniques. Our immunization tool has successfully “immunized” large real world binary applications such as bash, Snort, and our experiments with real world exploits have shown that CloudImmu can detect and block cyberattacks on properly immunized, otherwise vulnerable binary applications in virtual machines in real-time without using any prior knowledge of the attacks. Our benchmark experiments show that CloudImmu incurs less than 1.06% overall run-time performance overhead on typical applications with typical workloads.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125561597","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-11-29DOI: 10.1109/MILCOM52596.2021.9653115
F. J. Block
The use of standard binary turbo codes has previously been shown to work well with noncoherent $M$-ary orthogonal modulation, particularly when used with iterative demodulation and decoding at the receiver. For channels with very low signal-to-noise ratios, the code rate may need to be reduced below those provided by typical turbo codes. Rather than designing additional lower rate turbo codes for these cases, repetition can be used. One possibility to incorporate repetition is to repeat individual $M$-ary orthogonal channel symbols, which can be noncoherently combined at the receiver. An alternative approach is to repeat and interleave code bits prior to mapping them to channel symbols. In this paper, this bit repetition approach, combined with a receiver utilizing an iterative demodulation and decoding technique in which the demodulator itself is also iterative, is shown to outperform symbol repetition.
{"title":"Low-Rate FEC for $M$-ary Orthogonal Modulation","authors":"F. J. Block","doi":"10.1109/MILCOM52596.2021.9653115","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653115","url":null,"abstract":"The use of standard binary turbo codes has previously been shown to work well with noncoherent $M$-ary orthogonal modulation, particularly when used with iterative demodulation and decoding at the receiver. For channels with very low signal-to-noise ratios, the code rate may need to be reduced below those provided by typical turbo codes. Rather than designing additional lower rate turbo codes for these cases, repetition can be used. One possibility to incorporate repetition is to repeat individual $M$-ary orthogonal channel symbols, which can be noncoherently combined at the receiver. An alternative approach is to repeat and interleave code bits prior to mapping them to channel symbols. In this paper, this bit repetition approach, combined with a receiver utilizing an iterative demodulation and decoding technique in which the demodulator itself is also iterative, is shown to outperform symbol repetition.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116528169","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-11-29DOI: 10.1109/MILCOM52596.2021.9652954
Yuchen Zhang, Sa Xiao, Jianquan Wang, Xiaojun Yuan, Wanbin Tang
In this paper, we investigate covert communications under multiple-antenna eavesdropping, and explore the impact of the channel state information (CSI) at the adversary on the covertness of the system with noise uncertainty. We first analyze the detection performance of the adversary without the CSI of the eavesdropping channel. Specially, the generalized likelihood ratio (GLR) detection is adopted to handle this scenario. Then, a more practical scenario with the uncertain noise power at the adversary is considered, and the covertness of the system is analyzed. In addition, the optimal transmit power at the legitimate transmitter is derived theoretically to maximize the covert throughput. Finally, we present numerical results to compare the covert throughputs when the adversary knows or doesn't know the CSI. The results demonstrate the significance of unknown CSI at the adversary when considering the covert throughput of the system.
{"title":"Covert Communications under Multiple-Antenna Eavesdropping without Channel State Information","authors":"Yuchen Zhang, Sa Xiao, Jianquan Wang, Xiaojun Yuan, Wanbin Tang","doi":"10.1109/MILCOM52596.2021.9652954","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652954","url":null,"abstract":"In this paper, we investigate covert communications under multiple-antenna eavesdropping, and explore the impact of the channel state information (CSI) at the adversary on the covertness of the system with noise uncertainty. We first analyze the detection performance of the adversary without the CSI of the eavesdropping channel. Specially, the generalized likelihood ratio (GLR) detection is adopted to handle this scenario. Then, a more practical scenario with the uncertain noise power at the adversary is considered, and the covertness of the system is analyzed. In addition, the optimal transmit power at the legitimate transmitter is derived theoretically to maximize the covert throughput. Finally, we present numerical results to compare the covert throughputs when the adversary knows or doesn't know the CSI. The results demonstrate the significance of unknown CSI at the adversary when considering the covert throughput of the system.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122704781","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-11-29DOI: 10.1109/MILCOM52596.2021.9653032
Lorenzo Rosa, Weijia Song, L. Foschini, Antonio Corradi, K. Birman
Mission-critical applications frequently rely on communication middleware products, enabling ease of deployment, component integration, and proven dependability. However, existing communication middleware options present limitations such as weak consistency guarantees, reflecting concerns about overheads for strong forms of assurance. The hardware landscape is now evolving: hardware-based kernel bypass technologies like Remote Direct Memory Access (RDMA) offer faster communication with near-perfect reliability. This paper introduces DerechoDDS, an implementation of the OMG Data Distribution Service (DDS) layered over Derecho, an open-source library embodying a new approach to atomic multicast that maps efficiently to RDMA (or TCP emulations of RDMA). We first describe how DerechoDDS maps the standard DDS API on the Derecho library to achieve a zero-copy data path among remote entities. Then, we propose a novel QoS policy to control the level of consistency for data distribution. We demonstrate that DerechoDDS offers comparable or substantially higher performance than today's major DDS implementations, while simultaneously strengthening guarantees. Even when configured for strong consistency, DerechoDDS achieves high performance.
{"title":"DerechoDDS: Strongly Consistent Data Distribution for Mission-Critical Applications","authors":"Lorenzo Rosa, Weijia Song, L. Foschini, Antonio Corradi, K. Birman","doi":"10.1109/MILCOM52596.2021.9653032","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653032","url":null,"abstract":"Mission-critical applications frequently rely on communication middleware products, enabling ease of deployment, component integration, and proven dependability. However, existing communication middleware options present limitations such as weak consistency guarantees, reflecting concerns about overheads for strong forms of assurance. The hardware landscape is now evolving: hardware-based kernel bypass technologies like Remote Direct Memory Access (RDMA) offer faster communication with near-perfect reliability. This paper introduces DerechoDDS, an implementation of the OMG Data Distribution Service (DDS) layered over Derecho, an open-source library embodying a new approach to atomic multicast that maps efficiently to RDMA (or TCP emulations of RDMA). We first describe how DerechoDDS maps the standard DDS API on the Derecho library to achieve a zero-copy data path among remote entities. Then, we propose a novel QoS policy to control the level of consistency for data distribution. We demonstrate that DerechoDDS offers comparable or substantially higher performance than today's major DDS implementations, while simultaneously strengthening guarantees. Even when configured for strong consistency, DerechoDDS achieves high performance.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114587380","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-11-29DOI: 10.1109/MILCOM52596.2021.9653059
Arwid Komulainen, Jimmi Grönkvist, U. Sterner
Effective command and control on the battlefield requires robust communications. Using multi-hop communications based on synchronized cooperative broadcast (SCB) has previously been proposed as a means to increase range, robustness and efficiency for tactical ad hoc networks. In this paper, multi-channel extensions of SCB are proposed for increasing the network throughput of a narrowband frequency hopping waveform. The proposed algorithms make use of side bands of the primary channel and the effects of out-of-band interference on the proposed algorithms are analyzed. The evaluation shows how the use of neighboring channels can improve the efficiency of a narrowband data waveform. It is shown that the algorithms using two channels can work despite severe levels of out-of-band interference. Algorithms using three channels, which has twice the throughput of the most robust single channel configuration, is more sensitive to out-of-band interference and requires larger frequency separation between the channels.
{"title":"Multi-Channel Cooperative Broadcast for Narrowband Tactical Networks","authors":"Arwid Komulainen, Jimmi Grönkvist, U. Sterner","doi":"10.1109/MILCOM52596.2021.9653059","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653059","url":null,"abstract":"Effective command and control on the battlefield requires robust communications. Using multi-hop communications based on synchronized cooperative broadcast (SCB) has previously been proposed as a means to increase range, robustness and efficiency for tactical ad hoc networks. In this paper, multi-channel extensions of SCB are proposed for increasing the network throughput of a narrowband frequency hopping waveform. The proposed algorithms make use of side bands of the primary channel and the effects of out-of-band interference on the proposed algorithms are analyzed. The evaluation shows how the use of neighboring channels can improve the efficiency of a narrowband data waveform. It is shown that the algorithms using two channels can work despite severe levels of out-of-band interference. Algorithms using three channels, which has twice the throughput of the most robust single channel configuration, is more sensitive to out-of-band interference and requires larger frequency separation between the channels.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129950140","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-11-29DOI: 10.1109/MILCOM52596.2021.9653053
Ioannis Chatzigeorgiou
Data gathering operations in remote locations often rely on relay drones, which collect, store and deliver transmitted information to a ground control station. The probability of the ground control station successfully reconstructing the gathered data can be increased if random linear coding (RLC) is used, especially when feedback channels between the drones and the transmitter are not available. RLC decoding can be complemented by partial packet recovery (PPR), which utilizes sparse recovery principles to repair erroneously received data before RLC decoding takes place. We explain that the spark of the transpose of the parity-check matrix of the linear code, that is, the smallest number of linearly-dependent columns of the matrix, influences the effectiveness of PPR. We formulate a spark optimization problem and obtain code designs that achieve a gain over PPR-assisted RLC, in terms of the probability that the ground control station will decode the delivered data.
{"title":"Spark Optimization of Linear Codes for Reliable Data Delivery by Relay Drones","authors":"Ioannis Chatzigeorgiou","doi":"10.1109/MILCOM52596.2021.9653053","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653053","url":null,"abstract":"Data gathering operations in remote locations often rely on relay drones, which collect, store and deliver transmitted information to a ground control station. The probability of the ground control station successfully reconstructing the gathered data can be increased if random linear coding (RLC) is used, especially when feedback channels between the drones and the transmitter are not available. RLC decoding can be complemented by partial packet recovery (PPR), which utilizes sparse recovery principles to repair erroneously received data before RLC decoding takes place. We explain that the spark of the transpose of the parity-check matrix of the linear code, that is, the smallest number of linearly-dependent columns of the matrix, influences the effectiveness of PPR. We formulate a spark optimization problem and obtain code designs that achieve a gain over PPR-assisted RLC, in terms of the probability that the ground control station will decode the delivered data.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128699317","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-11-29DOI: 10.1109/MILCOM52596.2021.9653014
Guiqi Sun, Chen Huang, Zihang Cheng, R. He, B. Ai, A. Molisch
Extensive channel measurements have shown that multipath components (MPCs) generally exist as clusters, and cluster-based channel models are therefore widely used for system design and assessment. Since the dynamic behavior, i.e., the time evolution, of the channels plays an important role for many applications, an accurate algorithm for the clustering of time-varying MPCs is required; a variety of algorithms have been proposed, yet little attention has been given to a fair comparison of their relative advantages and drawbacks. In this paper, we review and investigate the typical clustering methods for MPCs in wireless channels. Three popular classes of algorithms, namely distance-based (K-Power-Means), density-based (K-power-density), and evolution-based clustering methods, are analyzed and compared based on both synthetic and measured channel data. The F-measure is used to quantify and evaluate the clustering performance of the three algorithms, and also investigate their performance when only static snapshots of the channel are available. From the comparison, the evolution-based clustering method shows great potential to address the dynamic clustering problem for wireless time-varying channels.
{"title":"A Study of Clustering Algorithms for Time-Varying Multipath Components in Wireless Channels","authors":"Guiqi Sun, Chen Huang, Zihang Cheng, R. He, B. Ai, A. Molisch","doi":"10.1109/MILCOM52596.2021.9653014","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653014","url":null,"abstract":"Extensive channel measurements have shown that multipath components (MPCs) generally exist as clusters, and cluster-based channel models are therefore widely used for system design and assessment. Since the dynamic behavior, i.e., the time evolution, of the channels plays an important role for many applications, an accurate algorithm for the clustering of time-varying MPCs is required; a variety of algorithms have been proposed, yet little attention has been given to a fair comparison of their relative advantages and drawbacks. In this paper, we review and investigate the typical clustering methods for MPCs in wireless channels. Three popular classes of algorithms, namely distance-based (K-Power-Means), density-based (K-power-density), and evolution-based clustering methods, are analyzed and compared based on both synthetic and measured channel data. The F-measure is used to quantify and evaluate the clustering performance of the three algorithms, and also investigate their performance when only static snapshots of the channel are available. From the comparison, the evolution-based clustering method shows great potential to address the dynamic clustering problem for wireless time-varying channels.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124581904","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-11-29DOI: 10.1109/MILCOM52596.2021.9652968
G. Elmasry, P. Corwin
Many security enhancements need to be considered in order to leverage 5G technologies for tactical networks. One important security area is the RF signal signature itself. Tactical communication waveforms rely on Transmission Security (TRANSEC) techniques in order to combat the impact of the enemy's eavesdropping and jamming capabilities. Adapting 5G for tactical communications may consider TRANSEC enhancements to include frequency hopping, orthogonality hopping, beamforming and other techniques to make the 5G RF signal have Low Probability of Detection (LPD) and Low Probability of Intercept (LPI) characteristics. This paper focuses on an approach for making it more difficult for an adversary to locate a 5G transmitting node: utilizing the 5G Multiple-Input-Multiple-output (MIMO) antenna to effectively randomize the RF signal footprint where only the Transmit/Receive (Tx/Rx) node pairs can synchronize to this randomization, thus making it harder for the enemy to make sense of the 5G RF signal.
{"title":"Hiding the RF Signal Signature in Tactical 5G","authors":"G. Elmasry, P. Corwin","doi":"10.1109/MILCOM52596.2021.9652968","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652968","url":null,"abstract":"Many security enhancements need to be considered in order to leverage 5G technologies for tactical networks. One important security area is the RF signal signature itself. Tactical communication waveforms rely on Transmission Security (TRANSEC) techniques in order to combat the impact of the enemy's eavesdropping and jamming capabilities. Adapting 5G for tactical communications may consider TRANSEC enhancements to include frequency hopping, orthogonality hopping, beamforming and other techniques to make the 5G RF signal have Low Probability of Detection (LPD) and Low Probability of Intercept (LPI) characteristics. This paper focuses on an approach for making it more difficult for an adversary to locate a 5G transmitting node: utilizing the 5G Multiple-Input-Multiple-output (MIMO) antenna to effectively randomize the RF signal footprint where only the Transmit/Receive (Tx/Rx) node pairs can synchronize to this randomization, thus making it harder for the enemy to make sense of the 5G RF signal.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129696830","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
扫码关注我们
求助内容：
应助结果提醒方式：