Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/605991.606001acmconferencesArticle/Chapter ViewAbstractPublication PageswowmomConference Proceedingsconference-collections
Article

Service curve assurances versus uplink throughput in CDMA networks

Published: 21 July 2001 Publication History

Abstract

The scheme proposed in this paper balances the partly conflicting objectives of meeting the diverse quality of service (QoS) needs of mobile hosts (MHs) and achieving high uplink throughput in a Direct Sequence Code Division Multiple Access (DS-CDMA) based cellular network. The QoS needs of the MHs are modeled using the notion of a service curve, which is a function characterizing the minimum number of bits a MH must transmit in any given time interval in order to meet its QoS requirement. Each MH is also assumed to have a specified bound on the acceptable bit error rate.The technique proposed in this paper maximizes the uplink throughput subject to the service curve constraints by jointly adapting the transmitted power and the number of spreading codes used by each MH in relaying its data bits. During this joint adaptation, the technique also imposes specified bounds on the transmitted power and the number of spreading codes that a MH can handle. The proposed technique is evaluated using a discrete-event simulation. The evaluation shows that the proposed scheme can effectively balance the two above-mentioned objectives.

References

[1]
J. R. Bennett and H. Zhang, "Hierarchical packet fair queueing algorithms," IEEE/ACM Transactions on Networking, Vol. 5, No. 5, pp. 675-689, October 1997.
[2]
J. R. Bennett and H. Zhang, "WF2Q: Worst-case fair weighted fair queueing," Proceedings of INFOCOMM, pp. 120-128, March 1996.
[3]
C. S. Chang and K. C. Chen, "Service curve proportional sharing algorithm for service-guaranteed multi-access in integrated-service wireless networks," IEEE Vehicular Technology Conference, vol. 2, pp. 1288-1293, 1999.
[4]
R. Cruz "Quality of service guaranteed in virtual circuits switched network," IEEE Journal on Selected Areas in Communications, vol. 13, pp. 1048-1056, August 1995.
[5]
A. Demers, S. Keshav and S. Shenker, "Analysis and scheduling of a fair queueing algorithm," Proceedings of SIGCOMM, September 1989.
[6]
M. Elaoud and P. Ramanathan, "Adaptive allocation of CDMA resources for network-level QoS assurances," Proceedings of MOBICOM, August 2000.
[7]
M. Elaoud and P. Ramanathan, "Adaptive use of error-correcting code for real-time communication in wireless networks," Proceedings of INFOCOMM, pp. 548-555, March 1998.
[8]
V. Erceg, L. J. Greenstein, S. Y. Tjandra, S. R. Parkoff, A. Gupta, B. Kulic, A. A. Julius, and R. Bianchi, "An emperically based path loss model for wireless channels in suburban environments," IEEE Journal on Selected Areas in Communications, vol.17, pp.1205-1211, July 1999
[9]
S. Flyod and V. Jacobson, "Link-sharing and resource management models for packet networks," IEEE/ACM Transactions on Networking, vol. 3, pp. 365-386, august 1995.
[10]
S. Haykin, "Communication systems," John Wiley & Sons, Inc., 2000.
[11]
S. A. Jafar and A. Goldsmith, "Adaptive multicode CDMA for uplink throughput maximization," Submitted for publication, 2000 http://systems.stanford.edu/
[12]
S. Lu, V. Bhargavan and R. Srikant, "Fair scheduling in wireless packet networks," Proceedings of SIGCOMM, September 1997.
[13]
T. S. E. Ng, I. Stoica and H. Zhang, "Packet fair queueing algorithms for wireless networks with location dependent errors," Proceedings of INFOCOMM, pp. 1103-1111, March 1998.
[14]
S. J. Oh, T. L. Olsen and K. M. Wasserman "Distributed power control and spreading gain allocation in CDMA data networks," Proceedings of INFOCOMM, 2000.
[15]
S. J. Oh and K. M. Wasserman, "Dynamic spreading gain control in multiservice CDMA Networks," IEEE Journal On selected Areas in Communications, vol. 17, No. 5, pp. 918-927, May 1999.
[16]
A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated service networks: The single node case," IEEE/ACM Transactions on Networking, vol. 1, pp. 344-357, June 1993.
[17]
P. Ramanathan and P. Agrawal "Adapting packet fair queueing algorithms to wireless networks," ACM/IEEE Proceedings of MOBICOM, pp. 1-9, August 1998.
[18]
H. Sariowan, R. L. Cruz and G. C. Polyzos, "SCED: a generalized scheduling policy for guaranteeing Quality-of-Service," IEEE/ACM Transactions on Networking, vol. 7, No.5, pp. 669-684, October 1999.
[19]
H. Sariowan, R. L. Cruz and G. C. Polyzos, "Scheduling for quality of service guarantees via service curves," Proceedings of ICCCN, pp. 512-520, September 1995.
[20]
I. Stoica, H. Zhang and T. S. E. Ng, "A hierarchical fair service curve algorithm for link-sharing, real-time and priority services," IEEE/ACM Transactions on Networking, vol. 8, No. 2, pp. 185-199, April 2000.
[21]
R. Yates, "A framework for uplink power control in cellular radio systems," IEEE Journal on Selected Areas of Communications, vol. 13, pp. 1341-1347, September 1995.

Cited By

View all
  • (2004)Adaptive power and rate allocation for service curve assurance in DS-CDMA networkIEEE Transactions on Wireless Communications10.1109/TWC.2004.8253663:2(555-564)Online publication date: 1-Mar-2004
  • (2002)Minimizing deviation from service curve in forward link of DS-CDMA networkVehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367)10.1109/VTC.2002.1002795(1155-1159)Online publication date: 2002

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WOWMOM '01: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia
July 2001
118 pages
ISBN:1581133847
DOI:10.1145/605991
  • Program Chairs:
  • Victor Bahl,
  • Adam Wolisz
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 July 2001

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. multimedia systems
  2. quality of service differentiation
  3. wireless networks

Qualifiers

  • Article

Conference

WoWMoM00
Sponsor:

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 10 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2004)Adaptive power and rate allocation for service curve assurance in DS-CDMA networkIEEE Transactions on Wireless Communications10.1109/TWC.2004.8253663:2(555-564)Online publication date: 1-Mar-2004
  • (2002)Minimizing deviation from service curve in forward link of DS-CDMA networkVehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367)10.1109/VTC.2002.1002795(1155-1159)Online publication date: 2002

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media