Skip to main content
  • 93 Accesses

Abstract

Providing fair share of bandwidth is critical to support communication-intensive applications in a shared-medium, capacity-constrained, large-scale infrastructureless wireless network. The proposed design has to be distributed, scalable and address the issue of location-dependent contention. In this paper, we present a novel packet scheduling solution that achieves distributed fair service in such multihop, multiple access wireless networks. Our design works well with the CSMA/CA MAC framework. We evaluate our proposed design through both analysis and simulations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Demers, S. Keshav and S. Shenker, “Analysis and simulation of a fair queueing algorithm,” ACM SIGCOMM’89, August 1989.

    Google Scholar 

  2. P. Goyal, H.M. Vin and H. Chen, “Start-time Fair Queueing: A scheduling algorithm for integrated service access,” ACM SIGCOMM’96. August 1996.

    Google Scholar 

  3. S. Lu, V. Bharghavan and R. Srikant, “Fair scheduling in wireless packet networks,” ACM SIGCOMM’97, September 1997.

    Google Scholar 

  4. T.S. Ng, I. Stoica and H. Zhang, “Packet fair queueing algorithms for wireless networks with location-dependent errors,” IEEE INFOCOM’98, March 1998.

    Google Scholar 

  5. V. Bharghavan, A. Demers, S. Shenker, and L. Zhang, “MACAW: A medium access protocol for wireless LANs,” ACM SIGCOMM’94, August 1994.

    Google Scholar 

  6. IEEE 802.11 Standard Specification,“ 1997.

    Google Scholar 

  7. N. H. Vaidya, P. Bahl and S. Gupta, “Fair scheduling in broadcast environments,” Tech. Rep. MSR-TR-99–61, Microsoft Research, August 1999.

    Google Scholar 

  8. H. Luo, S. Lu and V. Bharghavan, “A new model for packet scheduling in multihop wireless networks,” ACM MOBICOM’00, August 2000.

    Google Scholar 

  9. H. Luo and S. Lu, “Fair queueing in ad hoc wireless networks,” to appear in IEEE ICNP’00, November 2000.

    Google Scholar 

  10. Global Mobile Information Systems Simulation Library (GLOMOSIM),“ http://pcl.cs.ucla.edu/projects/glomosim/.

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this chapter

Cite this chapter

Luo, H., Lu, S. (2000). Achieving Fair Service in Large-Scale Multiple Access Networks. In: Stüber, G., Jabbari, B. (eds) Multiaccess, Mobility and Teletraffic in Wireless Communications: Volume 5. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5916-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-5916-7_20

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4872-4

  • Online ISBN: 978-1-4757-5916-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics