MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)最新文献

Geometry-Informed Transmission Strength Scaling in Barrage Relay Networks 基于几何信息的弹幕中继网络传输强度缩放

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9652995

B. Kraczek, Nicholas Woolsey

{"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}

引用次数: 1

Constrained Resource Allocation Problems in Communications: An Information-assisted Approach 通信中的受限资源分配问题:一种信息辅助方法

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9652917

I. Ahmed, H. Sadjadpour, S. Yousefi

引用次数: 1

CloudImmu: Transparent Protection of Binary Applications in the Cloud CloudImmu:云中的二进制应用程序的透明保护

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9653063

Xinyuan Wang

引用次数: 0

Low-Rate FEC for $M$-ary Orthogonal Modulation 任意正交调制的低速率FEC

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9653115

F. J. Block

引用次数: 0

Covert Communications under Multiple-Antenna Eavesdropping without Channel State Information 无信道状态信息的多天线窃听下的秘密通信

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9652954

Yuchen Zhang, Sa Xiao, Jianquan Wang, Xiaojun Yuan, Wanbin Tang

引用次数: 0

DerechoDDS: Strongly Consistent Data Distribution for Mission-Critical Applications DerechoDDS:关键任务应用的强一致性数据分布

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9653032

Lorenzo Rosa, Weijia Song, L. Foschini, Antonio Corradi, K. Birman

{"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}

引用次数: 1

Multi-Channel Cooperative Broadcast for Narrowband Tactical Networks 窄带战术网多信道协同广播

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9653059

Arwid Komulainen, Jimmi Grönkvist, U. Sterner

引用次数: 2

Spark Optimization of Linear Codes for Reliable Data Delivery by Relay Drones 中继无人机可靠数据传输线性代码的火花优化

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9653053

Ioannis Chatzigeorgiou

引用次数: 0

A Study of Clustering Algorithms for Time-Varying Multipath Components in Wireless Channels 无线信道时变多径分量聚类算法研究

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9653014

Guiqi Sun, Chen Huang, Zihang Cheng, R. He, B. Ai, A. Molisch

{"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}

引用次数: 1

Hiding the RF Signal Signature in Tactical 5G 隐藏战术5G射频信号特征

MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM) Pub Date : 2021-11-29 DOI: 10.1109/MILCOM52596.2021.9652968

G. Elmasry, P. Corwin

引用次数: 5