Abstract
We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. In general, our aim is to study the performance as perceived by users in a dynamic setting where data flows are generated randomly by users and cease upon completion. This task comprises two major difficulties: first, the behavior of random multi-access algorithms at slot-level in a multi-hop network is even more complex than in the case of a single hop hotspot. Second, in order to study user-level performance accounting for a dynamic population of flows, one has to first characterize the so-called rate region when the population is fixed. The rate region is defined by the set of rates at which the various active users can generate packets without inducing any instabilities in the network. Since links interact with each other through interference, characterizing the rate region is as difficult as studying the behavior of a set of interacting queues. In addition, the behavior of the congestion control algorithm must be taken into account since it impacts the set of active links and thus the interference. We propose a model, based on the so-called mean field approach, that circumvents both difficulties and allows the derivation of explicit expressions for the rate region.
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
Georgiadis, L., Neely, M., Tassiulas, L.: Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking 1(1), 1–144 (2006)
Bonald, T., et al.: A queueing analysis of max-min fairness, proportional fairness and balanced fairness. In: Queueing Systems (2006)
Bianchi, G.: Performance analysis of the IEEE 802.11 distributed coordination function. Journal on Selected Areas in Communications 18(3), 535–547 (2000)
Kar, K., Sarkar, S., Tassiulas, L.: Achieving proportionally fair rates using local information in aloha networks. IEEE Transactions on Automatic Control 49(10), 1858–1862 (2004)
Gupta, P., Stolyar, A.: Optimal throughput allocation in general random-access networks. In: Proceedings of the Conference on Information Systems and Sciences (CISS) (2006)
Wang, X., Kar, K.: Distributed algorithms for max-min fair rate allocation in aloha networks. In: Proceedings of the 42nd Annual Allerton Conference (2004)
Chaporkar, P., Kar, K., Sarkar, S.: Throughput guarantees through maximal scheduling in wireless networks. In: Proceedings of the 43nd Annual Allerton Conference (2005)
Luo, W., Ephremides, A.: Stability of n interacting queues in random-access systems. IEEE trans. on Information Theory 45(5), 1579–1587 (1999)
Szpankowski, W.: Stability conditions for some multiqueue distributed systems: Buffered random access systems. Advances in Applied Probability 26, 498–515 (1994)
Bonald, T., et al.: Wireless data performance in multi-cell scenarios. In: Proceedings of ACM Sigmetrics, ACM Press, New York (2004)
Tassiulas, L., Ephremides, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multi-hop radio networks. IEEE Transactions on Automatic Control, 1936–1948 (1992)
Bordenave, C., McDonald, D., Proutière, A.: Random multi-access algorithms: A mean field analysis. In: Proceedings of Allerton conference (2005)
Bonald, T., Proutiere, A.: Flow-level stability of utility-based allocations on non-convex rate region. In: Proceedings of the Conference on Information Systems and Sciences (CISS) (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Hegde, N., Proutiere, A. (2007). Performance Analysis of Wireless Multihop Data Networks. In: García-Vidal, J., Cerdà-Alabern, L. (eds) Wireless Systems and Mobility in Next Generation Internet. EuroNGI 2006. Lecture Notes in Computer Science, vol 4396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70969-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-70969-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70968-8
Online ISBN: 978-3-540-70969-5
eBook Packages: Computer ScienceComputer Science (R0)