Adaptive Optimization-based Routing in Wireless Mesh Networks

Authors:
Yajun Li;Yunfeng Xiong;Liang Zhou;Rongbo Zhu
Affiliations:
Electronic Engineering Department, Shanghai Jiaotong University, Shanghai, China 200240;Electronic Engineering Department, Shanghai Jiaotong University, Shanghai, China 200240;Laboratory of UEI, ENSTA-ParisTech, Paris, France;College of Computer Science, South-Central University for Nationalities, Wuhan, China 430074
Venue:
Wireless Personal Communications: An International Journal
Year:
2011

Citing 8
Cited 0

Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem

Proceedings of the 9th annual international conference on Mobile computing and networking
Impact of interference on multi-hop wireless network performance

Proceedings of the 9th annual international conference on Mobile computing and networking
Comparison of routing metrics for static multi-hop wireless networks

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Hop-by-hop congestion control over a wireless multi-hop network

IEEE/ACM Transactions on Networking (TON)
A survey on wireless mesh networks

IEEE Communications Magazine
QoS routing in ad hoc wireless networks

IEEE Journal on Selected Areas in Communications
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications
Adaptive Routing Strategies in IEEE 802.16 Multi-Hop Wireless Backhaul Networks Based On Evolutionary Game Theory

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing is a critical component in wireless mesh networks. The inherent shared-medium nature of the wireless mesh networks, however, poses fundamental challenges to the design of effective routing policies that are optimal with respect to the resource utilization. Node churns and traffic fluctuations exacerbate such a problem. In this paper, we propose a novel adaptive routing algorithm for multiple subscribers in wireless mesh networks. We view a mesh network with multiple nodes as an entity that optimizes some global utility function constrained by the underlying MAC layer interference. By solving the optimization problem, the network is driven to an efficient operating point with a certain routing policies for each node. We then use this operating point information to adaptively find better paths, which is able to gear the network towards optimal routing. Further, we take the fluctuations of the network into consideration and thus render our algorithm more robust for a variety of network situations. Simulations demonstrate the efficiency and efficacy of our algorithm.