Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks

By M. Alicherry, Randeep Bhatia, Erran L. Li. IEEE Journal on Selected Areas in Communications, 2005

1,382 citations recorded by the source corpus.

Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of close-by transmissions; effective routing schemes can alleviate potential congestion on any gateways to the Internet, thereby improving per-client throughput. Unlike previous heuristic approaches, we mathematically formulate the joint channel assignment and routing problem, taking into account the interference constraints, the number of channels in the network, and the number of radios available at each mesh router. We then use this formulation to develop a solution for our problem that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients. We show that the performance of our algorithms is within a constant factor of that of any optimal algorithm for the joint channel assignment and routing problem. Our evaluation demonstrates that our algorithm can effectively exploit the increased number of channels and radios, and it performs much better than the theoretical worst case bounds

Subfields: Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/0f7936242a8f35eb0b751582f57be317a9d84696

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

Citations in the corpus

Efficient interference-aware TDMA link scheduling for static wireless networks (2006, methodology): “The proofs of the above theorems are similar to those of [1, 17, 21] for other interference and networking models, and are thus omitted here due to space limit.”
A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks (2005, background): “Trafficaware channel assignment (taken in [8] [9] [10] [11]), on the other hand, is affected by the traffic condition in the network and therefore is based on ''actual " interference.”
Spectrum Sharing for Multi-Hop Networking with Cognitive Radios (2008, background): “A closely related line of research is the so-called multichannel multi-radio (MC-MR) networks (e.g., [1], [5], [15], [16], [24]).”
A General Framework for Wireless Spectrum Auctions (2007, background): “The works of [1], [6], [18] have provided polynomial time approximation algorithms with provable performance guarantees for the same throughput maximization problem.”
SEARCH: A routing protocol for mobile cognitive radio ad-Hoc networks (2009, background): “This radius is shown by R4; . . . ;R8 for the WLAN channels Ch : 4; . . . ;8, respectively.”
Partially overlapped channels not considered harmful (2006, methodology): “This is supported by an approximation algorithm presented in [6] which gives an interference free schedule.”
Fairness in Wireless Networks:Issues, Measures and Challenges (2014, background): “For instance in [90], routing protocols are combined with fair channel assignment.”
Minimum Interference Channel Assignment in Multiradio Wireless Mesh Networks (2008, background): “The authors in [15], [16], [ 17 ], and [18] address joint channel assignment, routing, and scheduling problems.”
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks (2005, methodology): “A parallel work in [33] attempts to solve the throughput maximization problem for a MC-MR network, where the network is restricted to be a subset of (r, s) civilized graph, i.”
Cross-layer optimization for energy-efficient wireless communications: a survey (2009, methodology): “In the context of unicast communications, the CA problem can be classified into three approaches: (1) routing first, CA second [8,9]; (2) CA first, routing second [6,40,41]; and (3) joint CA and routing [ 5 ,42].”
Distributed Channel Assignment in Multi-Radio 802.11 Mesh Networks (2007, background): “considered in [1], and an approach that preserves network connectivity for QoS is explored in [13].”