Abstract
To provide scheduling in wireless ad hoc networks, that is both highly efficient and fair in resource allocation, is not a trivial task because of the unique problems in wireless networks such as location dependent and bursty errors in wireless link. A packet flow in such a network may be unsuccessful if it experiences errors. This may lead to situations in which a flow receives significantly less service than it is supposed to, while other receives more, making it difficult to provide fairness. In this paper we propose a QoS-aware fair scheduling mechanism in ad hoc networks considering guaranteed and best-effort flows in the presence of link errors. The proposed mechanism provides short-term fairness for error free sessions and long-term fairness for the erroneous sessions and allows a lagging flow to receive extra service and a leading flow to give up its extra service in a graceful way. It also maximizes the resource utilization by allowing spatial reuse of resource. We also propose a CSMA/CA based implementation of our proposed method.
This work was supported by MIC and ITRC Project.
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
Demers, A., Keshav, S., Shenker, S.: Analysis and simulation of a fair queueing algorithm. In: ACM SIGCOMM, pp. 1–12 (1989)
Lu, S., Bharghavan, V., Srikant, R.: Fair scheduling in wireless packet networks. IEEE/ACM Transaction On Networking 7, 473–489 (1999)
Ng, T.S., Stoica, I., Zhang, H.: Packet fair queueing algorithms for wireless networks with location-dependent errors. In: IEEE INFOCOM, pp. 1103–1111 (1998)
Ramanathan, P., Agrawal, P.: Adapting packet fair queueing algorithms to wireless networks. In: ACM MOBICOM, pp. 1–9 (1998)
Luo, H., Lu, S.: A self-coordinating approach to distributed fair queueing in ad hoc wireless networks. In: IEEE INFOCOM, pp. 1370–1379 (2001)
Luo, H., Lu, S.: A topology-independent fair queueing model in ad hoc wireless networks. In: IEEE Int. Conf. Network Protocols, pp. 325–335 (2000)
Chao, H.L., Liao, W.: Credit-based fair scheduling in wireless ad hoc networks. In: IEEE Vehicular Technology Conf. (2002)
Cheng, J., Lu, S.: Achieving Delay and Throughput Decoupling in Distributed Fair Queueing Over Ad Hoc Networks. In: IEEE ICCCN (2003)
Chao, H.L., Liao, W.: Fair Scheduling With QoS Support in Wireless Ad Hoc Networks. IEEE Trans. on Wireless Comm. 3 (2004)
Goyal, P., Vin, H.M., Chen, H.: Start-time fair queueing: A scheduling algorithm for integrated service access. In: ACM SIGCOMM (1996)
Perkins, C., Belding-Royer, E., Das, S.: Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561 (2003)
Bharghavan, V., Demers, A., Shenker, S., Zhang, L.: MACAW: A Medium Access Protocol for Wireless LANs. In: ACM Ann. Conf. Special Interest Group on Data Comm (SIGCOMM) (1994)
Ng, T.S.E., Stoica, I., Zhang, H.: Packet Fair Queueing Algorithms for Wireless Networks with location-Dependent Errors. In: IEEE INFOCOM (1999)
Lu, S., Bharghavan, V., Srikant, R.: Fair Scheduling in Wireless Packet Networks. IEEE/ACM Transaction On Networking 7 (1999)
Chao, H.L., Liao, W.: Fair Scheduling in Mobile Ad Hoc Networks with Channel Errors. IEEE Transaction of Wireless Communications 4 (2005)
Alam, M.M., Rashid, M.M., Hong, C.S.: Distributed Coordination and Fair Queueing in Wireless Ad Hoc Networks. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3981, pp. 651–660. Springer, Heidelberg (2006)
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
Alam, M.M., Mamun-or-Rashid, M., Hong, C.S. (2006). QoS-Aware Fair Scheduling in Wireless Ad Hoc Networks with Link Errors. In: Kim, YT., Takano, M. (eds) Management of Convergence Networks and Services. APNOMS 2006. Lecture Notes in Computer Science, vol 4238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11876601_1
Download citation
DOI: https://doi.org/10.1007/11876601_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45776-3
Online ISBN: 978-3-540-46233-0
eBook Packages: Computer ScienceComputer Science (R0)