Fair scheduling in mobile ad hoc networks with channel errors

We study fair scheduling in ad hoc networks, accounting for channel errors. Since wireless channels are susceptible to failures, to ensure fairness, it may be necessary to compensate those flows on error-prone channels. Existing compensation mechanisms need the support of base stations and only work for one-hop wireless channels. Therefore, they are not suitable for multihop wireless networks. Existing fair scheduling protocols for ad hoc networks can be classified into timestamp-based and credit-based approaches. None of them takes channel errors into account. We investigate the compensation issue of fair scheduling and propose a mechanism called Timestamp-Based Compensation Protocol (TBCP) for mobile ad hoc networks. We evaluate the performance of TBCP by simulation and analyze its long-term throughput. The results show that our analytical result provides accurate performance estimation for TBCP.

[1]  E. O. Elliott.  Estimates of error rates for codes on burst-noise channels , 1963 .

[2]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[3]  Ion Stoica,et al.  Queueing Algorithms for Wireless with Location-Dependent Errors , 1998 .

[4]  Dong Zhou,et al.  Efficient,and scalable IEEE 802.11 ad-hoc-mode timing synchronization function , 2003, 17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003..

[5]  Victor O. K. Li,et al.  Scheduling algorithms in broadband wireless networks , 2001, Proc. IEEE.

[6]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[7]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM 1996.

[8]  Klara Nahrstedt,et al.  Distributed quality-of-service routing in ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[9]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[11]  Haiyun Luo,et al.  A topology-independent fair queueing model in ad hoc wireless networks , 2000, Proceedings 2000 International Conference on Network Protocols.

[12]  Kiseon Kim,et al.  Channel error and handoff compensation scheme for fair queueing algorithms in wireless networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

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

[14]  Victor O. K. Li,et al.  Wireless packet scheduling for two-state link models , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[16]  Lifei Huang,et al.  On the scalability of IEEE 802.11 ad hoc networks , 2002, MobiHoc '02.

[17]  Wanjiun Liao,et al.  Fair scheduling with QoS support in ad hoc networks , 2002, 27th Annual IEEE Conference on Local Computer Networks, 2002. Proceedings. LCN 2002..

[18]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1997, TNET.

[19]  Jain-Shing Liu,et al.  QoS routing in ad hoc wireless networks , 1999, IEEE J. Sel. Areas Commun..

[20]  Wanjiun Liao,et al.  Credit-based slot allocation for multimedia mobile ad hoc networks , 2003, IEEE J. Sel. Areas Commun..