Pub Date : 2005-10-17DOI: 10.1109/MILCOM.2005.1605653
G. Elmasry, C. J. McCann
This paper presents a QoS solution for tactical networks with security consideration. Since encryption prevents the exchange of QoS information between the cipher text side and the plain text side, a partitioned QoS approach is presented. We present measurement based admission control (MBAC) as part of the plain text side QoS solution. MBAC uses real time measurements to regulate the flow of traffic entering a tactical core network based on a computed end-to-end congestion level. This paper discusses the benefits of using MBAC and the possible challenges of such an approach. The paper shows how the measurements can be used to create a Markov chain indicating the severity of path congestion. The paper also presents some simulation results from implementing MBAC in an OPNET model of the warfighter information network-tactical (WIN-T) network
{"title":"Partitioned QoS solution for tactical networks - addressing the of encryption","authors":"G. Elmasry, C. J. McCann","doi":"10.1109/MILCOM.2005.1605653","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605653","url":null,"abstract":"This paper presents a QoS solution for tactical networks with security consideration. Since encryption prevents the exchange of QoS information between the cipher text side and the plain text side, a partitioned QoS approach is presented. We present measurement based admission control (MBAC) as part of the plain text side QoS solution. MBAC uses real time measurements to regulate the flow of traffic entering a tactical core network based on a computed end-to-end congestion level. This paper discusses the benefits of using MBAC and the possible challenges of such an approach. The paper shows how the measurements can be used to create a Markov chain indicating the severity of path congestion. The paper also presents some simulation results from implementing MBAC in an OPNET model of the warfighter information network-tactical (WIN-T) network","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"19 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":"124871665","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.1606163
S. Shambayati, C. Jones, D. Divsalar
A hybrid forward error correction (FEC)/automatic repeat request (ARQ) has been considered as a mechanism for providing reliable communication between NASA orbiters and landers at the planet Mars. On such a link it is proposed to use a family of capacity achieving LDPC channel codes for FEC and go-back-N protocols for ARQ. In this paper, we analyze such a system and derive equations for its performance. We then use these equations to optimize the performance of the link in terms of information throughput subject to limitations on maximum channel baud rate and spacecraft power and select the best channel code and packet size accordingly at different link path lengths. In this optimization, first the frame error rate of the channel code is expressed in terms of a simple exponential function of the transmitted bit signal-to-noise ratio (Eb/N0), obtained through curve-fitting. Then the standard throughput equation for the go-back-N protocol in terms of the channel codes frame error rate is derived. Next, using the equations for the throughput and the frame error rate, the received Eb/N0 is calculated as a function of transmitted Eb/N0. By minimizing this function, the throughput of the system is maximized for a given available spacecraft power. In the course of this optimization, we quantify the advantage afforded by a system that supports a set of possible code rates and bandwidths as opposed to a system that uses a single rate at different link path lengths.
{"title":"Maximizing throughput for satellite communication in a hybrid FEC/ARQ scheme using LDPC codes","authors":"S. Shambayati, C. Jones, D. Divsalar","doi":"10.1109/MILCOM.2005.1606163","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606163","url":null,"abstract":"A hybrid forward error correction (FEC)/automatic repeat request (ARQ) has been considered as a mechanism for providing reliable communication between NASA orbiters and landers at the planet Mars. On such a link it is proposed to use a family of capacity achieving LDPC channel codes for FEC and go-back-N protocols for ARQ. In this paper, we analyze such a system and derive equations for its performance. We then use these equations to optimize the performance of the link in terms of information throughput subject to limitations on maximum channel baud rate and spacecraft power and select the best channel code and packet size accordingly at different link path lengths. In this optimization, first the frame error rate of the channel code is expressed in terms of a simple exponential function of the transmitted bit signal-to-noise ratio (Eb/N0), obtained through curve-fitting. Then the standard throughput equation for the go-back-N protocol in terms of the channel codes frame error rate is derived. Next, using the equations for the throughput and the frame error rate, the received Eb/N0 is calculated as a function of transmitted Eb/N0. By minimizing this function, the throughput of the system is maximized for a given available spacecraft power. In the course of this optimization, we quantify the advantage afforded by a system that supports a set of possible code rates and bandwidths as opposed to a system that uses a single rate at different link path lengths.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"185 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":"126783863","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.1605667
L. Gatani, G. Re, M. Ortolani
This paper proposes a distributed multi-agent architecture for wireless sensor networks management, which exploits the dynamic reasoning capabilities of the situation calculus in order to emulate the reactive behavior of a human expert to fault situations. The information related to network events is generated by tunable agents installed on the network nodes and is collected by a logical entity for network managing where it is merged with general domain knowledge, with the aim of identifying the root causes of faults, and deciding on reparative actions. The logical inference system has being devised to carry out automated isolation, diagnosis, and, whenever possible, repair of network anomalies, thus enhancing the reliability, performance, and security of the network. To illustrate the advantages and potential benefits deriving from the reasoning capabilities of our management system, we also discuss an application scenario concerning the need of effectively coping with congestion arising in critical parts of the network
{"title":"Monitoring wireless sensor networks through logical deductive processes","authors":"L. Gatani, G. Re, M. Ortolani","doi":"10.1109/MILCOM.2005.1605667","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605667","url":null,"abstract":"This paper proposes a distributed multi-agent architecture for wireless sensor networks management, which exploits the dynamic reasoning capabilities of the situation calculus in order to emulate the reactive behavior of a human expert to fault situations. The information related to network events is generated by tunable agents installed on the network nodes and is collected by a logical entity for network managing where it is merged with general domain knowledge, with the aim of identifying the root causes of faults, and deciding on reparative actions. The logical inference system has being devised to carry out automated isolation, diagnosis, and, whenever possible, repair of network anomalies, thus enhancing the reliability, performance, and security of the network. To illustrate the advantages and potential benefits deriving from the reasoning capabilities of our management system, we also discuss an application scenario concerning the need of effectively coping with congestion arising in critical parts of the network","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"30 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":"126956061","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.1606159
J. Wilson, M. Moyles, S. Miller, W. Leonard, D. Meyer, C. Pitts
The current Department of Defense (DoD) satellite communications architecture relies heavily on point-to-point, circuit-based communications technology, which is an inherently inefficient use of bandwidth resources. The current Global War on Terror (GWOT) and Operations Iraqi (OIF) and Enduring Freedom (OEF) demand a more efficient and scalable infrastructure to support warfighter transformation. To meet these emerging requirements, the Defense Information Systems Agency (DISA) DoD teleport program office (TPO) is building an initial transformational net-centric architecture by the end of Fiscal Year (FY) 2005 with significant upgrades starling in FY 2006. The DoD teleport system provides the deployed warfighter access to the global information grid (GIG) by linking the space and ground segments through a worldwide, pre-positioned military and commercial satellite communications infrastructure. Through multiple radio frequency (RF) media (military and commercial bands), teleport provides inter-theater reach-back into the defense information systems network (DISN) and service command, control, communications, computer, and intelligence (C4I) systems, as well as intra-theater communications support for tactical users. These interfaces enable the seamless, interoperable, and secure transport of command and control (C2), intelligence, surveillance, reconnaissance (ISR), and mission critical information supporting warfighter global operations. The TPO net-centric teleport architecture converges all the voice, video, and data requirements into a single Internet protocol (IP)-based transport system, consisting of: satellite IP-based networking modems, a "black" convergence router suite, and a voice over IP (VoIP) gateway for unclassified voice. This architecture, combined with the global network operations (NetOps) construct, will enable significant bandwidth efficiencies for greater reach-hack and enhanced warfighting capabilities through dynamic bandwidth allocation required for advanced capabilities such as unmanned aerial intelligence, surveillance, and reconnaissance (ISR) missions. As part of the Department's transformation, the teleport net-centric and circuit-based architecture will exist in parallel for some time to enable a gradual transition by the deployed warfighter. This architecture will be implemented in two phases beginning with a limited-IP design at two sites in FYO5 followed by a worldwide implementation at all DoD teleport locations. This paper highlights the implementation and intended operations of the new, net-centric teleport.
{"title":"Building a net-centric DoD teleport","authors":"J. Wilson, M. Moyles, S. Miller, W. Leonard, D. Meyer, C. Pitts","doi":"10.1109/MILCOM.2005.1606159","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606159","url":null,"abstract":"The current Department of Defense (DoD) satellite communications architecture relies heavily on point-to-point, circuit-based communications technology, which is an inherently inefficient use of bandwidth resources. The current Global War on Terror (GWOT) and Operations Iraqi (OIF) and Enduring Freedom (OEF) demand a more efficient and scalable infrastructure to support warfighter transformation. To meet these emerging requirements, the Defense Information Systems Agency (DISA) DoD teleport program office (TPO) is building an initial transformational net-centric architecture by the end of Fiscal Year (FY) 2005 with significant upgrades starling in FY 2006. The DoD teleport system provides the deployed warfighter access to the global information grid (GIG) by linking the space and ground segments through a worldwide, pre-positioned military and commercial satellite communications infrastructure. Through multiple radio frequency (RF) media (military and commercial bands), teleport provides inter-theater reach-back into the defense information systems network (DISN) and service command, control, communications, computer, and intelligence (C4I) systems, as well as intra-theater communications support for tactical users. These interfaces enable the seamless, interoperable, and secure transport of command and control (C2), intelligence, surveillance, reconnaissance (ISR), and mission critical information supporting warfighter global operations. The TPO net-centric teleport architecture converges all the voice, video, and data requirements into a single Internet protocol (IP)-based transport system, consisting of: satellite IP-based networking modems, a \"black\" convergence router suite, and a voice over IP (VoIP) gateway for unclassified voice. This architecture, combined with the global network operations (NetOps) construct, will enable significant bandwidth efficiencies for greater reach-hack and enhanced warfighting capabilities through dynamic bandwidth allocation required for advanced capabilities such as unmanned aerial intelligence, surveillance, and reconnaissance (ISR) missions. As part of the Department's transformation, the teleport net-centric and circuit-based architecture will exist in parallel for some time to enable a gradual transition by the deployed warfighter. This architecture will be implemented in two phases beginning with a limited-IP design at two sites in FYO5 followed by a worldwide implementation at all DoD teleport locations. This paper highlights the implementation and intended operations of the new, net-centric teleport.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"9 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":"122500085","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.1606055
R. Nichols, R. Pattay, T. Jen, D. Moy, S. Orloff, V. Broderick, J. Hillman
The joint tactical radio system (JTRS) wideband networking waveform (WNW) will be a fundamental new capability for a variety of tactical users. In future U.S. marine corps (USMC) operations, the WNW will be the backbone network for the tactical users with other waveforms used in the lower tiers. Performance of the WNW will need to be stringent to ensure connectivity with adequate quality of service. A study has been conducted to determine the performance of this system in USMC scenarios. This work has included an assessment of traffic loads on the network and modeling and simulation to determine the performance of the WNW in various USMC scenarios. This paper focuses on the methodology for traffic prediction which is a key need for DoD to conduct rigorous networking engineering.
{"title":"Traffic predictions for tactical wideband communications","authors":"R. Nichols, R. Pattay, T. Jen, D. Moy, S. Orloff, V. Broderick, J. Hillman","doi":"10.1109/MILCOM.2005.1606055","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606055","url":null,"abstract":"The joint tactical radio system (JTRS) wideband networking waveform (WNW) will be a fundamental new capability for a variety of tactical users. In future U.S. marine corps (USMC) operations, the WNW will be the backbone network for the tactical users with other waveforms used in the lower tiers. Performance of the WNW will need to be stringent to ensure connectivity with adequate quality of service. A study has been conducted to determine the performance of this system in USMC scenarios. This work has included an assessment of traffic loads on the network and modeling and simulation to determine the performance of the WNW in various USMC scenarios. This paper focuses on the methodology for traffic prediction which is a key need for DoD to conduct rigorous networking engineering.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"40 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":"122840996","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.1605898
S. Krishnamurthy, B. Hughes
The capacity of MIMO channel is related to the channel statistics and this in turn related to the choice of antennas and the channel propagation environment. Recently, there has been some work on the evaluation of antenna independent spatial capacity. This analysis considers a multiple-antenna system in which unlimited number of antenna array elements are available, but there is a restriction on the volume they can occupy. The problem is viewed in electro-magnetic (EM) theory setting where a spatially continuous current distribution radiates into free space, with a receiver in the surrounding space measuring the radiated EM field. The advantage the aforementioned approach is that it provides an antenna independent analysis and this forms and upper bound on the achievable capacity with finite number of antennas. However, in computing the capacity, simplifying assumptions that reduce the vectorial EM problem to a scalar wave problem is made and heuristic arguments are used to extrapolate the results to the vectorial case. The impact of this on the results is not readily apparent. In this work, we consider the complete vector EM problem for a system comprising of a transmitter restricted to spherical volume and a receiver, which is a concentric spherical surface in the far-field, and derive some bounds on capacity. We first develop some tools essential for calculation the capacity of the system and then we compute the singular values of this channel in closed form. The main results of this paper are as follows: 1) the capacity scaling law in the high signal-to-noise ratio (SNR) regime is given by (c2 + c1 log SNR) log SNR + 0(log SNR), where c1 is linear and c2 quadratic in the radius of the transmitting volume; and 2) the received power scales as a cubic function of the radius of the transmitting spherical volume
{"title":"On the capacity of volume limited current distributions","authors":"S. Krishnamurthy, B. Hughes","doi":"10.1109/MILCOM.2005.1605898","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605898","url":null,"abstract":"The capacity of MIMO channel is related to the channel statistics and this in turn related to the choice of antennas and the channel propagation environment. Recently, there has been some work on the evaluation of antenna independent spatial capacity. This analysis considers a multiple-antenna system in which unlimited number of antenna array elements are available, but there is a restriction on the volume they can occupy. The problem is viewed in electro-magnetic (EM) theory setting where a spatially continuous current distribution radiates into free space, with a receiver in the surrounding space measuring the radiated EM field. The advantage the aforementioned approach is that it provides an antenna independent analysis and this forms and upper bound on the achievable capacity with finite number of antennas. However, in computing the capacity, simplifying assumptions that reduce the vectorial EM problem to a scalar wave problem is made and heuristic arguments are used to extrapolate the results to the vectorial case. The impact of this on the results is not readily apparent. In this work, we consider the complete vector EM problem for a system comprising of a transmitter restricted to spherical volume and a receiver, which is a concentric spherical surface in the far-field, and derive some bounds on capacity. We first develop some tools essential for calculation the capacity of the system and then we compute the singular values of this channel in closed form. The main results of this paper are as follows: 1) the capacity scaling law in the high signal-to-noise ratio (SNR) regime is given by (c2 + c1 log SNR) log SNR + 0(log SNR), where c1 is linear and c2 quadratic in the radius of the transmitting volume; and 2) the received power scales as a cubic function of the radius of the transmitting spherical volume","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"1 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":"122846567","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.1606143
Zhenshang Zhang
One of the key performance measures for a neighbor discovery algorithm in military applications with directional antennas is how long it takes to discover the neighbors given that nodes do not have priori knowledge about where their neighbors are. One general impression in neighbor discovery is that algorithms based on all directional (directional transmission and directional receive) takes longer time to discover all neighbors than those algorithms partially or entirely based on omni-directional antennas. In this paper, we prove that this may not be the case. We first describe a generic random neighbor discovery algorithm (GRA), which uses omni-directional antennas for reception. Then we derive analytical expressions for the average number of slots required to discover all (or any one of) the neighbors for GRA and for an all-directional, scan based algorithm (omni-directional antennas are not used at all). Analytic and simulation results are presented to compare the two algorithms in terms of the expected number of slots required to discover any one or all of the neighbors. Based on the numerical results, we conclude that scan-based all-directional algorithm gives better performance than the algorithm which uses omni-antennas. If designed properly, all-directional neighbor discovery algorithms can discover neighbors in less time than those algorithms that use omnidirectional antennas. The advantages and disadvantages of each algorithm are discussed as well.
{"title":"Performance of neighbor discovery algorithms in mobile ad hoc self-configuring networks with directional antennas","authors":"Zhenshang Zhang","doi":"10.1109/MILCOM.2005.1606143","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606143","url":null,"abstract":"One of the key performance measures for a neighbor discovery algorithm in military applications with directional antennas is how long it takes to discover the neighbors given that nodes do not have priori knowledge about where their neighbors are. One general impression in neighbor discovery is that algorithms based on all directional (directional transmission and directional receive) takes longer time to discover all neighbors than those algorithms partially or entirely based on omni-directional antennas. In this paper, we prove that this may not be the case. We first describe a generic random neighbor discovery algorithm (GRA), which uses omni-directional antennas for reception. Then we derive analytical expressions for the average number of slots required to discover all (or any one of) the neighbors for GRA and for an all-directional, scan based algorithm (omni-directional antennas are not used at all). Analytic and simulation results are presented to compare the two algorithms in terms of the expected number of slots required to discover any one or all of the neighbors. Based on the numerical results, we conclude that scan-based all-directional algorithm gives better performance than the algorithm which uses omni-antennas. If designed properly, all-directional neighbor discovery algorithms can discover neighbors in less time than those algorithms that use omnidirectional antennas. The advantages and disadvantages of each algorithm are discussed as well.","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"1 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":"129719994","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.1605929
V. Guruprasad
Based on a recent thesis, a canonical networking scheme is described that would eliminate address space coordination and limit the need for route discovery in a manner that is scale-free, is orthogonal to existing protocol suites, and provides near-instantaneous responsiveness to change. This also makes it inherently independent of coordinated global name or address spaces like the DNS and IP. It enables independently deployed private and invisible Internets that would be extremely lightweight, efficient and fast, and can be created, grown, split or merged by the users themselves over the existing infrastructure, using no coordination or network administration skills
{"title":"Virtue of intransparency: coordination-free, scale-free private Internets","authors":"V. Guruprasad","doi":"10.1109/MILCOM.2005.1605929","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605929","url":null,"abstract":"Based on a recent thesis, a canonical networking scheme is described that would eliminate address space coordination and limit the need for route discovery in a manner that is scale-free, is orthogonal to existing protocol suites, and provides near-instantaneous responsiveness to change. This also makes it inherently independent of coordinated global name or address spaces like the DNS and IP. It enables independently deployed private and invisible Internets that would be extremely lightweight, efficient and fast, and can be created, grown, split or merged by the users themselves over the existing infrastructure, using no coordination or network administration skills","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"1 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":"129867901","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.1605799
R. Grover, D. Pados, M. Medley
We develop a new algorithm to optimize adaptively binary and quaternary signatures for code-division multiple-access (CDMA) communications over multipath channels and/or asynchronous channel access. Using the observed signal autocorrelation matrix, the algorithm attempts to maximize over the binary or quaternary antipodal sequence field the signal-to-interference-plus-noise ratio (SINR) at the output of the maximum SINR linear filter. While this maximization problem is NP-hard, the algorithm is seen to produce in short polynomial time highly desirable solutions that approach in performance the theory-only complex/real-field optimal signature vectors. Signature adaptation may be carried out in either a single or a multi-user mode. Simulation studies included herein offer direct performance comparisons with other known binary signature set designs and the theoretical complex/real-valued optimal vectors
{"title":"Adaptive optimization of binary/quaternary CDMA signatures in multipath fading environments","authors":"R. Grover, D. Pados, M. Medley","doi":"10.1109/MILCOM.2005.1605799","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1605799","url":null,"abstract":"We develop a new algorithm to optimize adaptively binary and quaternary signatures for code-division multiple-access (CDMA) communications over multipath channels and/or asynchronous channel access. Using the observed signal autocorrelation matrix, the algorithm attempts to maximize over the binary or quaternary antipodal sequence field the signal-to-interference-plus-noise ratio (SINR) at the output of the maximum SINR linear filter. While this maximization problem is NP-hard, the algorithm is seen to produce in short polynomial time highly desirable solutions that approach in performance the theory-only complex/real-field optimal signature vectors. Signature adaptation may be carried out in either a single or a multi-user mode. Simulation studies included herein offer direct performance comparisons with other known binary signature set designs and the theoretical complex/real-valued optimal vectors","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"1 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":"128790059","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.1606070
B. Tavlı, W. Heinzelman
In this paper, we present multicasting through time reservation using adaptive control for energy efficiency (MC-TRACE), which is an energy-efficient voice multicasting architecture for mobile ad hoc networks. MC-TRACE is a monolithic design, where the medium access control layer functionality and network layer functionality are performed by a single integrated layer. The basic design philosophy behind the networking part of the architecture is to establish and maintain a multicast tree within a mobile ad hoc network using broadcasting to establish the desired tree branches and pruning the redundant branches of the multicast tree based on feedback obtained from the multicast leaf nodes. Energy efficiency of the architecture is partially due to the medium access part, where the nodes can switch to sleep mode frequently; and partially due to the network layer part where the number of redundant data retransmissions and receptions are mostly eliminated. Furthermore, MC-TRACE achieves high spatial reuse efficiency by keeping the number of nodes taking part in multicasting operation minimal. We evaluated the performance of MC-TRACE through ns simulations and compared with flooding. Our results show that packet delivery ratio performance, energy efficiency and spatial reuse efficiency of MC-TRACE is superior to those of flooding
{"title":"MC-TRACE: multicasting through time reservation using adaptive control for energy efficiency","authors":"B. Tavlı, W. Heinzelman","doi":"10.1109/MILCOM.2005.1606070","DOIUrl":"https://doi.org/10.1109/MILCOM.2005.1606070","url":null,"abstract":"In this paper, we present multicasting through time reservation using adaptive control for energy efficiency (MC-TRACE), which is an energy-efficient voice multicasting architecture for mobile ad hoc networks. MC-TRACE is a monolithic design, where the medium access control layer functionality and network layer functionality are performed by a single integrated layer. The basic design philosophy behind the networking part of the architecture is to establish and maintain a multicast tree within a mobile ad hoc network using broadcasting to establish the desired tree branches and pruning the redundant branches of the multicast tree based on feedback obtained from the multicast leaf nodes. Energy efficiency of the architecture is partially due to the medium access part, where the nodes can switch to sleep mode frequently; and partially due to the network layer part where the number of redundant data retransmissions and receptions are mostly eliminated. Furthermore, MC-TRACE achieves high spatial reuse efficiency by keeping the number of nodes taking part in multicasting operation minimal. We evaluated the performance of MC-TRACE through ns simulations and compared with flooding. Our results show that packet delivery ratio performance, energy efficiency and spatial reuse efficiency of MC-TRACE is superior to those of flooding","PeriodicalId":223742,"journal":{"name":"MILCOM 2005 - 2005 IEEE Military Communications Conference","volume":"21 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":"128559928","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
扫码关注我们
求助内容：
应助结果提醒方式：