Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258191
S.-W. Park, W. Tsai
After a brief discussion of the distributed Bellman-Ford algorithm and the associated looping problems, a routing algorithm for loop detection and resolution is proposed. The proposed algorithm detects and resolves all kinds of loops within a finite time depending on the number of nodes in a loop, while requiring a small computation and memory overhead. No extra control messages are generated and communicated over the network. The proposed algorithm does not allow any serious looping effects and maintains the simplicity of the distributed Bellman-Ford algorithm.<>
{"title":"Distributed routing algorithm for loop detection and resolution","authors":"S.-W. Park, W. Tsai","doi":"10.1109/MILCOM.1991.258191","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258191","url":null,"abstract":"After a brief discussion of the distributed Bellman-Ford algorithm and the associated looping problems, a routing algorithm for loop detection and resolution is proposed. The proposed algorithm detects and resolves all kinds of loops within a finite time depending on the number of nodes in a loop, while requiring a small computation and memory overhead. No extra control messages are generated and communicated over the network. The proposed algorithm does not allow any serious looping effects and maintains the simplicity of the distributed Bellman-Ford algorithm.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132702141","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 : 1991-11-04DOI: 10.1109/MILCOM.1991.258284
C. M. Barnhart, J. Wieselthier, A. Ephremides
The authors address the problem of link activation or scheduling in multihop packet radio networks, a contention-free form of channel access that is appropriate for many military communication applications. This problem, in almost all of its forms, is a combinatorial-optimization problem of high complexity. They approach this problem by the use of a Hopfield neural network model in which the method of Lagrange multipliers is used to dynamically vary the values of the coefficients used in the connection weights. Extensive software simulation results demonstrate the effectiveness of this approach in producing schedules of optimal length. Issues associated with the extension of this approach to the joint routing/scheduling problem are discussed.<>
{"title":"Neural network techniques for scheduling and routing problems in multihop radio networks","authors":"C. M. Barnhart, J. Wieselthier, A. Ephremides","doi":"10.1109/MILCOM.1991.258284","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258284","url":null,"abstract":"The authors address the problem of link activation or scheduling in multihop packet radio networks, a contention-free form of channel access that is appropriate for many military communication applications. This problem, in almost all of its forms, is a combinatorial-optimization problem of high complexity. They approach this problem by the use of a Hopfield neural network model in which the method of Lagrange multipliers is used to dynamically vary the values of the coefficients used in the connection weights. Extensive software simulation results demonstrate the effectiveness of this approach in producing schedules of optimal length. Issues associated with the extension of this approach to the joint routing/scheduling problem are discussed.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131988172","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 : 1991-11-04DOI: 10.1109/MILCOM.1991.258331
T. Vu, S. Risner
Algorithms to perform the network control function for the ground-based elements of the Strategic Defense System (SDS) have been developed and evaluated. The authors compare the analytical and simulation results of two broadcast routing algorithms, namely flood-and-forward routing and constrained flood routing to identify a suitable candidate for routing traffic in a fiber-optic communication network which connects the SDS command center and the distributed ground-based sensor and weapon sites which also host various battle management functions. In addition to the usual performance and cost measures, the packet processing rate required at each relay node is specifically addressed. Realistic packet processing delays are included in the simulation to provide a complete picture of the overall delay statistics.<>
{"title":"Performance and cost of broadcast routing algorithms in the Strategic Defense System terrestrial network","authors":"T. Vu, S. Risner","doi":"10.1109/MILCOM.1991.258331","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258331","url":null,"abstract":"Algorithms to perform the network control function for the ground-based elements of the Strategic Defense System (SDS) have been developed and evaluated. The authors compare the analytical and simulation results of two broadcast routing algorithms, namely flood-and-forward routing and constrained flood routing to identify a suitable candidate for routing traffic in a fiber-optic communication network which connects the SDS command center and the distributed ground-based sensor and weapon sites which also host various battle management functions. In addition to the usual performance and cost measures, the packet processing rate required at each relay node is specifically addressed. Realistic packet processing delays are included in the simulation to provide a complete picture of the overall delay statistics.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133122636","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 : 1991-11-04DOI: 10.1109/MILCOM.1991.258277
L. Garth, R. Vijayan, H. Poor
The nonlinear filter derived by H.V. Poor and R. Vijayan (1988, 1990) is generalized to the case of channels corrupted by impulsive noise. The class of impulsive channels considered includes the Gaussian channel as a special case. The authors exploit the binary nature of the direct-sequence signals to obtain performance using nonlinear filters. A nonlinear modification of the transversal filter, with the coefficients being updated using the least mean square algorithm, is seen to perform significantly better than the standard adaptive linear filter. Further nonlinear modifications of the prediction filters are found for a variety of impulsive channel distribution shapes. It was found that the filters designed for the Gaussian channel perform as well as those tailored to the specific impulsive channels. As a result, the impulsive channels can be approximated by a Gaussian one with no loss in performance.<>
{"title":"A new approach to interference suppression in spread-spectrum systems","authors":"L. Garth, R. Vijayan, H. Poor","doi":"10.1109/MILCOM.1991.258277","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258277","url":null,"abstract":"The nonlinear filter derived by H.V. Poor and R. Vijayan (1988, 1990) is generalized to the case of channels corrupted by impulsive noise. The class of impulsive channels considered includes the Gaussian channel as a special case. The authors exploit the binary nature of the direct-sequence signals to obtain performance using nonlinear filters. A nonlinear modification of the transversal filter, with the coefficients being updated using the least mean square algorithm, is seen to perform significantly better than the standard adaptive linear filter. Further nonlinear modifications of the prediction filters are found for a variety of impulsive channel distribution shapes. It was found that the filters designed for the Gaussian channel perform as well as those tailored to the specific impulsive channels. As a result, the impulsive channels can be approximated by a Gaussian one with no loss in performance.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"366 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125622479","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 : 1991-11-04DOI: 10.1109/MILCOM.1991.258253
D. Lu, J. Baprawski, K. Yao
The authors present an efficient and robust solution to the problem of simulating the bit error rate (BER) performance of digital communication systems with intersymbol interference and nonGaussian noise. BER simulation results are shown for the conventional importance sampling (CIS) and improved importance sampling (IIS) techniques. In each case a bounding technique was applied to ensure that the BER estimates simulated were obtained with a specified estimate variance. The simulation improvement ratio over a direct Monte Carlo approach was derived and showed that the IIS technique gives a constant improvement for any size of system memory length. The CIS technique was shown to have a detrimental dimensionality effect, such that its effectiveness decreases as the system memory length increases.<>
{"title":"BER simulation of digital communication systems with intersymbol interference and non-Gaussian noise using improved importance sampling","authors":"D. Lu, J. Baprawski, K. Yao","doi":"10.1109/MILCOM.1991.258253","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258253","url":null,"abstract":"The authors present an efficient and robust solution to the problem of simulating the bit error rate (BER) performance of digital communication systems with intersymbol interference and nonGaussian noise. BER simulation results are shown for the conventional importance sampling (CIS) and improved importance sampling (IIS) techniques. In each case a bounding technique was applied to ensure that the BER estimates simulated were obtained with a specified estimate variance. The simulation improvement ratio over a direct Monte Carlo approach was derived and showed that the IIS technique gives a constant improvement for any size of system memory length. The CIS technique was shown to have a detrimental dimensionality effect, such that its effectiveness decreases as the system memory length increases.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122446843","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 : 1991-11-04DOI: 10.1109/MILCOM.1991.258274
T. Kasparis, M. Georgiopoulos, E. Payne
The authors concentrate on the problem of interference rejection for the cases of single and multitone jammers. They propose the use of a conditional nonlinear median filter operating in the transform domain, for the detection and suppression of narrowband signals of sufficient power, without regard to their center frequency, bandwidth, or peak power. It is shown that this approach offers several significant advantages over similar techniques that have been used before.<>
{"title":"Non-linear filtering techniques for narrow-band interference rejection in direct sequence spread-spectrum systems","authors":"T. Kasparis, M. Georgiopoulos, E. Payne","doi":"10.1109/MILCOM.1991.258274","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258274","url":null,"abstract":"The authors concentrate on the problem of interference rejection for the cases of single and multitone jammers. They propose the use of a conditional nonlinear median filter operating in the transform domain, for the detection and suppression of narrowband signals of sufficient power, without regard to their center frequency, bandwidth, or peak power. It is shown that this approach offers several significant advantages over similar techniques that have been used before.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122625544","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 : 1991-11-04DOI: 10.1109/MILCOM.1991.258388
R. Price
The US government must make profound changes in the way it approaches information systems security. These changes are further prompted by: (1) rapid technological advances that have virtually eliminated the traditional distinctions between telecommunications and information systems, (2) the move toward commercial off-the-shelf acquisitions, (3) a more complex threat scenario, and (4) an increasingly restrictive fiscal climate. In order to deal with this reality of the 1990s, information systems security must be compatible with, indeed often integrated into, emerging information technology. Add-on security will no longer be sufficient.<>
{"title":"Information systems security enters the 1990s","authors":"R. Price","doi":"10.1109/MILCOM.1991.258388","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258388","url":null,"abstract":"The US government must make profound changes in the way it approaches information systems security. These changes are further prompted by: (1) rapid technological advances that have virtually eliminated the traditional distinctions between telecommunications and information systems, (2) the move toward commercial off-the-shelf acquisitions, (3) a more complex threat scenario, and (4) an increasingly restrictive fiscal climate. In order to deal with this reality of the 1990s, information systems security must be compatible with, indeed often integrated into, emerging information technology. Add-on security will no longer be sufficient.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121348166","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 : 1991-11-04DOI: 10.1109/MILCOM.1991.258436
K. Ferris
The author reviews the state of the art in fiber optic networks, describes several current program/system implementations, and presents a perspective on military fiber optic networks for the 1990s and beyond. Technologies highlighted are fiber optic Ethernets operating at 10 Mb/s, FDDI networking at 100 Mb/s, and advanced 500 Mb/s to 1+ Gb/s networks.<>
{"title":"Applications of fiber optic networks in military communications systems","authors":"K. Ferris","doi":"10.1109/MILCOM.1991.258436","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258436","url":null,"abstract":"The author reviews the state of the art in fiber optic networks, describes several current program/system implementations, and presents a perspective on military fiber optic networks for the 1990s and beyond. Technologies highlighted are fiber optic Ethernets operating at 10 Mb/s, FDDI networking at 100 Mb/s, and advanced 500 Mb/s to 1+ Gb/s networks.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129013495","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 : 1991-11-04DOI: 10.1109/MILCOM.1991.258298
S. Mui
The author examines the use of variable-rate signaling in conjunction with error-correction coding for a meteor burst channel model which assumes that the received signal amplitude decays exponentially. The performance achievable with variable-rate signaling is quantified by calculating the cutoff rate. The average signal-to-noise ratio per bit required to support communications is calculated under the assumption that the code rate is equal to the cutoff rate. It is shown that the improvement of variable-rate signaling over fixed-rate signaling is large if the code rate is moderate to high, and that the improvement is small if the code rate is low and the decoder is provided with side information on the received signal level.<>
{"title":"Variable-rate signalling in conjunction with coding for meteor burst communications","authors":"S. Mui","doi":"10.1109/MILCOM.1991.258298","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258298","url":null,"abstract":"The author examines the use of variable-rate signaling in conjunction with error-correction coding for a meteor burst channel model which assumes that the received signal amplitude decays exponentially. The performance achievable with variable-rate signaling is quantified by calculating the cutoff rate. The average signal-to-noise ratio per bit required to support communications is calculated under the assumption that the code rate is equal to the cutoff rate. It is shown that the improvement of variable-rate signaling over fixed-rate signaling is large if the code rate is moderate to high, and that the improvement is small if the code rate is low and the decoder is provided with side information on the received signal level.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128606851","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 : 1991-11-04DOI: 10.1109/MILCOM.1991.258242
D. Choi, B. Weijers, R. Norris, N. B. Myers
HF auroral backscatter recordings were made using the Verona Ava linear array radar (VALAR) during 1990. The authors present an example of initial results from the analysis of HF data collected during September 1990. The range-azimuth distribution and Doppler characteristics of 2F ground backscatter from the sub-auroral and the auroral F-region were identified and characterized using amplitude-range-azimuth maps and amplitude-range-Doppler maps.<>
{"title":"Preliminary analysis of HF auroral backscatter data observed using Verona Ava linear array radar","authors":"D. Choi, B. Weijers, R. Norris, N. B. Myers","doi":"10.1109/MILCOM.1991.258242","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258242","url":null,"abstract":"HF auroral backscatter recordings were made using the Verona Ava linear array radar (VALAR) during 1990. The authors present an example of initial results from the analysis of HF data collected during September 1990. The range-azimuth distribution and Doppler characteristics of 2F ground backscatter from the sub-auroral and the auroral F-region were identified and characterized using amplitude-range-azimuth maps and amplitude-range-Doppler maps.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116711956","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
扫码关注我们
求助内容：
应助结果提醒方式：