Anonymous MANET routing relies on techniques such as re-encryption on each hop to hide end-to-end communication relations. However, passive signal detectors and traffic analyzers can still retrieve sensitive information from PHY and MAC layers through statistical traffic analysis. In this paper, we propose a statistical traffic pattern discovery (STPD) system. STPD intends to find out the sources and destinations of captured packets and discover the end-to-end communication relations. The proposed approach does not require analyzers to be actively involved in MANET transmissions or to decrypt the traffic. We present theoretical models as well as extensive simulations to demonstrate our solutions.
{"title":"A statistical traffic pattern discovery system for MANETs","authors":"Yang Qin, Dijiang Huang, Bing Li","doi":"10.1109/TDSC.2013.33","DOIUrl":"https://doi.org/10.1109/TDSC.2013.33","url":null,"abstract":"Anonymous MANET routing relies on techniques such as re-encryption on each hop to hide end-to-end communication relations. However, passive signal detectors and traffic analyzers can still retrieve sensitive information from PHY and MAC layers through statistical traffic analysis. In this paper, we propose a statistical traffic pattern discovery (STPD) system. STPD intends to find out the sources and destinations of captured packets and discover the end-to-end communication relations. The proposed approach does not require analyzers to be actively involved in MANET transmissions or to decrypt the traffic. We present theoretical models as well as extensive simulations to demonstrate our solutions.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127869265","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 : 2012-10-10DOI: 10.1109/milcom.2009.5380128
M. Gocmen, K. Hopkinson, M. Compton
Networked communications play a crucial role in United States Armed Forces operations. As the military moves towards more network centric (Net-Centric) operations, it becomes increasingly important to use the network as effectively as possible with respect to the overall mission. This article advocates the use of a Network Tasking Order (NTO), which allows operators to reason about the network based on asset movement, capabilities, and communication requirements. The NTO is similar to the Air Tasking Order, which gives insight into the plan for physical assets in a military mission. In this paper we illustrate the benefit of an NTO in a Combat Search and Rescue (CSAR) scenario. While demonstrating the CSAR mission, we assume the use of the Joint Tactical Radio System (JTRS) for communication. Our premise is that the knowledge in an NTO can be used to achieve better CSAR missions and yield better decision-making opportunities to the mission commanders. Our results show that the End-to-End (ETE) delay with the aid of an NTO in high traffic conditions is shorter compared to those without the NTO and bandwidth requirements are also lower. In low traffic conditions, the ETE delay is shorter without the aid of an NTO, but at the cost of higher bandwidth utilization.
{"title":"The benefits of a network tasking order in combat search and rescue missions","authors":"M. Gocmen, K. Hopkinson, M. Compton","doi":"10.1109/milcom.2009.5380128","DOIUrl":"https://doi.org/10.1109/milcom.2009.5380128","url":null,"abstract":"Networked communications play a crucial role in United States Armed Forces operations. As the military moves towards more network centric (Net-Centric) operations, it becomes increasingly important to use the network as effectively as possible with respect to the overall mission. This article advocates the use of a Network Tasking Order (NTO), which allows operators to reason about the network based on asset movement, capabilities, and communication requirements. The NTO is similar to the Air Tasking Order, which gives insight into the plan for physical assets in a military mission. In this paper we illustrate the benefit of an NTO in a Combat Search and Rescue (CSAR) scenario. While demonstrating the CSAR mission, we assume the use of the Joint Tactical Radio System (JTRS) for communication. Our premise is that the knowledge in an NTO can be used to achieve better CSAR missions and yield better decision-making opportunities to the mission commanders. Our results show that the End-to-End (ETE) delay with the aid of an NTO in high traffic conditions is shorter compared to those without the NTO and bandwidth requirements are also lower. In low traffic conditions, the ETE delay is shorter without the aid of an NTO, but at the cost of higher bandwidth utilization.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123666895","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 : 2012-09-12DOI: 10.1109/milcom.2009.5380001
Augustine A. Honore, Ryan W. Thomas, Richard K. Martin, Stuart H. Kurkowski
Current U.S. military pursuits, such as the Joint Tactical Radio System (JTRS), are based on a software-defined radio (SDR) system. These kinds of systems use the flexibility of software to make old and new radio technology interoperable. Co-existence of different radio technologies has the potential to be a force enabler, but it still falls short, particularly for military operations in which failure to co-exist can cause interference fratricide between allied radios. We designed a collaborative network of cognitive radios derived from flexible, commercially-available SDRs. Using a network of SDRs as an experimental test bed, we implemented a detection and RF characterization algorithm, gathering signal data from multiple spatially diverse points in the network. This provided three main contributions: determining the process for pre-characterizing the SDRs; developing the measurement procedure for effective transmitter detection and estimation; and identifying effective real-world network topologies.
{"title":"Implementation of collaborative RF localization using a software-defined Radio network","authors":"Augustine A. Honore, Ryan W. Thomas, Richard K. Martin, Stuart H. Kurkowski","doi":"10.1109/milcom.2009.5380001","DOIUrl":"https://doi.org/10.1109/milcom.2009.5380001","url":null,"abstract":"Current U.S. military pursuits, such as the Joint Tactical Radio System (JTRS), are based on a software-defined radio (SDR) system. These kinds of systems use the flexibility of software to make old and new radio technology interoperable. Co-existence of different radio technologies has the potential to be a force enabler, but it still falls short, particularly for military operations in which failure to co-exist can cause interference fratricide between allied radios. We designed a collaborative network of cognitive radios derived from flexible, commercially-available SDRs. Using a network of SDRs as an experimental test bed, we implemented a detection and RF characterization algorithm, gathering signal data from multiple spatially diverse points in the network. This provided three main contributions: determining the process for pre-characterizing the SDRs; developing the measurement procedure for effective transmitter detection and estimation; and identifying effective real-world network topologies.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131706662","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 : 2009-10-18DOI: 10.1109/MILCOM.2009.5380055
R. Framjee, V. Prabhu
As cellular technologies evolve, evaluation of modulation schemes with frequency selective fading is an important consideration. We present methods to evaluate a high data rate DS-SS BPSK reverse link, over a wideband channel, with filters and a modified delayed signature dual finger RAKE. For several years the standard Gaussian approximation has been used to estimate error rate of DS-SS BPSK. We derive simple upper and lower bounds on the conditional error rates. The upper bound is in terms of the error rate obtained with two intersymbol interference terms and bounds on the marginal distribution of the smaller terms. The Gaussian approximation error rate is pessimistic for SNR's greater than 8dB and 12dB when compared to that obtained by the total probability theorem and upper bound respectively. Intersymbol interference is not Gaussian and at high front end signal-to-noise ratio's (SNR's) our error rate bound is a better estimate. We have also derived the bandwidth occupancy in a rigorous way for the first time by developing a method to compute the spectral density. The fractional containment bandwidth with two Gold codes is smaller than that with a PN sequence. The spectral density has no discrete lines while it is a function of the signature coefficients and chip Fourier transform. Within the bandwidth the spectral density of a set of frequencies is 15dB greater than at other frequencies and this set varies from signature to signature. Finally, we show that a modified delayed signature RAKE combats multipath interference. These methods can be used to evaluate a dual space diversity four finger RAKE and to select signatures that minimize adjacent and co-channel interference.
{"title":"Some considerations of DS-SS BPSK spectral density and error rate of a high bit rate rake","authors":"R. Framjee, V. Prabhu","doi":"10.1109/MILCOM.2009.5380055","DOIUrl":"https://doi.org/10.1109/MILCOM.2009.5380055","url":null,"abstract":"As cellular technologies evolve, evaluation of modulation schemes with frequency selective fading is an important consideration. We present methods to evaluate a high data rate DS-SS BPSK reverse link, over a wideband channel, with filters and a modified delayed signature dual finger RAKE. For several years the standard Gaussian approximation has been used to estimate error rate of DS-SS BPSK. We derive simple upper and lower bounds on the conditional error rates. The upper bound is in terms of the error rate obtained with two intersymbol interference terms and bounds on the marginal distribution of the smaller terms. The Gaussian approximation error rate is pessimistic for SNR's greater than 8dB and 12dB when compared to that obtained by the total probability theorem and upper bound respectively. Intersymbol interference is not Gaussian and at high front end signal-to-noise ratio's (SNR's) our error rate bound is a better estimate. We have also derived the bandwidth occupancy in a rigorous way for the first time by developing a method to compute the spectral density. The fractional containment bandwidth with two Gold codes is smaller than that with a PN sequence. The spectral density has no discrete lines while it is a function of the signature coefficients and chip Fourier transform. Within the bandwidth the spectral density of a set of frequencies is 15dB greater than at other frequencies and this set varies from signature to signature. Finally, we show that a modified delayed signature RAKE combats multipath interference. These methods can be used to evaluate a dual space diversity four finger RAKE and to select signatures that minimize adjacent and co-channel interference.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"55 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116755600","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 : 2009-10-18DOI: 10.1109/MILCOM.2009.5379710
J. Kleider, Xiaoli Ma, Chris Steenhoek
Multiple antenna systems have been shown to provide significant performance improvements for network nodes; however, the vast majority of nodes in military networks will be limited to single channel devices due to mobility (size and power) and ease of use considerations. In this paper we apply a new joint synchronization-pilot sequence (JSPS) optimization design technique to multiple transmitter OFDM systems. We consider the cases where the transmitters could be co-located or distributed (i.e. multiple single-channel transmitters) in space. Independent JSPSs are designed for each transmitter in a multiple antenna system and can be utilized to estimate the carrier frequency offset (CFO) and sampling frequency offset (SFO) of each antenna independently. We study the mean square error (MSE) for the estimation of CFO and SFO and compare the performance of our estimators to a closed form solution for AWGN channels. We show that the performance of our proposed iterative estimators for distributed CFO and SFO estimation is approximately equivalent to the estimation performance in the co-located CFO and SFO estimation case. The iterative estimator for the distributed case is also found to be of low complexity, with only a linear complexity increase over the co-located estimator. We have also measured, via simulation, the performance of the CFO estimator for distributed Rayleigh fading multipath channels.
{"title":"Distributed multiple antenna carrier- and sampling-frequency synchronization for OFDM","authors":"J. Kleider, Xiaoli Ma, Chris Steenhoek","doi":"10.1109/MILCOM.2009.5379710","DOIUrl":"https://doi.org/10.1109/MILCOM.2009.5379710","url":null,"abstract":"Multiple antenna systems have been shown to provide significant performance improvements for network nodes; however, the vast majority of nodes in military networks will be limited to single channel devices due to mobility (size and power) and ease of use considerations. In this paper we apply a new joint synchronization-pilot sequence (JSPS) optimization design technique to multiple transmitter OFDM systems. We consider the cases where the transmitters could be co-located or distributed (i.e. multiple single-channel transmitters) in space. Independent JSPSs are designed for each transmitter in a multiple antenna system and can be utilized to estimate the carrier frequency offset (CFO) and sampling frequency offset (SFO) of each antenna independently. We study the mean square error (MSE) for the estimation of CFO and SFO and compare the performance of our estimators to a closed form solution for AWGN channels. We show that the performance of our proposed iterative estimators for distributed CFO and SFO estimation is approximately equivalent to the estimation performance in the co-located CFO and SFO estimation case. The iterative estimator for the distributed case is also found to be of low complexity, with only a linear complexity increase over the co-located estimator. We have also measured, via simulation, the performance of the CFO estimator for distributed Rayleigh fading multipath channels.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125089920","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 : 2009-10-18DOI: 10.1109/MILCOM.2009.5379843
Devan Rehunathan, R. Atkinson, S. Bhatti
Mobile Networks are increasingly important in land-, sea-and air-based military scenarios. The interest in supporting network mobility for Internet Protocol (IP) networks has led to the Network Mobility (NEMO) protocol extensions being proposed for IP within the IETF. These extensions are based on the work already completed on host mobility for Mobile IP (MIP). The current work is based on the use of software agents: a Home Agent (HA) intercepts packets destined for the addresses in the mobile network and uses an IP-in-IP tunnel to send the packets to the Mobile Router (MR) located at a Care of Address (CoA), which terminates the tunnel. As the mobile network moves to new IP networks, the MR updates the HA with its new CoA. While this tunnelling approach represents a sound engineering solution for backwards compatibility, and is the only one that has been pursued within the IETF, it has seen little deployment, either in support of mobile hosts or mobile networks. We make the case for an alternative approach based on secure naming. We make a comparison in operation with the current tunnelling-based approach, both in architecture and by analysis of protocol operation. Our initial analyses indicate that a naming-based approach shows promise as a viable alternative to a tunnelling-based approach, and could offer other architectural benefits.
{"title":"Enabling Mobile Networks through secure naming","authors":"Devan Rehunathan, R. Atkinson, S. Bhatti","doi":"10.1109/MILCOM.2009.5379843","DOIUrl":"https://doi.org/10.1109/MILCOM.2009.5379843","url":null,"abstract":"Mobile Networks are increasingly important in land-, sea-and air-based military scenarios. The interest in supporting network mobility for Internet Protocol (IP) networks has led to the Network Mobility (NEMO) protocol extensions being proposed for IP within the IETF. These extensions are based on the work already completed on host mobility for Mobile IP (MIP). The current work is based on the use of software agents: a Home Agent (HA) intercepts packets destined for the addresses in the mobile network and uses an IP-in-IP tunnel to send the packets to the Mobile Router (MR) located at a Care of Address (CoA), which terminates the tunnel. As the mobile network moves to new IP networks, the MR updates the HA with its new CoA. While this tunnelling approach represents a sound engineering solution for backwards compatibility, and is the only one that has been pursued within the IETF, it has seen little deployment, either in support of mobile hosts or mobile networks. We make the case for an alternative approach based on secure naming. We make a comparison in operation with the current tunnelling-based approach, both in architecture and by analysis of protocol operation. Our initial analyses indicate that a naming-based approach shows promise as a viable alternative to a tunnelling-based approach, and could offer other architectural benefits.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125476479","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 : 2009-10-18DOI: 10.1109/MILCOM.2009.5380063
N. Xu, Shengli Fu
In this paper, we explore the advantages of network coding and space-time coding in improving the performance of two-way relay channel communications where two terminals absent of direct link exchange information through a single relay in between. Network coding allows embracing interference from other terminals thereby turning it into a capacity boost. Application of space-time codes yields higher capacity by exploiting spatial diversity. The joint performance of both aforementioned techniques is studied in this paper. Specifically, we propose a new class of decode-and-forward (DF) relaying strategy, evaluated in terms of bit error rate by both theoretical analysis and simulation. Based on our results, DF outperforms the existing amplify-and-decode and partial-decode-and-forward protocols.
{"title":"Performance analysis of space-time codes over two-way relay channels","authors":"N. Xu, Shengli Fu","doi":"10.1109/MILCOM.2009.5380063","DOIUrl":"https://doi.org/10.1109/MILCOM.2009.5380063","url":null,"abstract":"In this paper, we explore the advantages of network coding and space-time coding in improving the performance of two-way relay channel communications where two terminals absent of direct link exchange information through a single relay in between. Network coding allows embracing interference from other terminals thereby turning it into a capacity boost. Application of space-time codes yields higher capacity by exploiting spatial diversity. The joint performance of both aforementioned techniques is studied in this paper. Specifically, we propose a new class of decode-and-forward (DF) relaying strategy, evaluated in terms of bit error rate by both theoretical analysis and simulation. Based on our results, DF outperforms the existing amplify-and-decode and partial-decode-and-forward protocols.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125479184","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 : 2009-10-18DOI: 10.1109/MILCOM.2009.5380092
D. Stott, Lloyd G. Greenwald, Patrick Kreidl, Brian DeCleene Bae
Estimating network parameters from noisy data is a hard problem that can be made even more difficult by the presence of a malicious adversary who may corrupt the measurement process by capturing a trusted node or perturbing data externally. The adversary may have complete knowledge of the networking protocols that rely on the parameter estimates and may adjust its effect on the system to push protocols into incorrect operating regimes. This work focuses on studying how an adversary may impact the estimation of link quality (LQ) of a communications link. We propose a nonlinear filtering solution that simultaneously tracks both the quality of a link and the state of the adversary, tracking the latter to tolerate better the corruption in tracking the former. We provide empirical results while considering several types of adversarial perturbation, including ones that falsely report the LQ measurements or jam a link. Extensions of these analytical techniques and empirical results show how assumptions about symmetry between the LQ of each direction of a bidirectional link can improve adversary tracking and, in turn, LQ estimation.
{"title":"Tolerating adversaries in the estimation of network parameters from noisy data: A nonlinear filtering approach","authors":"D. Stott, Lloyd G. Greenwald, Patrick Kreidl, Brian DeCleene Bae","doi":"10.1109/MILCOM.2009.5380092","DOIUrl":"https://doi.org/10.1109/MILCOM.2009.5380092","url":null,"abstract":"Estimating network parameters from noisy data is a hard problem that can be made even more difficult by the presence of a malicious adversary who may corrupt the measurement process by capturing a trusted node or perturbing data externally. The adversary may have complete knowledge of the networking protocols that rely on the parameter estimates and may adjust its effect on the system to push protocols into incorrect operating regimes. This work focuses on studying how an adversary may impact the estimation of link quality (LQ) of a communications link. We propose a nonlinear filtering solution that simultaneously tracks both the quality of a link and the state of the adversary, tracking the latter to tolerate better the corruption in tracking the former. We provide empirical results while considering several types of adversarial perturbation, including ones that falsely report the LQ measurements or jam a link. Extensions of these analytical techniques and empirical results show how assumptions about symmetry between the LQ of each direction of a bidirectional link can improve adversary tracking and, in turn, LQ estimation.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116024081","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 : 2009-10-18DOI: 10.1109/MILCOM.2009.5380120
Jason D. Ellis, M. Pursley
Demodulation of M-ary quadrature amplitude modulation (M-QAM) requires the receiver to estimate the phase and amplitude of the received signal. The demodulator performance is sensitive to errors in these estimates, and the sensitivity increases as M increases. We examine the effects of phase and amplitude errors on the performance of QAM communication systems with error-control coding and soft-decision decoding. Performance comparisons are given for 16-QAM and 64-QAM for two error-control coding techniques and two soft-decision decoding metrics.
{"title":"Comparison of soft-decision decoding metrics in a QAM system with phase and amplitude errors","authors":"Jason D. Ellis, M. Pursley","doi":"10.1109/MILCOM.2009.5380120","DOIUrl":"https://doi.org/10.1109/MILCOM.2009.5380120","url":null,"abstract":"Demodulation of M-ary quadrature amplitude modulation (M-QAM) requires the receiver to estimate the phase and amplitude of the received signal. The demodulator performance is sensitive to errors in these estimates, and the sensitivity increases as M increases. We examine the effects of phase and amplitude errors on the performance of QAM communication systems with error-control coding and soft-decision decoding. Performance comparisons are given for 16-QAM and 64-QAM for two error-control coding techniques and two soft-decision decoding metrics.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116161510","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 : 2009-10-18DOI: 10.1109/MILCOM.2009.5379830
P. Velez, A. Dwivedi, P. Harshavardhana, D. Tebben, A. R. Hammons
Mobile Free Space Optical (FSO) links suffer from frequent link blockages due to opaque obstructions or link degradations that can result in degraded or failed networks. In this paper, a dynamic layer-1 based topology and routing control methodology is presented for assuring connectivity in networks with fragile links. Core components of this methodology are described with special emphasis on the dynamic topology optimization algorithm and topology transition schemes. The effectiveness of the proposed methodology depends on the fragility of links compared to the topology optimization duration. If the link fragility is comparable to the time taken to achieve the optimal topology, then this methodology will not lead to a stable network. A companion paper [1] presents link fragility results for various types of terrain and demonstrates that the expected link longevity is significantly greater than the time taken by the proposed dynamic network optimization scheme. Thus, network connectivity can be greatly improved by employing the proposed dynamic topology control methodology and optimization of physical network parameters such as antenna height.
{"title":"Dynamic topology optimization and transition schemes for assuring connectivity in multihop mobile optical wireless communications networks","authors":"P. Velez, A. Dwivedi, P. Harshavardhana, D. Tebben, A. R. Hammons","doi":"10.1109/MILCOM.2009.5379830","DOIUrl":"https://doi.org/10.1109/MILCOM.2009.5379830","url":null,"abstract":"Mobile Free Space Optical (FSO) links suffer from frequent link blockages due to opaque obstructions or link degradations that can result in degraded or failed networks. In this paper, a dynamic layer-1 based topology and routing control methodology is presented for assuring connectivity in networks with fragile links. Core components of this methodology are described with special emphasis on the dynamic topology optimization algorithm and topology transition schemes. The effectiveness of the proposed methodology depends on the fragility of links compared to the topology optimization duration. If the link fragility is comparable to the time taken to achieve the optimal topology, then this methodology will not lead to a stable network. A companion paper [1] presents link fragility results for various types of terrain and demonstrates that the expected link longevity is significantly greater than the time taken by the proposed dynamic network optimization scheme. Thus, network connectivity can be greatly improved by employing the proposed dynamic topology control methodology and optimization of physical network parameters such as antenna height.","PeriodicalId":338641,"journal":{"name":"MILCOM 2009 - 2009 IEEE Military Communications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114604990","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
扫码关注我们
求助内容：
应助结果提醒方式：