A distributed laxity-based priority scheduling scheme for time-sensitive traffic in mobile ad hoc networks

Abstract Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a very important role as far as QoS is concerned. The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. We have proposed a new MAC layer protocol that includes a laxity-based priority scheduling scheme and an associated back-off scheme, for supporting time-sensitive traffic. In the proposed scheduling scheme, we select the next packet to be transmitted, based on its priority value which takes into consideration the uniform laxity budget of the packet, the current packet delivery ratio of the flow to which the packet belongs, and the packet delivery ratio desired by the user. The back-off mechanism devised by us grants a node access to the channel, based on the rank of its highest priority packet in comparison to other such packets queued at nodes in the neighborhood of the current node. We have studied the performance of our protocol that combines a packet scheduling scheme and a channel access scheme through simulation experiments, and the simulation results show that our protocol exhibits a significant improvement in packet delivery ratio under bounded end-to-end delay requirements, compared to the existing 802.11 DCF and the Distributed Priority Scheduling scheme proposed recently in [ACM Wireless Networks Journal 8 (5) (2002) 455–466; Proceedings of ACM MOBICOM '01, July 2001, pp. 200–209].

[1]  Tomasz Imielinski,et al.  Mobile Computing , 1996 .

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

[3]  Lisa Zhang,et al.  Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Kai-Yeung Siu,et al.  A distributed scheduling algorithm for quality of service support in multiaccess networks , 1999, Proceedings. Seventh International Conference on Network Protocols.

[5]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[6]  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).

[7]  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.

[8]  Paramvir Bahl,et al.  Distributed fair scheduling in a wireless LAN , 2000, IEEE Transactions on Mobile Computing.

[9]  Edward W. Knightly,et al.  Distributed multi-hop scheduling and medium access with delay and throughput constraints , 2001, MobiCom '01.

[10]  R. Srikant,et al.  Fair scheduling in wireless packet networks , 1997, SIGCOMM '97.

[11]  Edward W. Knightly,et al.  Distributed Priority Scheduling and Medium Access in Ad Hoc Networks , 2002, Wirel. Networks.