A topology-independent wireless fair queueing model in ad hoc networks

Fair queueing of rate and delay-sensitive packet flows in a shared-medium, multihop wireless network is challenging due to the unique design issues. These issues include: 1) spatial contention among transmitting flows in a spatial locality, as well as spatial reuse of bandwidth through concurrent flow transmissions in different network locations; 2) conflicts between ensuring fairness and maximizing spatial channel reuse; and 3) the distributed nature of ad hoc fair queueing. In this paper, we propose a new topology-independent fair queueing model for a shared-medium ad hoc network. Our fairness model ensures coordinated fair channel access among spatially contending flows, while seeking to maximize spatial reuse of bandwidth. We describe packetized algorithms that realize the fluid fairness model with analytical performance bounds. We further design a distributed implementation which approximates the ideal centralized algorithm. We present simulations and analysis on the performance of our proposed algorithms.

[1]  Imrich Chlamtac,et al.  Fair Algorithms for Maximal Link Activation in Multihop Radio Networks , 1987, IEEE Trans. Commun..

[2]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[3]  Ludek Kucera,et al.  The Greedy Coloring Is a Bad Probabilistic Algorithm , 1991, J. Algorithms.

[4]  Vaduvur Bharghavan,et al.  MACAW: a media access protocol for wireless LAN's , 1994, SIGCOMM 1994.

[5]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[6]  Songwu Lu,et al.  A wireless fair service algorithm for packet cellular networks , 1998, MobiCom '98.

[7]  V. Bharghavan.  Performance evaluation of algorithms for wireless medium access , 1998, Proceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248).

[8]  Parameswaran Ramanathan,et al.  Adapting packet fair queueing algorithms to wireless networks , 1998, MobiCom '98.

[9]  Victor O. K. Li,et al.  An optimal topology-transparent scheduling method in multihop packet radio networks , 1998, TNET.

[10]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1999, TNET.

[11]  J. J. Garcia-Luna-Aceves,et al.  A protocol for topology-dependent transmission scheduling in wireless networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[12]  Haiyun Luo,et al.  A new model for packet scheduling in multihop wireless networks , 2000, MobiCom '00.

[13]  Vaduvur Bharghavan,et al.  Achieving MAC layer fairness in wireless packet networks , 2000, MobiCom '00.

[14]  Haiyun Luo,et al.  A self-coordinating approach to distributed fair queueing in ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Brahim Bensaou,et al.  On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation , 2001, MobiHoc.

[16]  Edward W. Knightly,et al.  Ordered packet scheduling in wireless ad hoc networks: mechanisms and performance analysis , 2002, MobiHoc '02.

[17]  Edward W. Knightly,et al.  Opportunistic media access for multirate ad hoc networks , 2002, MobiCom '02.

[18]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[19]  Nitin H. Vaidya,et al.  Priority Scheduling in Wireless Ad Hoc Networks , 2006, Wirel. Networks.