Service index-based fairness scheduling in wireless ad hoc networks

Authors:
Yong-Qian Chen;Kwen-mun Roh;Sang-Jo Yoo
Affiliations:
Multimedia Network Laboratory, Graduate School of Information Technology and Telecommunications, Inha University, 253 YongHyun-dong, Nam-ku, Incheon 402-751, Republic of Korea;Multimedia Network Laboratory, Graduate School of Information Technology and Telecommunications, Inha University, 253 YongHyun-dong, Nam-ku, Incheon 402-751, Republic of Korea;Multimedia Network Laboratory, Graduate School of Information Technology and Telecommunications, Inha University, 253 YongHyun-dong, Nam-ku, Incheon 402-751, Republic of Korea
Venue:
Computer Communications
Year:
2006

Citing 6
Cited 0

Fair scheduling in wireless packet networks

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
A new model for packet scheduling in multihop wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Fair Scheduling with QoS Support in Ad Hoc Networks

LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
A topology-independent fair queueing model in ad hoc wireless networks

ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Self-Coordinating Localized Fair Queueing in Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
Maxmin fair scheduling in wireless ad hoc networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Fairness is an important design purpose for shared channel contention-based MAC protocols, such as IEEE 802.11 in wireless networks. Yet, it is a complex problem due to its many dimensions that include consideration of location-dependent contention, spatial reuse of channels, and the desire to achieve fully distributed scheduling in wireless communication systems. Accordingly, this paper presents a received service index-based fairness scheduling algorithm (SIB-FS) that accounts for the service received by each flow and adjusts the backoff time to ensure a fair service. In SIB-FS, each node exchanges the node's average service index with its neighbors as a parameter to determine the backoff time. The main advantage of SIB-FS is that the nodes only need to exchange a little information to achieve global and local fairness. ns-2 is used to simulate the SIB-FS and achieve the desired fairness and throughput.