Abstract
In a half duplex mobile Ad-Hoc networks, fair allocation of bandwidth and maximisation of channel utilisation are two antagonistic parameters. In this paper, we propose to use a maximal clique based scheduling algorithm with one control parameter. This algorithm permits to adjust the balance spot between fairness and throughput. A theoretical proof of the algorithm’s behaviour will be done. We will apply this algorithm to an Ad-Hoc wireless network in some relevant cases.
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.
Similar content being viewed by others
References
Augustson, J.G., Radhakrishnan, J.: An analysis of some graph theoretical cluster techniques. Journal of the Association for Computing Machinery 17(4), 571–586 (1970)
Lu, S., Bharghavan, V., Srikant, R.: Fair scheduling in wireless packet networks. IEEE Trans. Networking (August 1999)
Luo, H., Lu, S., Bharghavan, V.: A new model for packet scheduling in multi-hop wireless networks. In: ACM MOBICOM 2000 (August 2000)
Luo, H., Lu, S.: A topology-independent fair queueing model in ad hoc wireless networks. In: IEEE ICNP 2000 (November 2000)
Ramanathan, P., Agrawal, P.: Adapting packet fair queueing algorithms to wireless networks. In: ACM MOBICOM 1998 (October 1998)
Ma, T., Zhang, X., Chen, G.: A Maximal Clique Based Packet Scheduling Algorithm in Mobile Ad Hoc Networks. In: IEEE ICN 2004 (February 29-March 4, 2004)
Tassiulas, L., Sarkar, S.: Max-min fair scheduling in wireless networks. In: IEEE INFOCOM 2002 (2002)
Vaidya, N., Bahl, P., Gupta, S.: Distributed fair scheduling in a wireless lan. In: ACM MOBICOM 2000 (August 2000)
Wu, X., Yuen, C., Gao, Y., Wu, H., Li, B.: Fair Scheduling with Bottleneck Consideration in wireless Ad-hoc Networks. In: IEEE ICCCN 2001 (October 2001)
Wang, Y., Garcia-Luna-Aceves, J.J.: Throughput and fairness in a hybrid channel access scheme for ad hoc networks. In: WCNC 2003 - IEEE Wireless, Communication and networking conference, March 2003, vol. 1, pp. 988–993 (2003)
Jafar, S.A., Goldsmith, A.: Adaptative multirate CDMA for uplink throughput maximization. IEEE Transactions on wireless communications 2, 218–228 (2003)
Fang, Z.Y., Bensaou, B.: A novel topology-blind fair medium access control for wireless LAN and ad hoc networks. In: ICC 2003 - IEEE International conference on communications, May 2003, vol. 1, pp. 1129–1134 (2003)
Wang, L., Kwok, Y.-K., Lau, W.-C., Lau, V.K.N.: On channeladaptative fair multiple access control. In: ICC 2003 - IEEE International conference on communications, May 2003, vol. 1, pp. 276–280 (2003)
Wen, J.T., Arcak, M.: A unifying passivity framework for network flow control. In: IEEE INFOCOM 2003 - The conference on computer communications, March 2003, vol. 1, pp. 1156–1166 (2003)
Ofuji, Y., Abeta, S., Sawahashi, M.: Fast packet scheduling algorithm based on instantaneous SIR with constraint condition assuring minimum throughput in forward link. In: WCNC 2003 - IEEE Wireless communications and networking conference, March 2003, vol. 1, pp. 860–865 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilg, M., Lorenz, P. (2004). An Adjustable Scheduling Algorithm in Wireless Ad Hoc Networks. In: Freire, M.M., Chemouil, P., Lorenz, P., Gravey, A. (eds) Universal Multiservice Networks. ECUMN 2004. Lecture Notes in Computer Science, vol 3262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30197-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-30197-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23551-4
Online ISBN: 978-3-540-30197-4
eBook Packages: Springer Book Archive