Abstract
Balanced fairness is a new resource sharing concept recently introduced by Bonald and Proutière. We extend the use of this notion to wireless networks where the link capacities at the flow level are not fixed but depend on the scheduling of transmission rights to interfering nodes on a faster time scale. The balance requirement together with the requirement of maximal use of the network’s resources jointly determine both a unique state-dependent scheduling and bandwidth sharing between the contending flows. The flow level performance under the resulting scheme is insensitive to detailed traffic characteristics, e.g., flow size distribution. The theoretical and computational framework is formulated and illustrated by two examples for which the performance in terms of average flow throughputs in a dynamic system is explicitly worked out.
Partly funded by Finnish Defence Forces Technical Research Center.
Supported by the Academy of Finland (grant n:o 80424)
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Mo, J., Walrand, J.: Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking 8 (2000) 556–567
Tassiulas, L., Sarkar, S.: Maxmin fair scheduling in wireless networks. In: Proc. IEEE INFOCOM 2002. (2002) 764–772
Huang, X., Bensaou, B.: On max-min fairness and scheduling in wireless ad hoc networks: analytical framework and implementation. In: Proc. ACM MobiHOC 2001. (2001) 221–231
Luo, H., Lu, S., Bharghavan, V.: A new model for packet scheduling in multihop wireless networks. In: Proc. ACM MOBICOM 2000. (2000) 76–86
Bonald, T., Proutière, A.: Insensitive bandwidth sharing in data networks. Queuing Systems 44 (2003) 69–100
Bonald, T., Proutière, A.: Insensitivity in processor-sharing networks. Performance Evaluation 49 (2002) 193–209
Bonald, T., Proutière, A.: On performance bounds for balanced fairness. Performance Evaluation 55 (2004) 25–50
Bonald, T., Proutière, A., Roberts, J., Virtamo, J.: Computational aspects of balanced fairness. In Charzinski et al., eds.: Providing Quality of Service in Heterogeneous Environments. Elsevier Science (2003) 801–810
Hajec, B., Sasaki, G.: Link scheduling in polynomial time. IEEE Transactions on Information Theory 34 (1988) 910–917
Arikan, E.: Some complexity results about packet radio networks. IEEE Transactions on Information Theory IT-30 (1984) 681–685
Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory 46 (2000) 388–404
Bron, C., Kerbosch, J.: Algorithm 457: Finding all cliques of an undirected graph. Communications of the ACM 16 (1973) 575–578
Diestel, R.: Graph Theory. Springer-Verlag (2000) Electronic Edition 2000, http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/.
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
Penttinen, A., Virtamo, J. (2004). Performance of Wireless Ad Hoc Networks under Balanced Fairness. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive