Pub Date : 2021-11-29DOI: 10.1109/MILCOM52596.2021.9652885
Philipp Moll, Varun Patil, Lixia Zhang, Davide Pesavento
Publish-subscribe (pub/sub) is a popular API used by today's distributed multiparty applications. TCP/IP, however, does not directly support multiparty communication, therefore realizing pub/sub requires complex logic at the application layer. In this paper, we introduce SVS-PS, a brokerless pub/sub protocol running over NDN. SVS-PS utilizes NDN for data-centric security and many-to-many communication. Compared to IP-based implementations, SVS-PS enables publishers and subscribers to rendezvous “in the air”, thereby reduces the complexity of the application layer and lowers network traffic load. Our open-source implementation of SVS-PS makes NDN's networking primitives transparent to applications, allowing developers to work with a familiar pub/sub API while benefiting from NDN's secure and resilient multiparty communication support.
{"title":"Resilient Brokerless Publish-Subscribe over NDN","authors":"Philipp Moll, Varun Patil, Lixia Zhang, Davide Pesavento","doi":"10.1109/MILCOM52596.2021.9652885","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652885","url":null,"abstract":"Publish-subscribe (pub/sub) is a popular API used by today's distributed multiparty applications. TCP/IP, however, does not directly support multiparty communication, therefore realizing pub/sub requires complex logic at the application layer. In this paper, we introduce SVS-PS, a brokerless pub/sub protocol running over NDN. SVS-PS utilizes NDN for data-centric security and many-to-many communication. Compared to IP-based implementations, SVS-PS enables publishers and subscribers to rendezvous “in the air”, thereby reduces the complexity of the application layer and lowers network traffic load. Our open-source implementation of SVS-PS makes NDN's networking primitives transparent to applications, allowing developers to work with a familiar pub/sub API while benefiting from NDN's secure and resilient multiparty communication support.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"1 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":"130492338","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.9653138
Chanho Park, Jinhyun Ahn, Joonhyuk Kang
Federated learning (FL) is an actively studied training protocol for distributed artificial intelligence (AI). One of the challenges for the implementation is a communication bottleneck in the uplink communication from devices to FL server. To address the issue, many researches have been studied on the improvement of communication efficiency. In particular, analog transmission for the wireless implementation provides a new opportunity allowing whole bandwidth to be fully reused at each device. However, it is still necessary to compress the parameters to the allocated communication bandwidth despite the communsication efficiency in analog FL. In this paper, we introduce the count-sketch (CS) algorithm as a compression scheme in analog FL to overcome the limited channel resources. We develop a more communication-efficient FL system by applying CS algorithm to the wireless implementation of FL. Numerical experiments show that the proposed scheme outperforms other bench mark schemes, CA-DSGD and state-of-the-art digital schemes. Furthermore, we have observed that the proposed scheme is considerably robust against transmission power and channel resources.
{"title":"Gradient Compression via Count-Sketch for Analog Federated Learning","authors":"Chanho Park, Jinhyun Ahn, Joonhyuk Kang","doi":"10.1109/MILCOM52596.2021.9653138","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653138","url":null,"abstract":"Federated learning (FL) is an actively studied training protocol for distributed artificial intelligence (AI). One of the challenges for the implementation is a communication bottleneck in the uplink communication from devices to FL server. To address the issue, many researches have been studied on the improvement of communication efficiency. In particular, analog transmission for the wireless implementation provides a new opportunity allowing whole bandwidth to be fully reused at each device. However, it is still necessary to compress the parameters to the allocated communication bandwidth despite the communsication efficiency in analog FL. In this paper, we introduce the count-sketch (CS) algorithm as a compression scheme in analog FL to overcome the limited channel resources. We develop a more communication-efficient FL system by applying CS algorithm to the wireless implementation of FL. Numerical experiments show that the proposed scheme outperforms other bench mark schemes, CA-DSGD and state-of-the-art digital schemes. Furthermore, we have observed that the proposed scheme is considerably robust against transmission power and channel resources.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"7 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":"129716251","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.9653110
Nathaniel A. Henry, J. Doherty, D. Jenkins
This report discusses the placement of null regions on the wideband auto-ambiguity function (WBAAF). To date, the majority of papers on this subject apply the null regions to the narrow band, side lobe cancellation of the auto-ambiguity function for a radar echo pulse. By selectively placing a null region in an original waveform's WBAAF, a transmit sequence, especially a white noise radar pulse, can be tailored to lower the energy of peak regions on the WBAAF surface that might be masking desirable portions. The approach discussed in this paper is a unique iterative algorithm which we have termed the Wideband Nulling Algorithm. The Wideband Nulling Algorithm operates on time-scaled data and thus inherently utilizes a wideband approach to placing a null in the ambiguity function surface. Since the algorithm operates on the time domain series, it maps an original waveform to a new time domain waveform such that its second order statistics have a WBAAF surface containing the desired null regions. The goal is to perform this mapping operation with minimal disturbance or impact to the original signal so that the signal content or message is not disturbed. This Wideband Nulling Algorithm is an elegantly simple, mathematical process to reduce interference clutter peaks from a radar, sonar, or an ultrasound ambiguity function surface. This fundamental process has potential applications to many fields including biomedical imaging.
{"title":"Wideband Auto-Ambiguity Function Nulling Algorithm","authors":"Nathaniel A. Henry, J. Doherty, D. Jenkins","doi":"10.1109/MILCOM52596.2021.9653110","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653110","url":null,"abstract":"This report discusses the placement of null regions on the wideband auto-ambiguity function (WBAAF). To date, the majority of papers on this subject apply the null regions to the narrow band, side lobe cancellation of the auto-ambiguity function for a radar echo pulse. By selectively placing a null region in an original waveform's WBAAF, a transmit sequence, especially a white noise radar pulse, can be tailored to lower the energy of peak regions on the WBAAF surface that might be masking desirable portions. The approach discussed in this paper is a unique iterative algorithm which we have termed the Wideband Nulling Algorithm. The Wideband Nulling Algorithm operates on time-scaled data and thus inherently utilizes a wideband approach to placing a null in the ambiguity function surface. Since the algorithm operates on the time domain series, it maps an original waveform to a new time domain waveform such that its second order statistics have a WBAAF surface containing the desired null regions. The goal is to perform this mapping operation with minimal disturbance or impact to the original signal so that the signal content or message is not disturbed. This Wideband Nulling Algorithm is an elegantly simple, mathematical process to reduce interference clutter peaks from a radar, sonar, or an ultrasound ambiguity function surface. This fundamental process has potential applications to many fields including biomedical imaging.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"1 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":"129717248","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.9652978
J. Vanderpoorten, J. Lyke, David Brunnenmeyer, Kevin Zhang, D. Fronterhouse, J. Kidder, Jeffrey Laing
Our warfighters rely on flexible, resilient, high performance, and global DoD SATCOM networks to operate effectively in a contested, degraded and operationally-limited (CDO) environment. Today, a multitude of DoD networks exist as stovepipes with disparate networking architectures, cybersecurity requirements, management and control tools. We believe that Internet Protocol convergence becomes insufficient to achieve interoperability in the military mission networking context. As the future battlespace involves multiple domain capabilities and assets that must be assembled within mission relevant timelines, operate in unison, and be adaptive to battlespace, a new model is needed to deliver high performance multi-mission and multi-domain data transport. The Flexible Network Interface (FNI) is a robust integration framework that deploys enabling technologies to operationalize heterogeneous networks (DoD and commercial). It delivers consistent end user experience, architecture resiliency, and optimized performance; leveraging heterogeneous host networks and commercial managed services across space, air, ground, and sea. This paper provides an overview of the USSF SSC FNI concept, which is being matured through a series of capability prototyping and demonstration initiatives. We describe the FNI framework's design considerations, and its associated architecture instantiations, key functional elements and interfaces. Several important technology requirements are highlighted, which motivate targeted research and development. Finally, the paper summarizes future work to address open issues across technology, standards, implementations, and deployment.
{"title":"Flexible Network Interface (FNI): A Mission-centric Integration Framework for Next Generation DoD SATCOM Networks","authors":"J. Vanderpoorten, J. Lyke, David Brunnenmeyer, Kevin Zhang, D. Fronterhouse, J. Kidder, Jeffrey Laing","doi":"10.1109/MILCOM52596.2021.9652978","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652978","url":null,"abstract":"Our warfighters rely on flexible, resilient, high performance, and global DoD SATCOM networks to operate effectively in a contested, degraded and operationally-limited (CDO) environment. Today, a multitude of DoD networks exist as stovepipes with disparate networking architectures, cybersecurity requirements, management and control tools. We believe that Internet Protocol convergence becomes insufficient to achieve interoperability in the military mission networking context. As the future battlespace involves multiple domain capabilities and assets that must be assembled within mission relevant timelines, operate in unison, and be adaptive to battlespace, a new model is needed to deliver high performance multi-mission and multi-domain data transport. The Flexible Network Interface (FNI) is a robust integration framework that deploys enabling technologies to operationalize heterogeneous networks (DoD and commercial). It delivers consistent end user experience, architecture resiliency, and optimized performance; leveraging heterogeneous host networks and commercial managed services across space, air, ground, and sea. This paper provides an overview of the USSF SSC FNI concept, which is being matured through a series of capability prototyping and demonstration initiatives. We describe the FNI framework's design considerations, and its associated architecture instantiations, key functional elements and interfaces. Several important technology requirements are highlighted, which motivate targeted research and development. Finally, the paper summarizes future work to address open issues across technology, standards, implementations, and deployment.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"59 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":"127881452","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.9653088
Kathleen Yang, J. Gluck, Daniel A. Perkins, R. Ridgway, M. Médard
Code division multiple access has been used in military communications due to its low probability of detection and interception. However, with the shift towards the wideband regime due to the crowded frequency spectrum, the high cost of obtaining channel state information in this regime impedes the usage of code division multiple access. Impulsive frequency shift keying is a modulation scheme that performs well in the wideband regime without channel state information, and has potential for low probability of intercept systems due to it being based on frequency shift keying. In this work, we demonstrate the concept of impulsive frequency shift keying with over the air testing. We consider the performance of impulsive frequency shift keying in Rayleigh fading channels with both log-normal path loss and shadowing to facilitate the development of a link budget for the transmitter and receiver design. Its performance is investigated in the real world by implementing the transmitter and receiver using software-defined radios and performing over the air tests in a suburban environment by fixing the transmitter and attaching the receiver to a moving vehicle. We achieve a data rate of 0.9 kb/s, which is sufficient for text communications, and show that the symbol error rate for discretized signal-to-noise ratio bins follows a similar trend to the probability of a symbol error in the simulations.
{"title":"Over-the-Air Testing of Impulsive Frequency Shift Keying Modulation","authors":"Kathleen Yang, J. Gluck, Daniel A. Perkins, R. Ridgway, M. Médard","doi":"10.1109/MILCOM52596.2021.9653088","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653088","url":null,"abstract":"Code division multiple access has been used in military communications due to its low probability of detection and interception. However, with the shift towards the wideband regime due to the crowded frequency spectrum, the high cost of obtaining channel state information in this regime impedes the usage of code division multiple access. Impulsive frequency shift keying is a modulation scheme that performs well in the wideband regime without channel state information, and has potential for low probability of intercept systems due to it being based on frequency shift keying. In this work, we demonstrate the concept of impulsive frequency shift keying with over the air testing. We consider the performance of impulsive frequency shift keying in Rayleigh fading channels with both log-normal path loss and shadowing to facilitate the development of a link budget for the transmitter and receiver design. Its performance is investigated in the real world by implementing the transmitter and receiver using software-defined radios and performing over the air tests in a suburban environment by fixing the transmitter and attaching the receiver to a moving vehicle. We achieve a data rate of 0.9 kb/s, which is sufficient for text communications, and show that the symbol error rate for discretized signal-to-noise ratio bins follows a similar trend to the probability of a symbol error in the simulations.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"11 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":"115263454","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.9653092
Timothy Woods, Sean Furman, C. Maracchion, A. Drozd, F. Frantz, J. Ashdown
The proliferation of spectrum-dependent systems and the reduction in Federally-owned spectrum has challenged Radio Access Networks (RANs) to keep pace with requirements for increased data demands. Particularly, Department of Defense (DoD) bandwidth-intensive applications, such as the Internet of Military Things (IoMT), Command and Control (C2), and decentralized or distributed networks all share the need for ubiquitous wireless connectivity with limited spectrum resources. The paper presents a novel concept of Hierarchical Dynamic Spectrum Sharing (H-DSS) architecture standardization that leverages novel mission policy-based Dynamic Spectrum Access (DSA) and agnostic implementation within the DoD spectrum management tools lifecycle to meet bandwidth challenges. H-DSS and mission policy-based DSA are enablers for RANs to cooperate, coordinate, and dynamically share resources in decentralized or distributed Federal and non-Federal spectrum applications.
{"title":"All-domain Spectrum Command and Control via Hierarchical Dynamic Spectrum Sharing with Implemented Dynamic Spectrum Access Toolchain","authors":"Timothy Woods, Sean Furman, C. Maracchion, A. Drozd, F. Frantz, J. Ashdown","doi":"10.1109/MILCOM52596.2021.9653092","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653092","url":null,"abstract":"The proliferation of spectrum-dependent systems and the reduction in Federally-owned spectrum has challenged Radio Access Networks (RANs) to keep pace with requirements for increased data demands. Particularly, Department of Defense (DoD) bandwidth-intensive applications, such as the Internet of Military Things (IoMT), Command and Control (C2), and decentralized or distributed networks all share the need for ubiquitous wireless connectivity with limited spectrum resources. The paper presents a novel concept of Hierarchical Dynamic Spectrum Sharing (H-DSS) architecture standardization that leverages novel mission policy-based Dynamic Spectrum Access (DSA) and agnostic implementation within the DoD spectrum management tools lifecycle to meet bandwidth challenges. H-DSS and mission policy-based DSA are enablers for RANs to cooperate, coordinate, and dynamically share resources in decentralized or distributed Federal and non-Federal spectrum applications.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"6 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":"115731006","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.9653124
D. A. Chu, J. Barry
Time-varying Doppler shifts can arise in low-earth orbit satellites and other high-dynamic environments, and are a significant impediment to the acquisition of spread-spectrum signals. In this paper we propose delay-Doppler efficient exhaustive search (DEES), an efficient algorithm that can acquire direct-sequence spread-spectrum signals with long spreading codes in the presence of both Doppler rate and Doppler frequency shifts. DEES combines the second-order keystone transform and the fractional Fourier transform to mitigate the effects of time-varying channel delays, before jointly estimating both the code phase offset and the Doppler frequency. Numerical results demonstrate that DEES can acquire spread-spectrum signals in the high-acceleration regime of the low-earth orbit satellite channel at low SNR.
{"title":"Direct-Sequence Spread-Spectrum Acquisition for High Dynamic Environments via Signal Partitioning","authors":"D. A. Chu, J. Barry","doi":"10.1109/MILCOM52596.2021.9653124","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653124","url":null,"abstract":"Time-varying Doppler shifts can arise in low-earth orbit satellites and other high-dynamic environments, and are a significant impediment to the acquisition of spread-spectrum signals. In this paper we propose delay-Doppler efficient exhaustive search (DEES), an efficient algorithm that can acquire direct-sequence spread-spectrum signals with long spreading codes in the presence of both Doppler rate and Doppler frequency shifts. DEES combines the second-order keystone transform and the fractional Fourier transform to mitigate the effects of time-varying channel delays, before jointly estimating both the code phase offset and the Doppler frequency. Numerical results demonstrate that DEES can acquire spread-spectrum signals in the high-acceleration regime of the low-earth orbit satellite channel at low SNR.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"32 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":"128353361","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.9653041
Yi Xiang, L. Milstein
We are interested in a communication system that operates in a jamming environment under stringent power constraints, but is flexible with bandwidth constraints. Our approach is to consider some of the key elements in a transceiver and optimize them for low power consumption. An obvious consequence of this is that high complexity components of the system, such as matched filters, forward error correction (FEC) that employs iterative decoders, coherent demodulators, and bandwidth-efficient modulation formats, are not feasible for this research. Rather, our system is designed using $M$-ary FSK with non-coherent detection and fast frequency hopping (FFH), optimized two-pole bandpass filters (BPF), and Reed-Solomon (RS) codes with hard-decision decoding. Among other things, we show that by properly optimizing the key parameters of the BPFs and RS codes, we can design the system to be significantly less complex than an optimal one, and only lose at most 1.4 dB in terms of performance in most cases, compared to the conventional matched filter receiver.
{"title":"Design of an ultra-low power MFSK system in the presence of jamming","authors":"Yi Xiang, L. Milstein","doi":"10.1109/MILCOM52596.2021.9653041","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653041","url":null,"abstract":"We are interested in a communication system that operates in a jamming environment under stringent power constraints, but is flexible with bandwidth constraints. Our approach is to consider some of the key elements in a transceiver and optimize them for low power consumption. An obvious consequence of this is that high complexity components of the system, such as matched filters, forward error correction (FEC) that employs iterative decoders, coherent demodulators, and bandwidth-efficient modulation formats, are not feasible for this research. Rather, our system is designed using $M$-ary FSK with non-coherent detection and fast frequency hopping (FFH), optimized two-pole bandpass filters (BPF), and Reed-Solomon (RS) codes with hard-decision decoding. Among other things, we show that by properly optimizing the key parameters of the BPFs and RS codes, we can design the system to be significantly less complex than an optimal one, and only lose at most 1.4 dB in terms of performance in most cases, compared to the conventional matched filter receiver.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"15 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":"128710711","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.9653078
M. Refaei, Sean Ha, Robbie Starr, Matt Steele
Named Data Networks (NDN) is an emerging data centric networking paradigm that provides a much needed efficient and resilient communication model for tactical networks. P4 is a programming language that allows for customization of packet processing at the forwarding plane in routers and switches. In this work, we combine NDN and P4 to build an architecture for traffic management in tactical networks. The architecture defines a policy for traffic management that is reflective of mission objectives and stores it in JSON as Named Data objects. We use PSync to synchronize the policy across multiple platforms to ensure policy consistency. The policy can name several actions to take for a given traffic flow, such as DSCP marking, compression, and WAN acceleration, which are then activated/configured by an enforcement engine.
{"title":"Using NDN and P4 For Effective Traffic Management in Tactical Networks","authors":"M. Refaei, Sean Ha, Robbie Starr, Matt Steele","doi":"10.1109/MILCOM52596.2021.9653078","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9653078","url":null,"abstract":"Named Data Networks (NDN) is an emerging data centric networking paradigm that provides a much needed efficient and resilient communication model for tactical networks. P4 is a programming language that allows for customization of packet processing at the forwarding plane in routers and switches. In this work, we combine NDN and P4 to build an architecture for traffic management in tactical networks. The architecture defines a policy for traffic management that is reflective of mission objectives and stores it in JSON as Named Data objects. We use PSync to synchronize the policy across multiple platforms to ensure policy consistency. The policy can name several actions to take for a given traffic flow, such as DSCP marking, compression, and WAN acceleration, which are then activated/configured by an enforcement engine.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"5 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":"116891896","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.9652965
Shorya Consul, Hasan Burhan Beytur, G. de Veciana, H. Vikalo
We consider RF-based network inference based on channel usage. The proposed approaches rely on distributed spectrum sensing and are agnostic to the content and communication protocols. We consider inference based solely on observing nodes' channel usage and show it is equivalent to a Boolean matrix decomposition problem, which in general does not have a unique solution and is an NP-hard problem. We provide necessary and sufficient conditions for the Boolean matrix decomposition problem has a unique solution, i.e., for the network to be recoverable. We also propose a low-complexity network recovery algorithm that finds the unique solution under the recoverability conditions. In addition to that we provide an analysis of the required observation time to collect necessary channel usage data needed for the network recovery algorithm.
{"title":"RF-based Network Inference: Theoretical Foundations","authors":"Shorya Consul, Hasan Burhan Beytur, G. de Veciana, H. Vikalo","doi":"10.1109/MILCOM52596.2021.9652965","DOIUrl":"https://doi.org/10.1109/MILCOM52596.2021.9652965","url":null,"abstract":"We consider RF-based network inference based on channel usage. The proposed approaches rely on distributed spectrum sensing and are agnostic to the content and communication protocols. We consider inference based solely on observing nodes' channel usage and show it is equivalent to a Boolean matrix decomposition problem, which in general does not have a unique solution and is an NP-hard problem. We provide necessary and sufficient conditions for the Boolean matrix decomposition problem has a unique solution, i.e., for the network to be recoverable. We also propose a low-complexity network recovery algorithm that finds the unique solution under the recoverability conditions. In addition to that we provide an analysis of the required observation time to collect necessary channel usage data needed for the network recovery algorithm.","PeriodicalId":187645,"journal":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","volume":"20 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":"114171012","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}