Abstract
Fairness is an important design purpose for shared channel contention based MAC protocols, such as IEEE 802.11 in wireless networks. It is a complex problem due to its many dimensions that include consideration of location-dependent contention, spatial reuse of channels, and desire to achieve fully distributed scheduling in the wireless communication systems. This paper presents a distributed fairness supported scheduling algorithm (DFSS), which accounts for the received service of each flow and adjusts it’s backoff time to ensure getting a fair service. In DFSS, each node exchanges the flow’s average service index with neighbors as one parameter of determining backoff time. The main advantage of DFSS is that nodes only need to exchange little information to achieve global and local fairness.
This work was supported by INHA UNIVERSITY Research Grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, J., Somani, A.K.: Fair Scheduling in Wireless Ad-Hoc Networks of Location Dependent Channel Errors. In: IEEE International Conference of Performance, Computing and Communications, pp. 103–110 (2003)
Vaidya, N., Bahl, P., Gupta, S.: A Topology independent Fair Queueing Model in Ad Hoc Wireless Networks. In: IEEE Int. Conf. Network Protocols, pp. 325–335 (2000)
Luo, H., Medvedy, P., Cheng, J., Lu, S.: A Self-Coordinating Approach to Distributed Fair Queuing in Ad Hoc Wireless Networks. In: IEEE INFOCOM, pp. 1370–1379 (2001)
Zhai, H., Wang, J., Fang, Y.: Distributed packet scheduling for multihop flows in ad hoc networks. In: IEEE Wireless Communications and Networking Conference, pp. 1081–1086 (2004)
Vaidya, N., Bahl, P.: Distributed Fair Scheduling in a Wireless LAN. IEEE Transactions on Mobile Computing, 616–629 (2005)
Luo, H., Lu, S., Bharghavan, V.: A New Model for Packet. Scheduling in Multihop Wireless Networks. In: ACM Mobicom, pp. 76–86 (2000)
Chao, H.-L., Liao, W.: Fair Scheduling With QoS Support in Wireless Ad Hoc Networks. IEEE Transactions on Wireless Communications 3(6), 2119–2128 (2004)
Luo, H., Cheng, J., Lu, S.: Self-coordinating Localized Fair Queuing in Wireless Ad Hoc Networks. IEEE Transactions on Mobile Computing, 86–98 (2004)
Wu, X., Yuen, C., Gao, Y., Wu, H., Li, B.: Fair Scheduling With Bottleneck Consideration in Wireless Ad-hoc Networks. In: International Conference on Computer Communications and Networks, pp. 568–572 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, YQ., Roh, KM., Yoo, SJ. (2006). A Distributed Fairness Support Scheduling Algorithm in Wireless Ad Hoc Networks. In: Ma, J., Jin, H., Yang, L.T., Tsai, J.JP. (eds) Ubiquitous Intelligence and Computing. UIC 2006. Lecture Notes in Computer Science, vol 4159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11833529_30
Download citation
DOI: https://doi.org/10.1007/11833529_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38091-7
Online ISBN: 978-3-540-38092-4
eBook Packages: Computer ScienceComputer Science (R0)