Abstract
Traffic routing plays a critical role in determining the performance of a wireless mesh network. Recent research results usually fall into two ends of the spectrum. On one end are the heuristic routing algorithms, which are highly adaptive to the dynamic environments of wireless networks yet lack the analytical properties of how well the network performs globally. On the other end are the optimal routing algorithms that are derived from the optimization problem formulation of mesh network routing. They can usually claim analytical properties such as resource use optimality and throughput fairness. However, traffic demand is usually implicitly assumed as static and known a priori in these problem formulations. In contrast, recent studies of wireless network traces show that the traffic demand, even being aggregated at access points, is highly dynamic and hard to estimate. Thus, to apply the optimization-based routing solution in practice, one must take into account the dynamic and uncertain nature of wireless traffic demand. There are two basic approaches to address the traffic uncertainty in optimal mesh network routing (1) predictive routing that infers the traffic demand with maximum possibility based in its history and optimizes the routing strategy based on the predicted traffic demand and (2) oblivious routing that considers all the possible traffic demands and selects the routing strategy where the worst-case network performance could be optimized. This chapter provides an overview of the optimal routing strategies for wireless mesh networks with a focus on the above two strategies that explicitly consider the traffic uncertainty. It also identifies the key factors that affect the performance of each routing strategy and provides guidelines towards the strategy selection in mesh network routing under uncertain traffic demands.
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
Seattle wireless. http://www.seattlewireless.net
Mit roofnet. http://www.pdos.lcs.mit.edu/roofnet/
R. Draves, J. Padhye, and B. Zill, Routing in multi-radio, multi-hop wireless mesh networks. Proc. ACM Mobicom (2004).
S. Biswas and R. Morris, Exor: Opportunistic multi-hop routing for wireless networks. Proc. ACM SIGCOMM (2005).
A. Raniwala and T. Chiueh, Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network. Proc. IEEE INFOCOM (2005).
Wu, H. Yang, F. Tan, K. Chen, J. Zhang, Q. Zhang: Z. (2006).Distributed Channel Assignment and Routing in Multi-radio Multi- channel Multi-hop Wireless Networks. IEEE JSAC, Special issue on multi-hop wireless mesh networks 24(11), 1972–1983
M. Alicherry, R. Bhatia, and L. Li, Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks. Proc. ACM MobiCom (2005).
J. Tang, G. Xue, and W. Zhang, Maximum throughput and fair bandwidth allocation in multichannel wireless mesh networks. Proc. IEEE INFOCOM (2006).
X. Meng, S.H.Y. Wong, Y. Yuan, and S. Lu, Characterizing flows in large wireless data networks. Proc. ACM MobiCom (2004).
L. Dai, Y. Xue, B. Chang, and Y. Cui, Throughput optimization routing under uncertain demand for wireless mesh networks. Proc. IEEE MASS (2007).
L. Dai, Y. Xue, B. Chang, Y. Cao, and Y. Cui, Integrating traffic estimation and routing optimization for multi-radio multi-channel wireless mesh networks. Proc. IEEE INFOCOM (2008).
J. Wellons, L. Dai, Y. Xue, and Y. Cui, Predictive or oblivious: A comparative study of routing strategies for wireless mesh networks under uncertain demands. Vanderbilt Technical Report http://vanets.vuse.vanderbilt.edu/xue/publication-files/secon-08-report.pdf (2007).
P. Gupta and P. Kumar, The capacity of wireless networks. IEEE Trans. Inform. Theory 388–404 (2000).
K. Jain, J. Padhye, V. Padmanabhan, and L. Qiu, Impact on interference on multi-hop wireless network performance. Proc. Mobicom (2003).
V.S.A. Kumar, M.V. Marathe, S. Parthasarathy, and A. Srinivasan, Algorithmic aspects of capacity in wireless networks. Proc. ACM SIGMETRICS, 133–144 (2005).
Xue, Y. Li, B. Nahrstedt, K. (2006).Optimal resource allocation in wireless ad hoc networks: A price-based approach. IEEE Trans. Mobile Comput. 5(4), 347–364
H. Wang, H. Xie, L. Qiu, Y.R. Yang, Y. Zhang, and A. Greenberg, Cope: traffic engineering in dynamic networks. Proc. ACM SIGCOMM (2006).
Ilog cplex mathematical programming optimizers. http://www.ilog.com/products/cplex
The lp solve mixed integer linear programming (milp) solver. http://lpsolve.sourceforge.net/5.5/
A community resource for archiving wireless data at dartmouth. http://crawdad.cs.dartmouth.edu/
D. Applegate and E. Cohen, Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. Proc. ACM SIGCOMM, 313–324 (2003).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag London
About this chapter
Cite this chapter
Wellons, J., Dai, L., Chang, B., Xue, Y. (2009). Wireless Mesh Network Routing Under Uncertain Demands. In: Misra, S., Misra, S.C., Woungang, I. (eds) Guide to Wireless Mesh Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84800-909-7_7
Download citation
DOI: https://doi.org/10.1007/978-1-84800-909-7_7
Publisher Name: Springer, London
Print ISBN: 978-1-84800-908-0
Online ISBN: 978-1-84800-909-7
eBook Packages: Computer ScienceComputer Science (R0)