Pub Date : 2017-10-24DOI: 10.1109/MILCOM.2017.8170792
Jaeuk Baek, Doyeon Kim, Hongsuk Shim, Youngnam Han
Compared to conventional radar systems, passive coherent location (PCL) systems utilize transmitters already deployed within an environment. In this paper, we investigate PCL systems to estimate an unknown target position in three dimensional space, and propose a target-tracking process of three steps: 1) receiver selection, 2) target-tracking algorithm, and 3) filtering process. To reduce an estimation error of target position, especially Z coordinate of the target position, we also propose a receiver selection algorithm. The selected receivers can be utilized in the proposed target-tracking algorithm that successively estimates target positions in XY and YZ planes. Furthermore, in YZ plane, an estimation error of Z coordinate can be minimized by allocating different weights on each receiver's estimate. Lastly, a decoupled Kalman filter is applied to the target-tracking process. Simulation results show that the proposed target-tracking process achieves higher accuracy than other algorithms.
{"title":"Improved target-tracking process in PCL","authors":"Jaeuk Baek, Doyeon Kim, Hongsuk Shim, Youngnam Han","doi":"10.1109/MILCOM.2017.8170792","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170792","url":null,"abstract":"Compared to conventional radar systems, passive coherent location (PCL) systems utilize transmitters already deployed within an environment. In this paper, we investigate PCL systems to estimate an unknown target position in three dimensional space, and propose a target-tracking process of three steps: 1) receiver selection, 2) target-tracking algorithm, and 3) filtering process. To reduce an estimation error of target position, especially Z coordinate of the target position, we also propose a receiver selection algorithm. The selected receivers can be utilized in the proposed target-tracking algorithm that successively estimates target positions in XY and YZ planes. Furthermore, in YZ plane, an estimation error of Z coordinate can be minimized by allocating different weights on each receiver's estimate. Lastly, a decoupled Kalman filter is applied to the target-tracking process. Simulation results show that the proposed target-tracking process achieves higher accuracy than other algorithms.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122233739","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170847
Ehsan Keramat, Nicholas Kauffroath, Kia Karbasi, Heng Zhao, B. Daneshrad, G. Pottie
Mobile ad-hoc networks (MANET) are of particular importance in military communications. With the trend towards higher throughput requirements and spectrum congestion, researchers have looked at using multi-antenna techniques to enable concurrent transmissions within a one-hop MANET. However, the acquisition overhead has been shown to be a problem when dealing with concurrent transmission in MANET systems. Recently a novel time/resource efficient algorithm for frequency acquisition in concurrent MANETs has been proposed which uses simultaneous transmissions of Zadoff-Chu (ZC) sequence pairs. In this paper, we have prototyped this algorithm in hardware and have focused on validating its theoretically based claims and finding its performance limitations. We have been able to identify a series of hardware non idealities that affect the performance of the algorithm in practical schemes. We have performed indoor and outdoor experiments for Carrier Frequency Offset (CFO) estimation and shown that the algorithm is able to achieve reliable CFO estimation using off the shelf hardware, all while attaining better (smaller) acquisition overhead. Our results show that by choosing a proper length for the ZC sequences, we are able to estimate the CFO within ten Hertz of its real value. We have also identified scenarios under which the algorithm would be suboptimal.
{"title":"Experimental results for low overhead frequency offset estimation in MANETs with concurrent transmission","authors":"Ehsan Keramat, Nicholas Kauffroath, Kia Karbasi, Heng Zhao, B. Daneshrad, G. Pottie","doi":"10.1109/MILCOM.2017.8170847","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170847","url":null,"abstract":"Mobile ad-hoc networks (MANET) are of particular importance in military communications. With the trend towards higher throughput requirements and spectrum congestion, researchers have looked at using multi-antenna techniques to enable concurrent transmissions within a one-hop MANET. However, the acquisition overhead has been shown to be a problem when dealing with concurrent transmission in MANET systems. Recently a novel time/resource efficient algorithm for frequency acquisition in concurrent MANETs has been proposed which uses simultaneous transmissions of Zadoff-Chu (ZC) sequence pairs. In this paper, we have prototyped this algorithm in hardware and have focused on validating its theoretically based claims and finding its performance limitations. We have been able to identify a series of hardware non idealities that affect the performance of the algorithm in practical schemes. We have performed indoor and outdoor experiments for Carrier Frequency Offset (CFO) estimation and shown that the algorithm is able to achieve reliable CFO estimation using off the shelf hardware, all while attaining better (smaller) acquisition overhead. Our results show that by choosing a proper length for the ZC sequences, we are able to estimate the CFO within ten Hertz of its real value. We have also identified scenarios under which the algorithm would be suboptimal.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115128418","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170852
Markus Kont, Mauno Pihelgas, Kaie Maennel, Bernhards Blumbergs, Toomas Lepik
Cyber Defense Exercises have received much attention in recent years, and are increasingly becoming the cornerstone for ensuring readiness in this new domain. Crossed Swords is an exercise directed at training Red Team members for responsive cyber defense. However, prior iterations have revealed the need for automated and transparent real-time feedback systems to help participants improve their techniques and understand technical challenges. Feedback was too slow and players did not understand the visibility of their actions. We developed a novel and modular open-source framework to address this problem, dubbed Frankenstack. We used this framework during Crossed Swords 2017 execution and evaluated its effectiveness by interviewing participants and conducting an online survey. Due to the novelty of Red Team-centric exercises, very little academic research exists on providing real-time feedback during such exercises. Thus, this paper serves as a first foray into a novel research field.
{"title":"Frankenstack: Toward real-time Red Team feedback","authors":"Markus Kont, Mauno Pihelgas, Kaie Maennel, Bernhards Blumbergs, Toomas Lepik","doi":"10.1109/MILCOM.2017.8170852","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170852","url":null,"abstract":"Cyber Defense Exercises have received much attention in recent years, and are increasingly becoming the cornerstone for ensuring readiness in this new domain. Crossed Swords is an exercise directed at training Red Team members for responsive cyber defense. However, prior iterations have revealed the need for automated and transparent real-time feedback systems to help participants improve their techniques and understand technical challenges. Feedback was too slow and players did not understand the visibility of their actions. We developed a novel and modular open-source framework to address this problem, dubbed Frankenstack. We used this framework during Crossed Swords 2017 execution and evaluated its effectiveness by interviewing participants and conducting an online survey. Due to the novelty of Red Team-centric exercises, very little academic research exists on providing real-time feedback during such exercises. Thus, this paper serves as a first foray into a novel research field.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116635962","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170776
Bilal Al-Doori, Xian Liu, Ayad N. Bihnam
The decode-and-forward (DF) relay based cellular network is considered an efficient technique for solving the coverage and improving system capacity of the current fourth-generation (4G) and the emerging fifth-generation (5G) mobile telecommunication technologies. In this analysis, we control the codeword's transmission parameters by achieving a good trade-off between setting more resources with changing the modulation order, hence reducing the relay's access link transmitted power. We first address the calculations of codeword's size in 3GPP specification, where an unhealthy component carrier selection mechanism is introduced for defining relay's transmission spectrum. Then, we present a novel 3GPP-compliant binary integer optimization model subject to several practical constraints, such as the requisite resources and throughput. Through system level simulations, the proposed approach is compared with the conventional relaying systems. It is shown that our approach has made several improvements to the conventional schemes.
{"title":"Throughput and power management of access link DF type I relay nodes for LTE-A networks and beyond","authors":"Bilal Al-Doori, Xian Liu, Ayad N. Bihnam","doi":"10.1109/MILCOM.2017.8170776","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170776","url":null,"abstract":"The decode-and-forward (DF) relay based cellular network is considered an efficient technique for solving the coverage and improving system capacity of the current fourth-generation (4G) and the emerging fifth-generation (5G) mobile telecommunication technologies. In this analysis, we control the codeword's transmission parameters by achieving a good trade-off between setting more resources with changing the modulation order, hence reducing the relay's access link transmitted power. We first address the calculations of codeword's size in 3GPP specification, where an unhealthy component carrier selection mechanism is introduced for defining relay's transmission spectrum. Then, we present a novel 3GPP-compliant binary integer optimization model subject to several practical constraints, such as the requisite resources and throughput. Through system level simulations, the proposed approach is compared with the conventional relaying systems. It is shown that our approach has made several improvements to the conventional schemes.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116866485","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170744
C. Lamy-Bergot, J. Rogier, Jean-Yves Bernier, Jean-Baptiste Chantelouve, Patrice Stevens, Philippe Crambert
HF ionospherical channels are very challenging due to their time and frequency selective, and highly varying natures. Furthermore, they offer only limited data rates, which led generations of engineers to limit the signalization information and to reduce the number of turnarounds to preserve a maximum throughput for useful data. However, new wideband modems [1] [2] have recently been proposed, that achieve much higher data rates and a much better resilience on the HF link, leading to re-assess such traditional strategies. This paper presents a protocol relying on a time division approach, which can follow very closely the channel variations between two stations for only a limited signaling overhead, and as such allows to optimize the transmissions. Experimental results are given, that demonstrate the interest of such an approach over various ionospherical HF channels.
{"title":"Time-division approach in HF wideband: Surfing the wave to offer a better performance","authors":"C. Lamy-Bergot, J. Rogier, Jean-Yves Bernier, Jean-Baptiste Chantelouve, Patrice Stevens, Philippe Crambert","doi":"10.1109/MILCOM.2017.8170744","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170744","url":null,"abstract":"HF ionospherical channels are very challenging due to their time and frequency selective, and highly varying natures. Furthermore, they offer only limited data rates, which led generations of engineers to limit the signalization information and to reduce the number of turnarounds to preserve a maximum throughput for useful data. However, new wideband modems [1] [2] have recently been proposed, that achieve much higher data rates and a much better resilience on the HF link, leading to re-assess such traditional strategies. This paper presents a protocol relying on a time division approach, which can follow very closely the channel variations between two stations for only a limited signaling overhead, and as such allows to optimize the transmissions. Experimental results are given, that demonstrate the interest of such an approach over various ionospherical HF channels.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124929522","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170832
S. Parvin, Abderrahmen Mtibaa, Hong Huang, S. Misra, S. Mahbub, A. Alshehri, R. Zahedi
In mobile Cognitive Radio Networks (CRNs), the frequent link breakage and wireless interference urged the need for novel stable routing solutions. In this paper, we propose STAR, a stable routing protocol that aims at selecting interference-free and durable paths. We investigate the particular Hidden interfering Primary User (HIPU) problem caused by the un-detectable presence of the primary user in the transmission range of the secondary users resulting on severe packet loss. While existing CRNs routing solution, generally, overlook the interference caused by the Hidden Interfering Primary User (HIPU), STAR defines a HIPU-free transmission zone, that enables successful transmission and selects a stable route that is free from interference along the path to the destination. STAR uses prediction based model to estimate the link stability and the link propagation delay. To quantitatively select the best stable links along the route, STAR implements an objective function, cognitive stable link (CSL), that captures node mobility, interference by the HIPU, link propagation delay, and the distance towards the destination. We evaluate STAR, while comparing its throughput, latency, and packet loss ratio to three other protocols, namely PCTC, J-SRCA and AODV. Evaluation on MATLAB shows that STAR achieves higher throughput while reducing the end-to-end latency and the packet loss in the network.
{"title":"STAR: STAble routing for hidden interfering primary user problems in mobile cognitive radio networks","authors":"S. Parvin, Abderrahmen Mtibaa, Hong Huang, S. Misra, S. Mahbub, A. Alshehri, R. Zahedi","doi":"10.1109/MILCOM.2017.8170832","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170832","url":null,"abstract":"In mobile Cognitive Radio Networks (CRNs), the frequent link breakage and wireless interference urged the need for novel stable routing solutions. In this paper, we propose STAR, a stable routing protocol that aims at selecting interference-free and durable paths. We investigate the particular Hidden interfering Primary User (HIPU) problem caused by the un-detectable presence of the primary user in the transmission range of the secondary users resulting on severe packet loss. While existing CRNs routing solution, generally, overlook the interference caused by the Hidden Interfering Primary User (HIPU), STAR defines a HIPU-free transmission zone, that enables successful transmission and selects a stable route that is free from interference along the path to the destination. STAR uses prediction based model to estimate the link stability and the link propagation delay. To quantitatively select the best stable links along the route, STAR implements an objective function, cognitive stable link (CSL), that captures node mobility, interference by the HIPU, link propagation delay, and the distance towards the destination. We evaluate STAR, while comparing its throughput, latency, and packet loss ratio to three other protocols, namely PCTC, J-SRCA and AODV. Evaluation on MATLAB shows that STAR achieves higher throughput while reducing the end-to-end latency and the packet loss in the network.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123704793","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170743
Adrien Le Naour, Elie Janin, C. Poulliat
NarrowBand Waveforms (NBWF) are often used in VHF or UHF tactical communications. For these kinds of waveforms, low latency and robust data rates result in short codeword lengths that are challenging in terms of channel coding. Usually, serially concatenated convolutional code and continuous phase modulation (CC-CPM) schemes are considered in the context of NBWF. When evaluating the achievable rates, CC-CPM schemes show a 1 to 4 dB maximum margin. In this paper, we investigate on two new sparse graph-based channel coding strategies, trying to reduce this degradation for the achievable rate. Some implementation issues with short codeword lengths are also addressed. To this end, we first consider a serially concatenated CPM scheme where the outer code is an optimized Low-Density Parity-Check code (LDPC) based on some recently introduced methods for this kind of applications. The optimized LDPC scheme exhibits a good bit error rate when binary CPMs are used. This new design comes with lower computational complexity and greater flexibility. Second, in order to avoid the cubersome of iterative detection and decoding, we investigate on recently introduced precoded CPM that can achieve near optimal performance, referred to us as Pragmatic CPM (P-CPM). For this kind of precoded CPM schemes, we will show that associated EXIT chart curves have the flat property. It means that, to achieve good performance, P-CPM can be used with standard capacity approaching codes like LDPC Accumulate Repeat Jagged Accumulate (ARJA) or Turbo Codes without the need for iterative decoding. Bit error rate simulations confirm that P-CPM is a reliable alternative NBWF scheme compatible with versatile modern channel codes. As P-CPM is non-iterative, implementation is made easier. In additive white Gaussian noise, both schemes are found practical.
{"title":"New perspectives for coded continuous phase modulations for narrowband waveforms: Iterative versus non-iterative solutions","authors":"Adrien Le Naour, Elie Janin, C. Poulliat","doi":"10.1109/MILCOM.2017.8170743","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170743","url":null,"abstract":"NarrowBand Waveforms (NBWF) are often used in VHF or UHF tactical communications. For these kinds of waveforms, low latency and robust data rates result in short codeword lengths that are challenging in terms of channel coding. Usually, serially concatenated convolutional code and continuous phase modulation (CC-CPM) schemes are considered in the context of NBWF. When evaluating the achievable rates, CC-CPM schemes show a 1 to 4 dB maximum margin. In this paper, we investigate on two new sparse graph-based channel coding strategies, trying to reduce this degradation for the achievable rate. Some implementation issues with short codeword lengths are also addressed. To this end, we first consider a serially concatenated CPM scheme where the outer code is an optimized Low-Density Parity-Check code (LDPC) based on some recently introduced methods for this kind of applications. The optimized LDPC scheme exhibits a good bit error rate when binary CPMs are used. This new design comes with lower computational complexity and greater flexibility. Second, in order to avoid the cubersome of iterative detection and decoding, we investigate on recently introduced precoded CPM that can achieve near optimal performance, referred to us as Pragmatic CPM (P-CPM). For this kind of precoded CPM schemes, we will show that associated EXIT chart curves have the flat property. It means that, to achieve good performance, P-CPM can be used with standard capacity approaching codes like LDPC Accumulate Repeat Jagged Accumulate (ARJA) or Turbo Codes without the need for iterative decoding. Bit error rate simulations confirm that P-CPM is a reliable alternative NBWF scheme compatible with versatile modern channel codes. As P-CPM is non-iterative, implementation is made easier. In additive white Gaussian noise, both schemes are found practical.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126778023","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170764
Chang Liu, Z. Haas
Radio frequency identification (RFID) is a technology for automated identification of objects and people. RFID technology is expected to find extensive use in applications related to the Internet of Things, and in particular applications of Internet of Battlefield Things. Of particular interest are passive RFID tags due to a number of their salient advantages. Such tags, lacking energy sources of their own, use backscattering of the power of an RF source (a reader) to communicate. Recently, passive RFID tag-to-tag (T2T) communication has been demonstrated, via which tags can directly communicate with each other and share information. This opens the possibility of building a Network of Tags (NeTa), in which the passive tags communicate among themselves to perform data processing functions. Among possible applications of NeTa are monitoring services in hard-to-reach locations. As an essential step toward implementation of NeTa, we consider a novel multi-hop network architecture; in particular, with the proposed novel turbo backscattering operation, inter-tag distances can be significantly increased. Due to the interference among tags' transmissions, one of the main technical challenges of implementing such the NeTa architecture is the routing protocol design. In this paper, we introduce a design of a routing protocol, which is based on a solution of a non-linear binary optimization problem. We study the performance of the proposed protocol and investigate impacts of several network factors, such as the tag density and the transmit power of the reader.
{"title":"Multi-hop routing protocols for RFID systems with tag-to-tag communication","authors":"Chang Liu, Z. Haas","doi":"10.1109/MILCOM.2017.8170764","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170764","url":null,"abstract":"Radio frequency identification (RFID) is a technology for automated identification of objects and people. RFID technology is expected to find extensive use in applications related to the Internet of Things, and in particular applications of Internet of Battlefield Things. Of particular interest are passive RFID tags due to a number of their salient advantages. Such tags, lacking energy sources of their own, use backscattering of the power of an RF source (a reader) to communicate. Recently, passive RFID tag-to-tag (T2T) communication has been demonstrated, via which tags can directly communicate with each other and share information. This opens the possibility of building a Network of Tags (NeTa), in which the passive tags communicate among themselves to perform data processing functions. Among possible applications of NeTa are monitoring services in hard-to-reach locations. As an essential step toward implementation of NeTa, we consider a novel multi-hop network architecture; in particular, with the proposed novel turbo backscattering operation, inter-tag distances can be significantly increased. Due to the interference among tags' transmissions, one of the main technical challenges of implementing such the NeTa architecture is the routing protocol design. In this paper, we introduce a design of a routing protocol, which is based on a solution of a non-linear binary optimization problem. We study the performance of the proposed protocol and investigate impacts of several network factors, such as the tag density and the transmit power of the reader.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122591660","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170775
R. Hunjet, Thomas Stevens, Mathew Elliot, B. Fraser, P. George
This paper presents an agile and generic decentralized swarming architecture called the Survivable Communications and Autonomous Delivery Service (SCADS). SCADS enables swarm members to modify their individual (local) behavior to best contribute to meeting global mission objectives. In this paper we examine how the architecture can provide an agile swarming approach to data ferrying to facilitate information exchange in a highly contested radio frequency (RF) environment. The SCADS architecture is described and the implementation of a data ferrying algorithm within the framework on multiple unmanned autonomous systems is presented. We demonstrate how this approach can disseminate data using a delay tolerant networking paradigm to efficiently deliver data in a sparse disconnected network topology in the presence RF jamming.
{"title":"Survivable communications and autonomous delivery service a generic swarming framework enabling communications in contested environments","authors":"R. Hunjet, Thomas Stevens, Mathew Elliot, B. Fraser, P. George","doi":"10.1109/MILCOM.2017.8170775","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170775","url":null,"abstract":"This paper presents an agile and generic decentralized swarming architecture called the Survivable Communications and Autonomous Delivery Service (SCADS). SCADS enables swarm members to modify their individual (local) behavior to best contribute to meeting global mission objectives. In this paper we examine how the architecture can provide an agile swarming approach to data ferrying to facilitate information exchange in a highly contested radio frequency (RF) environment. The SCADS architecture is described and the implementation of a data ferrying algorithm within the framework on multiple unmanned autonomous systems is presented. We demonstrate how this approach can disseminate data using a delay tolerant networking paradigm to efficiently deliver data in a sparse disconnected network topology in the presence RF jamming.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121894455","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170794
Peter Dong, Harrison Carcione, Joseph Hutter, Gina Jiang, C. Kuch, Soomin Park, Advai Podduturi, Peijing Xu, D. Beering
An essential part of satellite communication is the orientation of the antenna, which can be difficult to ascertain on mobile platforms such as ships. While equipment to measure orientation accurately at sea exists, current solutions are expensive. This paper describes work toward an antenna orientation system using low-cost Global Position System (GPS) receivers. We investigated two methods: one using the spatial difference between multiple GPS units at the vertices of a polygon, and the other using the differences over time measured using a single GPS unit. We tested the antenna orientation system with the Omnispace F2 satellite at the US Electrodynamics, Inc. (USEI) teleport in Brewster, WA. Although non-correlated systematic errors in the GPS receivers made the multiple-GPS system impractical, the time-differential method was able to maintain a satellite lock for the majority of a simple test course. The reliability of this solution may be further improved using a gain-based correction algorithm.
{"title":"Designing a low-cost mobile tracking system for communication with a medium earth orbit satellite","authors":"Peter Dong, Harrison Carcione, Joseph Hutter, Gina Jiang, C. Kuch, Soomin Park, Advai Podduturi, Peijing Xu, D. Beering","doi":"10.1109/MILCOM.2017.8170794","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170794","url":null,"abstract":"An essential part of satellite communication is the orientation of the antenna, which can be difficult to ascertain on mobile platforms such as ships. While equipment to measure orientation accurately at sea exists, current solutions are expensive. This paper describes work toward an antenna orientation system using low-cost Global Position System (GPS) receivers. We investigated two methods: one using the spatial difference between multiple GPS units at the vertices of a polygon, and the other using the differences over time measured using a single GPS unit. We tested the antenna orientation system with the Omnispace F2 satellite at the US Electrodynamics, Inc. (USEI) teleport in Brewster, WA. Although non-correlated systematic errors in the GPS receivers made the multiple-GPS system impractical, the time-differential method was able to maintain a satellite lock for the majority of a simple test course. The reliability of this solution may be further improved using a gain-based correction algorithm.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128315021","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
扫码关注我们
求助内容：
应助结果提醒方式：