Pub Date : 2001-10-28DOI: 10.1109/MILCOM.2001.985799
S.D. Jones, I. Wang
In this work we investigate an architecture for resource provisioning and route selection over multiple disparate networks. We have developed a layered hierarchy of internetworking and intranetworking levels of management called a MetaNet. Management at the internetwork level is conducted in a manner that models each network abstractly. At the intranetwork level management accounts for the detailed implementation and organizational characteristics of each network. The paper explores how to employ these layers to cooperatively satisfy end-to-end requests for connectivity with an associated QoS. In addition, we explore negotiation between the inter- and intranetwork levels of management and brokering of QoS by the internetwork level among the intranetwork level managers.
{"title":"A MetaNet architecture for end-to-end quality of service (QoS) over disparate networks","authors":"S.D. Jones, I. Wang","doi":"10.1109/MILCOM.2001.985799","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985799","url":null,"abstract":"In this work we investigate an architecture for resource provisioning and route selection over multiple disparate networks. We have developed a layered hierarchy of internetworking and intranetworking levels of management called a MetaNet. Management at the internetwork level is conducted in a manner that models each network abstractly. At the intranetwork level management accounts for the detailed implementation and organizational characteristics of each network. The paper explores how to employ these layers to cooperatively satisfy end-to-end requests for connectivity with an associated QoS. In addition, we explore negotiation between the inter- and intranetwork levels of management and brokering of QoS by the internetwork level among the intranetwork level managers.","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":"115882987","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.985846
B. White
A layered communications architecture is advocated for the military's Global Communications Grid (GCG) or Global Grid (GG), the communications infrastructure of the Global Information Grid (GIG). A seven-layer reference model consisting of mission, application, service, transport, network, link and physical layers is introduced; the GG corresponds to the transport and network layers. The fundamental concept for military interoperability inherent in the GG architecture, viz., network-centricity, is explained. The importance of "layering" communications protocols and functions is discussed. Examples of layering communications, management and security functions are provided.
{"title":"Layered communications architecture for the Global Grid","authors":"B. White","doi":"10.1109/MILCOM.2001.985846","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985846","url":null,"abstract":"A layered communications architecture is advocated for the military's Global Communications Grid (GCG) or Global Grid (GG), the communications infrastructure of the Global Information Grid (GIG). A seven-layer reference model consisting of mission, application, service, transport, network, link and physical layers is introduced; the GG corresponds to the transport and network layers. The fundamental concept for military interoperability inherent in the GG architecture, viz., network-centricity, is explained. The importance of \"layering\" communications protocols and functions is discussed. Examples of layering communications, management and security functions are provided.","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":"132704796","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.985856
Yimin D. Zhang, M. Amin, A. Hoorfar, V. Mancuso
Transmitted and received signals involving rotorcrafts are subject to inter-modulations caused by the rotor blades. The statistical characteristics of the wireless communication link between a rotorcraft transmitter and a receiver on the ground are developed. Both the scattering and Doppler effects of the rotating blades on the impairment of frequency modulated frequency hopping signals are considered. The channel model includes the near-field wave propagation between the transmitter antenna and the scattering blades. The channel model is used to examine the performance of different diversity techniques, namely, the transmitter diversity, multicarrier frequency hopping (MCFH) and the fast frequency hopping (FFH), in view of the antenna polarization and relative strength of the direct path and the scattering component from the rotating blades.
{"title":"Diversity techniques for rotorcraft wireless communications","authors":"Yimin D. Zhang, M. Amin, A. Hoorfar, V. Mancuso","doi":"10.1109/MILCOM.2001.985856","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985856","url":null,"abstract":"Transmitted and received signals involving rotorcrafts are subject to inter-modulations caused by the rotor blades. The statistical characteristics of the wireless communication link between a rotorcraft transmitter and a receiver on the ground are developed. Both the scattering and Doppler effects of the rotating blades on the impairment of frequency modulated frequency hopping signals are considered. The channel model includes the near-field wave propagation between the transmitter antenna and the scattering blades. The channel model is used to examine the performance of different diversity techniques, namely, the transmitter diversity, multicarrier frequency hopping (MCFH) and the fast frequency hopping (FFH), in view of the antenna polarization and relative strength of the direct path and the scattering component from the rotating blades.","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":"133138674","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.986069
Jian Cheng, M. Cheng, Haifang Wang, Shixin Cheng
An enhanced criterion for space-time trellis code (STTC) construction is deduced. Then a new kind of STTC construction is proposed using serially concatenated convolutional code (SCCC) with 4PSK jointly with direct mapping and Gray mapping. Simulation shows that SCCC-STTC with Gray mapping is much better than that with direct mapping and SCCC-STTCs with Gray mapping outperform the improved STTCs proposed by S. Baro et al. (see IEEE Commun. letters, vol.4, p.20-2, 2000). SCCC-STTC has good performance and is easy to construct.
{"title":"An enhanced criterion for space-time trellis code and serially concatenated convolutionally coded STTC","authors":"Jian Cheng, M. Cheng, Haifang Wang, Shixin Cheng","doi":"10.1109/MILCOM.2001.986069","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.986069","url":null,"abstract":"An enhanced criterion for space-time trellis code (STTC) construction is deduced. Then a new kind of STTC construction is proposed using serially concatenated convolutional code (SCCC) with 4PSK jointly with direct mapping and Gray mapping. Simulation shows that SCCC-STTC with Gray mapping is much better than that with direct mapping and SCCC-STTCs with Gray mapping outperform the improved STTCs proposed by S. Baro et al. (see IEEE Commun. letters, vol.4, p.20-2, 2000). SCCC-STTC has good performance and is easy to construct.","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":"133245249","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.986056
J. Tsai, J. Hicks, B. Woerner
We propose a new signal extraction method that combines MMSE beamforming with successive interference cancellation (SIC) for an overloaded antenna array system. By an overloaded array system, we mean that the number of desired signals exceeds the number of distinct antenna elements, often by a significant amount. We evaluate the performance of the proposed signal extraction method through the use of bit error rate (BER) simulation. The simulation results show that the new signal extraction method can increase the number of users that can be supported in an airborne communication environment. We also evaluate the effects of directional antenna patterns on the performance of the proposed signal extraction method. Performance results for an 8 element antenna array show that the proposed signal extraction method with a 60/spl deg/ half-power beam width (HPBW) directional pattern can support up to 16 users (twice as many as number of antenna elements) and a 30/spl deg/ HPBW directional pattern can support up to 24 users (three times as many as number of antenna elements).
{"title":"Joint MMSE beamforming with SIC for an overloaded array system","authors":"J. Tsai, J. Hicks, B. Woerner","doi":"10.1109/MILCOM.2001.986056","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.986056","url":null,"abstract":"We propose a new signal extraction method that combines MMSE beamforming with successive interference cancellation (SIC) for an overloaded antenna array system. By an overloaded array system, we mean that the number of desired signals exceeds the number of distinct antenna elements, often by a significant amount. We evaluate the performance of the proposed signal extraction method through the use of bit error rate (BER) simulation. The simulation results show that the new signal extraction method can increase the number of users that can be supported in an airborne communication environment. We also evaluate the effects of directional antenna patterns on the performance of the proposed signal extraction method. Performance results for an 8 element antenna array show that the proposed signal extraction method with a 60/spl deg/ half-power beam width (HPBW) directional pattern can support up to 16 users (twice as many as number of antenna elements) and a 30/spl deg/ HPBW directional pattern can support up to 24 users (three times as many as number of antenna elements).","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":"124538926","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.985840
P. Renfree
With renewed dedication to allied interoperability, several years ago the US Navy launched an initiative to enable digital data interchange at sea between US battle groups and allied/coalition navy units operating in concert. Building on the experience gained from ad hoc efforts with HF e-mail in the mid 90s, the USN applied the technology enhancements in MIL-STD-188-110B (interoperability and performance standards for data modems) and STANAG 5066 (profile for HF radio data communications) to implement a COTS based e-mail system operating in the HF spectrum at speeds up to 9600 bps. This paper describes this fast moving program, entitled Battle Force Email 66, and its rapid implementation on a battlegroup deployment basis, starting with the Harry S Truman BG and the Nassau ARG. Lessons learned are discussed along with successes to date and enhancements being investigated for application in the near future.
{"title":"The US Navy returns to HF with STANAG 5066 as the path","authors":"P. Renfree","doi":"10.1109/MILCOM.2001.985840","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985840","url":null,"abstract":"With renewed dedication to allied interoperability, several years ago the US Navy launched an initiative to enable digital data interchange at sea between US battle groups and allied/coalition navy units operating in concert. Building on the experience gained from ad hoc efforts with HF e-mail in the mid 90s, the USN applied the technology enhancements in MIL-STD-188-110B (interoperability and performance standards for data modems) and STANAG 5066 (profile for HF radio data communications) to implement a COTS based e-mail system operating in the HF spectrum at speeds up to 9600 bps. This paper describes this fast moving program, entitled Battle Force Email 66, and its rapid implementation on a battlegroup deployment basis, starting with the Harry S Truman BG and the Nassau ARG. Lessons learned are discussed along with successes to date and enhancements being investigated for application in the near future.","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":"114854280","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.986071
T. Macdonald, M. Pursley
Hermitian codes are an attractive alternative to Reed-Solomon codes for use in frequency-hop (FH) spread-spectrum packet radio networks. For a given alphabet size, a Hermitian code has a much longer block length than a Reed-Solomon code. This and other considerations suggest that Hermitian codes may be superior for certain applications. Analytical results are developed for the evaluation of the packet error probability for FH transmissions using Hermitian coding. We find there are several situations for which Hermitian codes provide much lower packet error probabilities than can be obtained with Reed-Solomon codes. In general, as the code rate decreases or the symbol alphabet size increases, the relative performance of Hermitian codes improves with respect to Reed-Solomon codes. Performance evaluations are presented for an additive white Gaussian noise channel and for a catastrophic partial-band interference channel, and the packet error probability is evaluated for both errors-only and errors-and-erasures decoding.
{"title":"Frequency-hop spread-spectrum packet radio with Hermitian codes","authors":"T. Macdonald, M. Pursley","doi":"10.1109/MILCOM.2001.986071","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.986071","url":null,"abstract":"Hermitian codes are an attractive alternative to Reed-Solomon codes for use in frequency-hop (FH) spread-spectrum packet radio networks. For a given alphabet size, a Hermitian code has a much longer block length than a Reed-Solomon code. This and other considerations suggest that Hermitian codes may be superior for certain applications. Analytical results are developed for the evaluation of the packet error probability for FH transmissions using Hermitian coding. We find there are several situations for which Hermitian codes provide much lower packet error probabilities than can be obtained with Reed-Solomon codes. In general, as the code rate decreases or the symbol alphabet size increases, the relative performance of Hermitian codes improves with respect to Reed-Solomon codes. Performance evaluations are presented for an additive white Gaussian noise channel and for a catastrophic partial-band interference channel, and the packet error probability is evaluated for both errors-only and errors-and-erasures decoding.","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":"123709737","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.985803
A. Mcauley, A. Misra, L. Wong, K. Manousakis
To make future tactical battlefield networks more agile, flexible and robust, nodes must rapidly configure themselves with little or no human intervention,moreover they must reconfigure automatically as the environment changes. We present our approach to configuring and reconfiguring an entire network domain, possibly consisting of tens of thousands of hosts and routers, based on a new dynamical configuration distribution protocol (DCDP). DCDP automatically distributes address-pools and other IP configuration information to every subnet in a domain, where a subnet configuration protocol can configure each node in a subnet. This paper describes the first implementation of DCDP and shows how, with the subnet configuration protocol DRCP, it rapidly configured IP addresses to Linux hosts and routers.
{"title":"Experience-with autoconfiguring a network with IP addresses","authors":"A. Mcauley, A. Misra, L. Wong, K. Manousakis","doi":"10.1109/MILCOM.2001.985803","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985803","url":null,"abstract":"To make future tactical battlefield networks more agile, flexible and robust, nodes must rapidly configure themselves with little or no human intervention,moreover they must reconfigure automatically as the environment changes. We present our approach to configuring and reconfiguring an entire network domain, possibly consisting of tens of thousands of hosts and routers, based on a new dynamical configuration distribution protocol (DCDP). DCDP automatically distributes address-pools and other IP configuration information to every subnet in a domain, where a subnet configuration protocol can configure each node in a subnet. This paper describes the first implementation of DCDP and shows how, with the subnet configuration protocol DRCP, it rapidly configured IP addresses to Linux hosts and routers.","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":"129704449","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.985814
M. Ahmed, S. Dao, R. Katz
The dynamic nature of a mobile ad hoc network (MANET) may result in a cluster of nodes being isolated from the remaining network, especially when deployed in a terrain with blockages. In order to facilitate scalability and to provide connectivity between partitions that might occur in wireless networks as a consequence of mobility, we can envision a 'range extension' network that consists of airborne communication platforms, or geostationary/low-Earth-orbit satellites. These airborne/satellite nodes maintain communication links with specific 'gateway' nodes among the mobile ground nodes. To communicate with a node that is geographically distant or belongs to a different network partition, an ad hoc node can relay its data packets through an appropriate mobile gateway and via the range extension network. If we envision that the MANET is divided into different groups and a mobile gateway is deployed for each such group, an objective then is to determine the trajectory of the mobile gateway to best serve the ad hoc group to which it belongs, in terms of network performance metrics such as throughput and latency. In this paper, this problem of computing the optimal position for a gateway is reduced to a linear optimization problem by means of some simplifying but realistic assumptions. We suggest methods that may be deployed to enable the gateway to follow this optimal trajectory as closely as possible (within the practical constraints imposed by its velocity and maneuverability). Simulation results for various scenarios show a 10-15% improvement in the throughput and latency, per gateway domain, if a gateway has a dynamic trajectory whose locus follows the computed optimal position, as compared to a gateway that is statically placed at a regular position, or to a gateway that has a random trajectory.
{"title":"Positioning range extension gateways in mobile ad hoc wireless networks to improve connectivity and throughput","authors":"M. Ahmed, S. Dao, R. Katz","doi":"10.1109/MILCOM.2001.985814","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.985814","url":null,"abstract":"The dynamic nature of a mobile ad hoc network (MANET) may result in a cluster of nodes being isolated from the remaining network, especially when deployed in a terrain with blockages. In order to facilitate scalability and to provide connectivity between partitions that might occur in wireless networks as a consequence of mobility, we can envision a 'range extension' network that consists of airborne communication platforms, or geostationary/low-Earth-orbit satellites. These airborne/satellite nodes maintain communication links with specific 'gateway' nodes among the mobile ground nodes. To communicate with a node that is geographically distant or belongs to a different network partition, an ad hoc node can relay its data packets through an appropriate mobile gateway and via the range extension network. If we envision that the MANET is divided into different groups and a mobile gateway is deployed for each such group, an objective then is to determine the trajectory of the mobile gateway to best serve the ad hoc group to which it belongs, in terms of network performance metrics such as throughput and latency. In this paper, this problem of computing the optimal position for a gateway is reduced to a linear optimization problem by means of some simplifying but realistic assumptions. We suggest methods that may be deployed to enable the gateway to follow this optimal trajectory as closely as possible (within the practical constraints imposed by its velocity and maneuverability). Simulation results for various scenarios show a 10-15% improvement in the throughput and latency, per gateway domain, if a gateway has a dynamic trajectory whose locus follows the computed optimal position, as compared to a gateway that is statically placed at a regular position, or to a gateway that has a random trajectory.","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":"128750277","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.986097
Woohyun Park, Y. Kwon, D.C. Lee
Future CDMA cellular networks are expected to carry a wide variety of data traffic. Traffic characteristics of data users can be characterized by burstiness and asymmetricity. Data traffic such as in Internet web browsing applications show asymmetric characteristics that cause a relatively heavy load on the forward link. Bursty data can drive the system into a situation wherein available CDMA codes are depleted even when there is enough margin of signal-to-interference ratio (SIR) to accept a new call. Thus, we propose a new call admission control (CAC) scheme on the CDMA forward link that reserves both some codes and interference margin for handoff calls. With the proposed CAC scheme, we construct a Markovian model for voice and data calls (two classes) in progress. The proposed scheme is compared with the conventional scheme that reserves interference margin only. Numerical results show that the proposed scheme is more efficient in accommodating calls under a given set of constraints.
{"title":"A CAC scheme with code and interference limits on the forward link in CDMA cellular network","authors":"Woohyun Park, Y. Kwon, D.C. Lee","doi":"10.1109/MILCOM.2001.986097","DOIUrl":"https://doi.org/10.1109/MILCOM.2001.986097","url":null,"abstract":"Future CDMA cellular networks are expected to carry a wide variety of data traffic. Traffic characteristics of data users can be characterized by burstiness and asymmetricity. Data traffic such as in Internet web browsing applications show asymmetric characteristics that cause a relatively heavy load on the forward link. Bursty data can drive the system into a situation wherein available CDMA codes are depleted even when there is enough margin of signal-to-interference ratio (SIR) to accept a new call. Thus, we propose a new call admission control (CAC) scheme on the CDMA forward link that reserves both some codes and interference margin for handoff calls. With the proposed CAC scheme, we construct a Markovian model for voice and data calls (two classes) in progress. The proposed scheme is compared with the conventional scheme that reserves interference margin only. Numerical results show that the proposed scheme is more efficient in accommodating calls under a given set of constraints.","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":"128685870","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
扫码关注我们
求助内容：
应助结果提醒方式：