Abstract
This is a summary of the authors PhD thesis supervised by Hervé Rivano and defended on 29 October 2009 at the Université de Nice-Sophia Antipolis. The thesis is written in French and is available from http://tel.archives-ouvertes.fr/tel-00428940/. This work deals with the optimization of the capacity of wireless mesh networks, defined as the throughput offered to each flow. We develop optimization models integrating the cross-layer characteristics of radio communications. The joint routing and scheduling is studied and solved using column generation. A linear formulation focusing on the transport capacity available on the network cuts is derived. We prove the equivalence of the models, and adapt the resolution method into a cross line and column generation process. Thorough tests, a contention area located around the gateways which constraints the capacity is highlighted. These results are applied to a quantitative study of the effects of acknowledgments on the capacity. Finally, a stability study of a protocol routing a traffic injected arbitrarily is investigated.
Similar content being viewed by others
References
Akyildiz I, Wang X, Wang W (2005) Wireless mesh networks: a survey. Comput Netw 47(4): 445–487
Carello G, Filippini I, Gualandi S, Malucelli F (2007) Scheduling and routing in wireless multi-hop networks by column generation. In: INOC
Karnik A, Iyer A, Rosenberg C (2008) Throughput-optimal configuration of fixed wireless networks. IEEE/ACM Trans Netw 16(5): 1161–1174
Klasing R, Morales N, Pérennes S (2008) the complexity of bandwidth allocation in radio networks. Theor Comput Sci 406(3): 225–239
Kumar A, Marathe M, Parthasarathy S, Srinivasan A (2005) Algorithmic aspects of capacity in wireless networks. In: ACM SIGMETRICS
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Molle, C. Optimization of the capacity of wireless mesh networks. 4OR-Q J Oper Res 8, 425–428 (2010). https://doi.org/10.1007/s10288-010-0132-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-010-0132-x