Adaptive state-based multi-radio multi-channel multi-path routing in Wireless Mesh Networks

  • Authors:
  • Deepti S. Nandiraju;Nagesh S. Nandiraju;Dharma P. Agrawal

  • Affiliations:
  • Center for Distributed and Mobile Computing, Department of Computer Science, University of Cincinnati - Cincinnati, OH 45221, United States;Home and Networks Mobility, Motorola Inc., Horsham, PA, United States;Center for Distributed and Mobile Computing, Department of Computer Science, University of Cincinnati - Cincinnati, OH 45221, United States

  • Venue:
  • Pervasive and Mobile Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Wireless Mesh Networks (WMNs) are envisioned to seamlessly extend the network connectivity to end users by forming a wireless backbone that requires minimal infrastructure. Unfortunately for WMNs, frequent link quality fluctuations, excessive load on selective links, congestion, and limited capacity due to the half-duplex nature of radios are some key limiting factors that hinder their deployment. To address these problems, we propose a novel Adaptive State-based Multi-path Routing Protocol (ASMRP), which constructs Directed Acyclic Graphs (DAGs) from each Mesh Router (MR) to Internet Gateways (IGWs) and effectively discovers multiple optimal path set between any given MR-IGW pair. A congestion aware traffic splitting algorithm to balance traffic over these multiple paths is presented which synergistically improves the overall performance of the WMNs. We design a novel Neighbor State Maintenance module that innovatively employs a state machine at each MR to monitor the quality of links connecting its neighbors in order to cope with unreliable wireless links. We also employ a 4-radio architecture for MRs, which allows them to communicate over multiple radios tuned to non-overlapping channels and better utilize the available spectrum. Through extensive simulations using ns-2, we observe that ASMRP substantially improves the achieved throughput (~5 times gain in comparison to AODV), and significantly minimizes end-to-end latencies. We also show that ASMRP ensures fairness in the network under varying traffic load conditions.