Pub Date : 2005-10-17DOI: 10.1109/MILCOM.2005.1605938
Kari Pietikäinen, A. Silvennoinen, M. Hall, S. Häggman
In this paper, the operation of an IEEE 802.11g wireless local area network (WLAN) system under the influence of narrowband interference is investigated. The IEEE 802.11g WLAN is defined to operate in the 2.4 GHz license free frequency band. Three different WLAN interface cards with different transceiver chipsets is were evaluated in laboratory environment. The performance was measured in a packet error rate as a function of signal to jamming ratio. The results show that narrow-band interference has a significant impact on the performance of an OFDM based system. It is possible to deteriorate the connection even with relatively low interfering signal power levels for some of the vendor cards. The interfered subchannel choice has an influence on the effectiveness of the jamming
{"title":"IEEE 802.11g tolerance to narrowband jamming","authors":"Kari Pietikäinen, A. Silvennoinen, M. Hall, S. Häggman","doi":"10.1109/MILCOM.2005.1605938","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605938","url":null,"abstract":"In this paper, the operation of an IEEE 802.11g wireless local area network (WLAN) system under the influence of narrowband interference is investigated. The IEEE 802.11g WLAN is defined to operate in the 2.4 GHz license free frequency band. Three different WLAN interface cards with different transceiver chipsets is were evaluated in laboratory environment. The performance was measured in a packet error rate as a function of signal to jamming ratio. The results show that narrow-band interference has a significant impact on the performance of an OFDM based system. It is possible to deteriorate the connection even with relatively low interfering signal power levels for some of the vendor cards. The interfered subchannel choice has an influence on the effectiveness of the jamming","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114687278","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1606034
Dongsook Kim, Chih-fan Hsin, M. Liu
In this paper we study the asymptotic connectivity of a low duty-cycled wireless sensor network, where all sensors are randomly duty-cycled such that they are on/active at any time with a fixed probability. A wireless network is often said to be asymptotically connected if there exists a path from every node to every other node in the network with high probability as the network density approaches infinity. Within the context of a low duty-cycled wireless sensor network, the network is said to be asymptotically connected if for all realizations of the random duty-cycling (i.e., the combination of on and off nodes) there exists a path of active nodes from every node to every other node in the network with high probability as the network density approaches infinity. With this definition, we derive conditions under which a low duty-cycled sensor network is asymptotically connected. These conditions essentially specify how the nodes' communication range and the duty-cycling probability should scale as the network grows in order to maintain connectivity
{"title":"Asymptotic connectivity of low duty-cycled wireless sensor networks","authors":"Dongsook Kim, Chih-fan Hsin, M. Liu","doi":"10.1109/MILCOM.2005.1606034","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606034","url":null,"abstract":"In this paper we study the asymptotic connectivity of a low duty-cycled wireless sensor network, where all sensors are randomly duty-cycled such that they are on/active at any time with a fixed probability. A wireless network is often said to be asymptotically connected if there exists a path from every node to every other node in the network with high probability as the network density approaches infinity. Within the context of a low duty-cycled wireless sensor network, the network is said to be asymptotically connected if for all realizations of the random duty-cycling (i.e., the combination of on and off nodes) there exists a path of active nodes from every node to every other node in the network with high probability as the network density approaches infinity. With this definition, we derive conditions under which a low duty-cycled sensor network is asymptotically connected. These conditions essentially specify how the nodes' communication range and the duty-cycling probability should scale as the network grows in order to maintain connectivity","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124059794","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605843
K. Zeng, K. Ren, W. Lou
Multipath routing in ad hoc networks is a challenging problem. In this paper, we present a new approach to the problem of finding multiple disjoint paths (both edge-disjoint and node-disjoint) in ad hoc networks. Most existing multipath routing protocols are based on AODV or DSR and compute multiple paths with a single route discovery process via a network-wide flooding, which takes a substantial amount of network bandwidth. When node's geographic information is available, routing discovery flooding can be substituted by unicasts and then the routing overhead can be reduced. We propose a Geography based Ad hoc On demand Disjoint Multipath (GAODM) routing protocol in wireless ad hoc networks. Our protocol combines the idea behind the distributed push-relabel algorithm in a flow network with nodes' geographic information in the ad hoc networks. Instead of a blind flooding, an informed and independent unicast decision is made by each node so that the traffic flow for the route discovery is efficiently directed towards the destination. We compare our protocols with AODV and AOMDV. The simulation result shows that 1) GAODM has better ability of finding more disjoint paths than AOMDV, especially when nodes are further apart; 2) GAODM finds shorter paths (in terms of hop count) than AODV and AOMDV due to the use of nodes' geographic information; 3) GAODM incurs much less route discovery overhead than AODV and AOMDV because of the substitution of unicasts for blind flooding.
{"title":"Geographic On-Demand Disjoint Multipath Routing in Wireless Ad Hoc Networks","authors":"K. Zeng, K. Ren, W. Lou","doi":"10.1109/MILCOM.2005.1605843","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605843","url":null,"abstract":"Multipath routing in ad hoc networks is a challenging problem. In this paper, we present a new approach to the problem of finding multiple disjoint paths (both edge-disjoint and node-disjoint) in ad hoc networks. Most existing multipath routing protocols are based on AODV or DSR and compute multiple paths with a single route discovery process via a network-wide flooding, which takes a substantial amount of network bandwidth. When node's geographic information is available, routing discovery flooding can be substituted by unicasts and then the routing overhead can be reduced. We propose a Geography based Ad hoc On demand Disjoint Multipath (GAODM) routing protocol in wireless ad hoc networks. Our protocol combines the idea behind the distributed push-relabel algorithm in a flow network with nodes' geographic information in the ad hoc networks. Instead of a blind flooding, an informed and independent unicast decision is made by each node so that the traffic flow for the route discovery is efficiently directed towards the destination. We compare our protocols with AODV and AOMDV. The simulation result shows that 1) GAODM has better ability of finding more disjoint paths than AOMDV, especially when nodes are further apart; 2) GAODM finds shorter paths (in terms of hop count) than AODV and AOMDV due to the use of nodes' geographic information; 3) GAODM incurs much less route discovery overhead than AODV and AOMDV because of the substitution of unicasts for blind flooding.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124150787","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1606087
S. Kartalopoulos
The last two decades have witnessed an exciting advanced research field that stems from non-classical atomic theory, the quantum mechanics. This research promises an interesting applicability in computation, known as quantum computation, and also in secure data communications, known as quantum cryptography. Quantum cryptography capitalizes on the inherent random polarization state of single photons, which are associated with binary logic values. Because the polarization state of a photon is not reproducible by an eavesdropper between the source and the destination, polarized photons are used with an intelligent algorithm to disseminate the cryptographic key with high security from the source to the destination, a process known as quantum key distribution. However, although the polarization state of a photon remains intact in free-space propagation, it does not remain so in dielectric medium and thus quantum cryptography is not problem-free. In this paper we review quantum cryptography and we identify the various steps in the quantum key identification process. We then analyze and discuss issues related to quantum key distribution that rise in pragmatic fiber-optic transmission and in communication network topologies. In addition, we identify a major weakness of the method that is prone to attacking and which incapacitates quantum cryptography in fiber communications.
{"title":"Identifying vulnerabilities of quantum cryptography in secure optical data transport","authors":"S. Kartalopoulos","doi":"10.1109/MILCOM.2005.1606087","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606087","url":null,"abstract":"The last two decades have witnessed an exciting advanced research field that stems from non-classical atomic theory, the quantum mechanics. This research promises an interesting applicability in computation, known as quantum computation, and also in secure data communications, known as quantum cryptography. Quantum cryptography capitalizes on the inherent random polarization state of single photons, which are associated with binary logic values. Because the polarization state of a photon is not reproducible by an eavesdropper between the source and the destination, polarized photons are used with an intelligent algorithm to disseminate the cryptographic key with high security from the source to the destination, a process known as quantum key distribution. However, although the polarization state of a photon remains intact in free-space propagation, it does not remain so in dielectric medium and thus quantum cryptography is not problem-free. In this paper we review quantum cryptography and we identify the various steps in the quantum key identification process. We then analyze and discuss issues related to quantum key distribution that rise in pragmatic fiber-optic transmission and in communication network topologies. In addition, we identify a major weakness of the method that is prone to attacking and which incapacitates quantum cryptography in fiber communications.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127714957","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605820
Xinrong Li
Most sensors are event-driven and wireless sensor networks are mostly used for monitoring purposes in environmental monitoring, structural monitoring, and military battleground and public safety applications. As a result, there is a need to quickly and accurately pin-point a sensor's location when it detects an emergent event. Since sensor networks are severely resource-constrained due to various physical and environmental constraints, including miniature size, limited battery power, and limited communicational and computational capacity, a low-complexity location estimation technique is needed. Several received-signal-strength (RSS) based techniques have been proposed as a low-cost, low-complexity solution for location estimation in wireless sensor networks, including the basic RSS location estimator and the RSS-UDPG location estimator in our earlier study, which jointly estimates location coordinates and the parameter of channel model, i.e., the distance-power gradient. In this paper we present a comparative study of these two location estimators based on computer simulations. It is shown that when the channel model is assumed known a priori, the two estimators have comparable performance, but RSS-UDPG is strongly preferred when the prior estimate of the channel model is inaccurate or when the channel characteristics tend to change, either accidentally or seasonally
{"title":"Performance study of RSS-based location estimation techniques for wireless sensor networks","authors":"Xinrong Li","doi":"10.1109/MILCOM.2005.1605820","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605820","url":null,"abstract":"Most sensors are event-driven and wireless sensor networks are mostly used for monitoring purposes in environmental monitoring, structural monitoring, and military battleground and public safety applications. As a result, there is a need to quickly and accurately pin-point a sensor's location when it detects an emergent event. Since sensor networks are severely resource-constrained due to various physical and environmental constraints, including miniature size, limited battery power, and limited communicational and computational capacity, a low-complexity location estimation technique is needed. Several received-signal-strength (RSS) based techniques have been proposed as a low-cost, low-complexity solution for location estimation in wireless sensor networks, including the basic RSS location estimator and the RSS-UDPG location estimator in our earlier study, which jointly estimates location coordinates and the parameter of channel model, i.e., the distance-power gradient. In this paper we present a comparative study of these two location estimators based on computer simulations. It is shown that when the channel model is assumed known a priori, the two estimators have comparable performance, but RSS-UDPG is strongly preferred when the prior estimate of the channel model is inaccurate or when the channel characteristics tend to change, either accidentally or seasonally","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126462211","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1606148
S. Cheng, M. Valenti, D. Torrieri
This paper considers the problem of communicating over fast fading channels, where the channel coherence time is only on the order of a few symbols. Since the fading is too fast for coherent reception, we employ M-ary frequency shift keying with soft noncoherent demodulation. Information is encoded by a binary turbo code. To improve performance, the soft demodulator and decoder work cooperatively through the iterative exchange of extrinsic information. During each iteration, the receiver estimates the channel state information (CSI), here defined to be the average received signal energy and noise spectral density for each block of symbols. The channel estimator uses the expectation maximization (EM) algorithm and exploits extrinsic information fed from the decoder. Simulation results show that for 16-NFSK in block independent Rayleigh fading, performance can be within 0.6 dB of the perfect CSI case by using blocks as small as 4 symbols.
{"title":"Turbo-NFSK: iterative estimation, noncoherent demodulation, and decoding for fast fading channels","authors":"S. Cheng, M. Valenti, D. Torrieri","doi":"10.1109/MILCOM.2005.1606148","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606148","url":null,"abstract":"This paper considers the problem of communicating over fast fading channels, where the channel coherence time is only on the order of a few symbols. Since the fading is too fast for coherent reception, we employ M-ary frequency shift keying with soft noncoherent demodulation. Information is encoded by a binary turbo code. To improve performance, the soft demodulator and decoder work cooperatively through the iterative exchange of extrinsic information. During each iteration, the receiver estimates the channel state information (CSI), here defined to be the average received signal energy and noise spectral density for each block of symbols. The channel estimator uses the expectation maximization (EM) algorithm and exploits extrinsic information fed from the decoder. Simulation results show that for 16-NFSK in block independent Rayleigh fading, performance can be within 0.6 dB of the perfect CSI case by using blocks as small as 4 symbols.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128143087","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605876
S. V. Vanjari, J. Krogmeier, Mark R. Bell
Radar imaging is a powerful tool in remote sensing due to its ability to image vast areas with high resolution. However, the ability to sense a particular parameter depends on the extent to which the parameter affects the reflected microwave radiation. In this respect, multi-functional sensor nodes offer an immense potential to sense environmental parameters which cannot be directly sensed by radar imaging techniques. With this motivation, we develop techniques to collect information at an air-borne radar from a large group of sensor nodes. Back-scatter modulation is used on the sensors. The techniques utilize synthetic aperture radar (SAR) processing to resolve responses from multiple sensors and to simultaneously obtain a geographic map of the sensor locations. Sensor and clutter returns are separated by utilizing the ability of the sensors to modulate the radar return. The sensor modulation is structured such that sensor and clutter returns can be separated in the spatial frequency domain
{"title":"Information extraction from sensor nodes using air-borne radar and back-scatter modulation","authors":"S. V. Vanjari, J. Krogmeier, Mark R. Bell","doi":"10.1109/MILCOM.2005.1605876","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605876","url":null,"abstract":"Radar imaging is a powerful tool in remote sensing due to its ability to image vast areas with high resolution. However, the ability to sense a particular parameter depends on the extent to which the parameter affects the reflected microwave radiation. In this respect, multi-functional sensor nodes offer an immense potential to sense environmental parameters which cannot be directly sensed by radar imaging techniques. With this motivation, we develop techniques to collect information at an air-borne radar from a large group of sensor nodes. Back-scatter modulation is used on the sensors. The techniques utilize synthetic aperture radar (SAR) processing to resolve responses from multiple sensors and to simultaneously obtain a geographic map of the sensor locations. Sensor and clutter returns are separated by utilizing the ability of the sensors to modulate the radar return. The sensor modulation is structured such that sensor and clutter returns can be separated in the spatial frequency domain","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125484716","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1606109
P. Verma, D. Verma
The emergency alert system available on television and radio media provides an effective means for dissipating information to the general population during emergencies. Demographic studies in the United States have shown an increasing trend towards the use of Internet by general population, and point to the fact that increased Internet usage is associated with decreased time on television and radio. Since there is no equivalent of the TV and radio emergency alert system on the Internet, a significant fraction of the population may be left without prompt information in the case of an emergency. In this paper, we explore the various options for designing an emergency alert system for users in Internet. We address the operational and technical challenges associated with each option, present alternative designs for an Internet emergency alert system, and compare the relative merits of the different approaches.
{"title":"Internet emergency alert system","authors":"P. Verma, D. Verma","doi":"10.1109/MILCOM.2005.1606109","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606109","url":null,"abstract":"The emergency alert system available on television and radio media provides an effective means for dissipating information to the general population during emergencies. Demographic studies in the United States have shown an increasing trend towards the use of Internet by general population, and point to the fact that increased Internet usage is associated with decreased time on television and radio. Since there is no equivalent of the TV and radio emergency alert system on the Internet, a significant fraction of the population may be left without prompt information in the case of an emergency. In this paper, we explore the various options for designing an emergency alert system for users in Internet. We address the operational and technical challenges associated with each option, present alternative designs for an Internet emergency alert system, and compare the relative merits of the different approaches.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125625663","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1605921
P. Bocon, T. McGree, J. Renfro
The initiative to reduce military platform signature has encouraged the consideration of phased arrays as viable alternatives to traditional reflector-based communication antennas. Phased arrays enhance a military platform's mission effectiveness not only by providing reduced radar cross section (RCS) relative to reflector-based implementations, but also by adding increased flexibility via simultaneous multi-beam operation, increased mean time between failure (MTBF), and increased operational availability resulting from graceful degradation. This paper discusses phased array antenna principles with respect to military communication system applications. Specifically, consideration of phased array antenna performance parameters as they relate to existing governing standards for satellite communications is explored. These standards implicitly assume a scan invariant reflector-based implementation. Examples of scan dependent phased array antenna performance parameters include antenna gain, sidelobes, cross-polarization isolation and instantaneous bandwidth. Performance versus implementation complexity with respect to these parameters is discussed
{"title":"Phased array performance characteristics and compliance with SATCOM military standards","authors":"P. Bocon, T. McGree, J. Renfro","doi":"10.1109/MILCOM.2005.1605921","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605921","url":null,"abstract":"The initiative to reduce military platform signature has encouraged the consideration of phased arrays as viable alternatives to traditional reflector-based communication antennas. Phased arrays enhance a military platform's mission effectiveness not only by providing reduced radar cross section (RCS) relative to reflector-based implementations, but also by adding increased flexibility via simultaneous multi-beam operation, increased mean time between failure (MTBF), and increased operational availability resulting from graceful degradation. This paper discusses phased array antenna principles with respect to military communication system applications. Specifically, consideration of phased array antenna performance parameters as they relate to existing governing standards for satellite communications is explored. These standards implicitly assume a scan invariant reflector-based implementation. Examples of scan dependent phased array antenna performance parameters include antenna gain, sidelobes, cross-polarization isolation and instantaneous bandwidth. Performance versus implementation complexity with respect to these parameters is discussed","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121453783","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 : 2005-10-17DOI: 10.1109/MILCOM.2005.1606074
J. Capulli, J. Pio, B. Burson, J. Dingess, D. Enriquez, D. Long
The Navy's Mobile User Objective System (MUOS) program is the next-generation UHF satellite communications system for the US Department of Defense. General Dynamics and Ericsson Inc. (as part of the Lockheed Martin (LM) team) has-for the Component Advanced Development (CAD) phase of the program-installed a 3G (third generation) cellular "trial system", that was used as a testbed for demonstrations of MUOS communications services. To support the MUOS communication demonstrations, a global telecommunications network was constructed interconnecting several system nodes in the continental United States, as well as the global DSN (defense switched network), PSTN and two satellite systems. The heart of the system resides in Scottsdale, Arizona, and consists of two trailers that contain the core network (CN) and radio access network (RAN) of the "trial system". Three radio base stations (RJBS) were connected to the radio network controller (RNC) in the RAN to allow users to communicate wirelessly and securely through the cellular system to other wireless users, DSN phones, PSTN phones, Navy legacy communication systems, public internet, plus public and private servers. The Lockheed-Martin/General Dynamics Team won this competition, and has recently completed the integrated baseline review. The team is now working on implementing the MUOS Program.
{"title":"MUOS communications infrastructure demonstration network and encryption-based applications","authors":"J. Capulli, J. Pio, B. Burson, J. Dingess, D. Enriquez, D. Long","doi":"10.1109/MILCOM.2005.1606074","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606074","url":null,"abstract":"The Navy's Mobile User Objective System (MUOS) program is the next-generation UHF satellite communications system for the US Department of Defense. General Dynamics and Ericsson Inc. (as part of the Lockheed Martin (LM) team) has-for the Component Advanced Development (CAD) phase of the program-installed a 3G (third generation) cellular \"trial system\", that was used as a testbed for demonstrations of MUOS communications services. To support the MUOS communication demonstrations, a global telecommunications network was constructed interconnecting several system nodes in the continental United States, as well as the global DSN (defense switched network), PSTN and two satellite systems. The heart of the system resides in Scottsdale, Arizona, and consists of two trailers that contain the core network (CN) and radio access network (RAN) of the \"trial system\". Three radio base stations (RJBS) were connected to the radio network controller (RNC) in the RAN to allow users to communicate wirelessly and securely through the cellular system to other wireless users, DSN phones, PSTN phones, Navy legacy communication systems, public internet, plus public and private servers. The Lockheed-Martin/General Dynamics Team won this competition, and has recently completed the integrated baseline review. The team is now working on implementing the MUOS Program.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121777090","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
扫码关注我们
求助内容：
应助结果提醒方式：