Pub Date : 2001-10-28DOI: 10.1109/MILCOM.2001.986081
Chang Yong Jung, Seokho Yoon, I. Song, Jinsoo Bae, Sun Yong Kim
The sequential estimation (SE) proposed by R.B. Ward (see IEEE Trans. Commun., vol.COM-13, p.474-83, 1965) for rapid acquisition of pseudonoise (PN) sequences works well only at moderate signal-to-noise ratios (SNRs). A seed accumulating sequential estimation (SASE) method based on accumulating seeds of the received PN sequence is proposed, which performs well at low SNR also. The mean acquisition time of the proposed SASE method is derived by the generating function flow graph technique, and correct chip, detection and false alarm probabilities are obtained. Finally, numerical results show that the proposed SASE dramatically performs better than the conventional SE at low SNR and the improvement becomes larger as the period of the PN sequence increases.
{"title":"A novel DS/SS code acquisition technique based on seed accumulation of sequence generator","authors":"Chang Yong Jung, Seokho Yoon, I. Song, Jinsoo Bae, Sun Yong Kim","doi":"10.1109/MILCOM.2001.986081","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.986081","url":null,"abstract":"The sequential estimation (SE) proposed by R.B. Ward (see IEEE Trans. Commun., vol.COM-13, p.474-83, 1965) for rapid acquisition of pseudonoise (PN) sequences works well only at moderate signal-to-noise ratios (SNRs). A seed accumulating sequential estimation (SASE) method based on accumulating seeds of the received PN sequence is proposed, which performs well at low SNR also. The mean acquisition time of the proposed SASE method is derived by the generating function flow graph technique, and correct chip, detection and false alarm probabilities are obtained. Finally, numerical results show that the proposed SASE dramatically performs better than the conventional SE at low SNR and the improvement becomes larger as the period of the PN sequence increases.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127107194","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 : 2001-10-28DOI: 10.1109/MILCOM.2001.985974
A. Sethi, Dong Zhu, Vasil Hnatyshin, Prasanth Kokati
SHAMAN (Spreadsheet-based Hierarchical Architecture for MANagement) is a novel management framework developed at the University of Delaware; it extends the traditional flat SNMP (simple network management protocol) management model to a hierarchical architecture. Effective management of battlefield networks requires such a hierarchical management architecture wherein managers can dynamically delegate management tasks to intermediate managers. The SHAMAN framework includes a spreadsheet-based intermediate manager with a scripting language and MIB (management information base), a polling subsystem and an event model; a prototype implementation of the system is available (see http://www.cis.udel.edu//spl sim/shaman). Our research has explored several applications of the SHAMAN system to tactical battlefield networks for the US Army. Described applications include a location management application, an application to reconfigure the dynamically changing topology of tactical internets, and another application to interface with OPNET simulations of battlefield networks.
{"title":"Battlefield network applications of the SHAMAN management system","authors":"A. Sethi, Dong Zhu, Vasil Hnatyshin, Prasanth Kokati","doi":"10.1109/MILCOM.2001.985974","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985974","url":null,"abstract":"SHAMAN (Spreadsheet-based Hierarchical Architecture for MANagement) is a novel management framework developed at the University of Delaware; it extends the traditional flat SNMP (simple network management protocol) management model to a hierarchical architecture. Effective management of battlefield networks requires such a hierarchical management architecture wherein managers can dynamically delegate management tasks to intermediate managers. The SHAMAN framework includes a spreadsheet-based intermediate manager with a scripting language and MIB (management information base), a polling subsystem and an event model; a prototype implementation of the system is available (see http://www.cis.udel.edu//spl sim/shaman). Our research has explored several applications of the SHAMAN system to tactical battlefield networks for the US Army. Described applications include a location management application, an application to reconfigure the dynamically changing topology of tactical internets, and another application to interface with OPNET simulations of battlefield networks.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127437280","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 : 2001-10-28DOI: 10.1109/MILCOM.2001.985969
V. Galtier, K. Mills, Y. Carlinet, S. Bush, A. Kulkarni
Recent research, such as the active virtual network management prediction (AVNMP) system, aims to use simulation models running ahead of real time to predict resource demand among network nodes. If accurate, such predictions can be used to allocate network capacity and to estimate quality of service. Future deployment of active-network technology promises to complicate prediction algorithms because each "active" message can convey its own processing logic, which introduces variable demand for processor (CPU) cycles. This paper describes a means to augment AVNMP, which predicts message load among active-network nodes, with adaptive models that can predict the CPU time required for each "active" message at any active network node. Typical CPU models cannot adapt to heterogeneity among nodes. This paper shows improvement in AVNMP performance when adaptive CPU models replace more traditional non-adaptive CPU models. Incorporating adaptive CPU models can enable AVNMP to predict active-network resource usage farther into the future, and lowers prediction overhead.
{"title":"Predicting resource demand in heterogeneous active networks","authors":"V. Galtier, K. Mills, Y. Carlinet, S. Bush, A. Kulkarni","doi":"10.1109/MILCOM.2001.985969","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985969","url":null,"abstract":"Recent research, such as the active virtual network management prediction (AVNMP) system, aims to use simulation models running ahead of real time to predict resource demand among network nodes. If accurate, such predictions can be used to allocate network capacity and to estimate quality of service. Future deployment of active-network technology promises to complicate prediction algorithms because each \"active\" message can convey its own processing logic, which introduces variable demand for processor (CPU) cycles. This paper describes a means to augment AVNMP, which predicts message load among active-network nodes, with adaptive models that can predict the CPU time required for each \"active\" message at any active network node. Typical CPU models cannot adapt to heterogeneity among nodes. This paper shows improvement in AVNMP performance when adaptive CPU models replace more traditional non-adaptive CPU models. Incorporating adaptive CPU models can enable AVNMP to predict active-network resource usage farther into the future, and lowers prediction overhead.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127232941","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 : 2001-10-28DOI: 10.1109/MILCOM.2001.985927
J. Mineweaser, J. S. Stadler, S. Tsao, M. Flanagan
Satellite communications systems are an important part of the infrastructure for many commercial and military networks. There is a great deal of interest in seamlessly extending terrestrial IP networks via satellite. Unfortunately, the higher bit error rate (BER) and bandwidth delay product (BDP) of the satellite channel result in low channel utilization and reduced throughput for TCP traffic. The Wireless Networking Testbed at Lincoln Laboratory was developed to evaluate the performance of TCP/IP and potential protocol enhancements under realistic channel conditions. This paper extends the results presented in Stadler et al. (1999) to the land mobile satellite channel using the digital model presented by Lutz and Cygan (1991). The channel model, based on a two-state Markov chain, produces random bit errors under the assumption of Rician (non-blocking) or Rayleigh (blocking) signal statistics. The model parameters include signal-to-noise ratio (SNR), bit rate, velocity, and environment type (i.e., urban, highway, etc.). TCP behavior is characterized for selected values of the channel parameters under a variety of testbed configurations. Test results indicate that fading losses contribute to substantial performance degradation for TCP, even when the selective acknowledgement (SACK) option is enabled. In addition, two protocol enhancement techniques, a link layer protocol and the Wireless IP Suite Enhancer (WISE), are evaluated.
{"title":"Improving TCP/IP performance for the land mobile satellite channel","authors":"J. Mineweaser, J. S. Stadler, S. Tsao, M. Flanagan","doi":"10.1109/MILCOM.2001.985927","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985927","url":null,"abstract":"Satellite communications systems are an important part of the infrastructure for many commercial and military networks. There is a great deal of interest in seamlessly extending terrestrial IP networks via satellite. Unfortunately, the higher bit error rate (BER) and bandwidth delay product (BDP) of the satellite channel result in low channel utilization and reduced throughput for TCP traffic. The Wireless Networking Testbed at Lincoln Laboratory was developed to evaluate the performance of TCP/IP and potential protocol enhancements under realistic channel conditions. This paper extends the results presented in Stadler et al. (1999) to the land mobile satellite channel using the digital model presented by Lutz and Cygan (1991). The channel model, based on a two-state Markov chain, produces random bit errors under the assumption of Rician (non-blocking) or Rayleigh (blocking) signal statistics. The model parameters include signal-to-noise ratio (SNR), bit rate, velocity, and environment type (i.e., urban, highway, etc.). TCP behavior is characterized for selected values of the channel parameters under a variety of testbed configurations. Test results indicate that fading losses contribute to substantial performance degradation for TCP, even when the selective acknowledgement (SACK) option is enabled. In addition, two protocol enhancement techniques, a link layer protocol and the Wireless IP Suite Enhancer (WISE), are evaluated.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130083236","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 : 2001-10-28DOI: 10.1109/MILCOM.2001.985958
D. Thuente, J. K. Whiteman
Media access control (MAC) algorithms have been shown to be critical components in the overall efficiency of military radio communication networks. Many papers at the three most recent MILCOM conferences have focused on combat net radios or ML-STD-188-220B. Several of these compared different MAC algorithms for data only and data and voice networks. The MAC algorithm with the best performance characteristics for a wide class of moderately sized networks appears to be deterministic adaptable priority network access delay (DAP-NAD). The DAP-NAD algorithm can be viewed as a modified implicit token passing algorithm. This paper presents a number of significant extensions and modifications to DAP-NAD, including efficient integration of data and voice. The token passing scheme is modified so that the token effectively jumps over stations that may have transmitted in the last period and allows heavily used nodes or "higher priority nodes" to have increased transmission opportunities. These modifications are shown to have markedly improved performance for the standard tactical Internet division and below (TIDB) network used to compare other MAC algorithms as well as on 16 node randomly loaded networks. Our modifications to DAP-NAD have further enhanced its ability to handle both data and voice efficiently, which is recognized by calling the MAC algorithm data and voice network access delay (DAV-NAD).
媒体访问控制（MAC）算法已被证明是军用无线电通信网络整体效率的关键组成部分。在最近举行的三次 MILCOM 会议上，许多论文都集中讨论了作战网络无线电或 ML-STD-188-220B。其中几篇论文比较了仅用于数据网络和数据与语音网络的不同 MAC 算法。对于各种中等规模的网络而言，具有最佳性能特征的 MAC 算法似乎是确定性自适应优先网络接入延迟（DAP-NAD）。DAP-NAD 算法可视为一种改进的隐式令牌传递算法。本文对 DAP-NAD 进行了一系列重大扩展和修改，包括数据和语音的有效整合。令牌传递方案经修改后，令牌可有效跳过上一时期可能已传输的站点，并允许使用率高的节点或 "优先级较高的节点 "获得更多传输机会。在用于比较其他 MAC 算法的标准战术互联网分区及以下（TIDB）网络以及 16 节点随机加载网络中，这些修改都明显提高了性能。我们对 DAP-NAD 所做的修改进一步增强了其高效处理数据和语音的能力，我们将这种 MAC 算法称为数据和语音网络接入延迟 (DAV-NAD)。
{"title":"Modified CSMA/implicit token passing algorithm for MIL-STD-188-220B","authors":"D. Thuente, J. K. Whiteman","doi":"10.1109/MILCOM.2001.985958","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985958","url":null,"abstract":"Media access control (MAC) algorithms have been shown to be critical components in the overall efficiency of military radio communication networks. Many papers at the three most recent MILCOM conferences have focused on combat net radios or ML-STD-188-220B. Several of these compared different MAC algorithms for data only and data and voice networks. The MAC algorithm with the best performance characteristics for a wide class of moderately sized networks appears to be deterministic adaptable priority network access delay (DAP-NAD). The DAP-NAD algorithm can be viewed as a modified implicit token passing algorithm. This paper presents a number of significant extensions and modifications to DAP-NAD, including efficient integration of data and voice. The token passing scheme is modified so that the token effectively jumps over stations that may have transmitted in the last period and allows heavily used nodes or \"higher priority nodes\" to have increased transmission opportunities. These modifications are shown to have markedly improved performance for the standard tactical Internet division and below (TIDB) network used to compare other MAC algorithms as well as on 16 node randomly loaded networks. Our modifications to DAP-NAD have further enhanced its ability to handle both data and voice efficiently, which is recognized by calling the MAC algorithm data and voice network access delay (DAV-NAD).","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131053244","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 : 2001-10-28DOI: 10.1109/MILCOM.2001.986064
Zhiqiang Liu, G. Giannakis
In the spirit of BLAST systems, this paper proposes a novel layered space-time (ST) coding scheme. By slicing the two-dimensional ST code into a stack of one-dimensional so-called layer codes, ST coding and decoding are performed in a layer by layer fashion. Because different layers are transmitted independently, the proposed scheme is capable of supporting considerably higher transmission rates than (non-layered) ST coding. In addition to retaining most advantages of BLAST systems, the proposed scheme offers additional flexibility and superior performance that is confirmed by simulations.
{"title":"Layered space-time coding for high data rate transmissions","authors":"Zhiqiang Liu, G. Giannakis","doi":"10.1109/MILCOM.2001.986064","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.986064","url":null,"abstract":"In the spirit of BLAST systems, this paper proposes a novel layered space-time (ST) coding scheme. By slicing the two-dimensional ST code into a stack of one-dimensional so-called layer codes, ST coding and decoding are performed in a layer by layer fashion. Because different layers are transmitted independently, the proposed scheme is capable of supporting considerably higher transmission rates than (non-layered) ST coding. In addition to retaining most advantages of BLAST systems, the proposed scheme offers additional flexibility and superior performance that is confirmed by simulations.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130212468","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 : 2001-10-28DOI: 10.1109/MILCOM.2001.985989
Xiaopeng Ma, E. Lloyd
In Ma and Lloyd (1998) we introduced a fully distributed algorithm (FDAS) for broadcast scheduling in multihop packet radio networks. In this paper we analyze the performance of that algorithm relative to non distributed broadcast scheduling algorithms and to a random access method. Both analytical and simulation results are presented. These analyses establish that FDAS has superior throughput and medium access delay performance at both the node and system levels.
{"title":"Evaluation of a distributed broadcast scheduling protocol for multihop radio networks","authors":"Xiaopeng Ma, E. Lloyd","doi":"10.1109/MILCOM.2001.985989","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985989","url":null,"abstract":"In Ma and Lloyd (1998) we introduced a fully distributed algorithm (FDAS) for broadcast scheduling in multihop packet radio networks. In this paper we analyze the performance of that algorithm relative to non distributed broadcast scheduling algorithms and to a random access method. Both analytical and simulation results are presented. These analyses establish that FDAS has superior throughput and medium access delay performance at both the node and system levels.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125360129","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 : 2001-10-28DOI: 10.1109/MILCOM.2001.986095
Yongxing Jia, Ming Chen
This paper focuses on providing end-to-end multiple quality of service (QoS) in the Differentiated Services (DiffServ) network, including guaranteed services, assured services and best-effort services. We propose a new architecture that can not only provide coarse grain QoS, but also guarantee end-to-end QoS for premium service without per-flow state management at core routers under the DiffServ architecture. In order to accomplish it, we develop a signaling protocol to help to select the route satisfying the end-to-end QoS requirements and reserve resources for each the flow when a session is initiated. A new mechanism is proposed to make packets of each flow keep the same route. Meanwhile packets belonging to the other classes of service are still in normal DiffServ. Bandwidth broker (BB) is introduced to allocate the resources in an autonomous domain and between them. We also give a simple discussion of our architecture and some consideration of the decentralized implementation of BB.
{"title":"A new architecture of providing end-to-end quality-of-service for Differentiated Services network","authors":"Yongxing Jia, Ming Chen","doi":"10.1109/MILCOM.2001.986095","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.986095","url":null,"abstract":"This paper focuses on providing end-to-end multiple quality of service (QoS) in the Differentiated Services (DiffServ) network, including guaranteed services, assured services and best-effort services. We propose a new architecture that can not only provide coarse grain QoS, but also guarantee end-to-end QoS for premium service without per-flow state management at core routers under the DiffServ architecture. In order to accomplish it, we develop a signaling protocol to help to select the route satisfying the end-to-end QoS requirements and reserve resources for each the flow when a session is initiated. A new mechanism is proposed to make packets of each flow keep the same route. Meanwhile packets belonging to the other classes of service are still in normal DiffServ. Bandwidth broker (BB) is introduced to allocate the resources in an autonomous domain and between them. We also give a simple discussion of our architecture and some consideration of the decentralized implementation of BB.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121440293","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 : 2001-10-28DOI: 10.1109/MILCOM.2001.985877
Gary Buda, Booz Allen, Linthicum Hamilton, Don Choi, R. Graveman, Chris Kubic
This paper presents an overview of requirements and issues related to improving the infrastructure security of the global information grid (GIG). The context for "hardening" this infrastructure is to develop commercial standards that encourage products to support the GIG. Candidate infrastructure services for such hardening include signaling, routing, management, naming, and service location. The commercial standards of interest for GIG include certain relevant technologies at different stages of maturity, such as, asynchronous transfer mode (ATM), multiprotocol label switching (MPLS), and optical networking. This paper also describes the Department of Defense (DoD) activities aimed toward defining security requirements and standards for hardening of switches and routers that implement these same networking technologies.
本文概述了与提高全球信息网格(GIG)基础设施安全性相关的需求和问题。“强化”此基础设施的上下文是开发鼓励产品支持GIG的商业标准。这种加固的候选基础设施服务包括信令、路由、管理、命名和服务位置。GIG关注的商业标准包括一些处于不同成熟阶段的相关技术，如ATM (asynchronous transfer mode)、MPLS (multiprotocol label switching)、光网络等。本文还描述了国防部(DoD)旨在定义安全需求和标准的活动，以强化实现这些相同网络技术的交换机和路由器。
{"title":"Security standards for the global information grid","authors":"Gary Buda, Booz Allen, Linthicum Hamilton, Don Choi, R. Graveman, Chris Kubic","doi":"10.1109/MILCOM.2001.985877","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985877","url":null,"abstract":"This paper presents an overview of requirements and issues related to improving the infrastructure security of the global information grid (GIG). The context for \"hardening\" this infrastructure is to develop commercial standards that encourage products to support the GIG. Candidate infrastructure services for such hardening include signaling, routing, management, naming, and service location. The commercial standards of interest for GIG include certain relevant technologies at different stages of maturity, such as, asynchronous transfer mode (ATM), multiprotocol label switching (MPLS), and optical networking. This paper also describes the Department of Defense (DoD) activities aimed toward defining security requirements and standards for hardening of switches and routers that implement these same networking technologies.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122976904","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 : 2001-10-28DOI: 10.1109/MILCOM.2001.986062
Zhong Ye, E. Satorius, V. Vilnrotter, T. Pham, D. Fort
Various arraying techniques are studied focusing on the very low received signal SNR channel conditions commonly found in deep space communications applications. These include correlation-based blind approaches as well as a sub-space based superresolution approach. In addition to weak received signals, atmospheric turbulence and spatially correlated interference from nearby planets (and possibly quasars) creates additional channel impairment. It is demonstrated that the sub-space based MUSIC algorithm is a strong candidate for this application that can provide great angle separation accuracy and interference suppression capability. Adaptive beamforming techniques in combination with the MUSIC algorithm provide a flexible platform to combat channel impairment.
{"title":"Large antenna array techniques for very low SNR channels","authors":"Zhong Ye, E. Satorius, V. Vilnrotter, T. Pham, D. Fort","doi":"10.1109/MILCOM.2001.986062","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.986062","url":null,"abstract":"Various arraying techniques are studied focusing on the very low received signal SNR channel conditions commonly found in deep space communications applications. These include correlation-based blind approaches as well as a sub-space based superresolution approach. In addition to weak received signals, atmospheric turbulence and spatially correlated interference from nearby planets (and possibly quasars) creates additional channel impairment. It is demonstrated that the sub-space based MUSIC algorithm is a strong candidate for this application that can provide great angle separation accuracy and interference suppression capability. Adaptive beamforming techniques in combination with the MUSIC algorithm provide a flexible platform to combat channel impairment.","PeriodicalId":136537,"journal":{"name":"2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2001-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123043721","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
扫码关注我们
求助内容：
应助结果提醒方式：