Skip to main content
SpringerLink
Log in

Design and analysis of an algorithm for fair service in error‐prone wireless channels

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In order to support diverse communication‐intensive real‐time and non‐real‐time data flows over a scarce, varying and shared wireless channel with location‐dependent and bursty errors, we define a service model that has the following characteristics: short‐term fairness among flows which perceive a clean channel, long‐term fairness for flows with bounded channel error, worst‐case delay bounds for packets, short‐term throughput bounds for flows with clean channels and long‐term throughput bounds for all flows with bounded channel error, expanded schedulable region, and support for both delay sensitive and error sensitive data flows. We present the wireless fair service algorithm, and show through both analysis and simulation that it achieves the requirements of the service model in typical wireless network environments. The key aspects of the algorithm are the following: (a) an enhanced fair queueing based service scheme that supports decoupling of delay and bandwidth, (b) graceful service compensation for lagging flows and graceful service degradation for leading flows, (c) support for real‐time delay sensitive flows as well as non‐real‐time error sensitive flows, and (d) an implementation within the framework of the simple and robust CSMA/CA wireless medium access protocol.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J.C.R. Bennett and H. Zhang, WF2Q: Worst-case fair weighted fair queueing, in: Proc. of IEEE INFOCOM '96, San Francisco, CA (March 1996).

  2. P. Bhagwat, P. Bhattacharya, A. Krishma and S. Tripathi, Enhancing throughput over wireless LANs using channel state dependent packet scheduling, in: Proc. of IEEE INFOCOM '96, San Francisco, CA (March 1996).

  3. C. Chang, J. Chang, K. Chen and M. You, Guaranteed quality-ofservice wireless access to ATM, in: Proc. of IEEE GLOBECOM '96, London, UK (November 1996).

  4. A. Demers, S. Keshav and S. Shenker, Analysis and simulation of a fair queueing algorithm, in: Proc. of ACM SIGCOMM '89, Austin, TX (September 1989).

  5. L. Georgiadis, R. Guerin and A. Parekh, Optimal multiplexing on a single link: delay and buffer requirements, IEEE Transactions on Information Theory 43(5) (September 1997) 1518–1535.

    Article  MATH  MathSciNet  Google Scholar 

  6. S. Golestani, A self-clocked fair queueing scheme for broadband applications, in: Proc. of IEEE INFOCOM '94, Toronto, Canada (June 1994).

  7. P. Goyal, H. Vin and H. Cheng, Start-time fair queuing: a scheduling algorithm for integrated services packet switching networks, in: Proc. of ACM SIGCOMM '96, Stanford, CA (August 1996).

  8. S. Ha, K.W. Lee and V. Bharghavan, Performance evaluation of scheduling algorithms in integrated services packet networks, in: Proc. of ISCC '98, Athens, Greece (July 1998).

  9. M.J. Karol, Z. Liu and K.Y. Eng, An efficient demand-assignment multiple access protocol for wireless packet (ATM) networks, Wireless Networks 1(3) (December 1995) 269–279.

    Article  Google Scholar 

  10. S. Lu, V. Bharghavan and R. Srikant, Fair scheduling in wireless packet networks, in: Proc. of ACM SIGCOMM '97, Cannes, France (August 1997).

  11. T.S.E. Ng, I. Stoica and H. Zhang, Packet fair queueuing algorithms for wireless networks with location-dependent errors, in: Proc. of IEEE INFOCOM '98, San Francisco, CA (March 1998).

  12. A. Parekh, A generalized processor sharing approach to flow control in integrated services networks, Ph.D. thesis, MIT Laboratory for Information and Decision Systems, Technical Report LIDS-TR-2089 (1992).

  13. P. Ramanathan and P. Agrawal, Adapting packet fair queueing algorithms to wireless networks, in: Proc. of ACM MOBICOM '98, Dallas, TX (October 1998).

  14. M. Srivastava, C. Fragouli and V. Sivaraman, Controlled multimedia wireless link sharing via enhanced class-based queueing with channel-state-dependent packet scheduling, in: Proc. of IEEE INFOCOM '98, San Francisco, CA (March 1998).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California at Los Angeles, Los Angeles, CA, 90095, USA

    Songwu Lu

  2. Coordinated Sciences Laboratory, University of Illinois at Urbana‐Champaign, Urbana, IL, 61801, USA

    Thyagarajan Nandagopal & Vaduvur Bharghavan

Authors
  1. Songwu Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thyagarajan Nandagopal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vaduvur Bharghavan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lu, S., Nandagopal, T. & Bharghavan, V. Design and analysis of an algorithm for fair service in error‐prone wireless channels. Wireless Networks 6, 323–343 (2000). https://doi.org/10.1023/A:1019158102489

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019158102489

Keywords

Search

Navigation