ACM Home Page
Please provide us with feedback. Feedback
Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks
Full text PdfPdf (392 KB)
Source International Conference on Mobile Computing and Networking archive
Proceedings of the 11th annual international conference on Mobile computing and networking table of contents
Cologne, Germany
SESSION: Multi-radio, multi-channel communication table of contents
Pages: 58 - 72  
Year of Publication: 2005
ISBN:1-59593-020-5
Authors
Mansoor Alicherry  Bell Laboratories, Lucent Technologies
Randeep Bhatia  Bell Laboratories, Lucent Technologies
Li (Erran) Li  Bell Laboratories, Lucent Technologies
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 82,   Downloads (12 Months): 776,   Citation Count: 66
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080829.1080836
What is a DOI?

ABSTRACT

Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their single-hop counterpart, wireless LANs. 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Chaska wireless solutions. http://www.chaska.net/.
 
2
ILOG CPLEX mathematical programming optimizers. http://www.ilog.com/products/cplex/.
 
3
Meshdynamics inc. http://www.meshdynamics.com/.
 
4
5
6
7
 
8
R. Bhatia and M. Kodialam. On power efficient communication over multi-hop wireless networks: Joint routing, scheduling and power control. In Proc. IEEE INFOCOM, pages 1457--1466, 2004.
 
9
10
 
11
P. Gupta and P. R. Kumar. The Capacity of Wireless Networks. IEEE Transactions on Information Theory, IT-46(2):388--404, Mar. 2000.
12
13
14
 
15
S. Kravitz. Packing cylinders into cylindrical containers. In Math. Mag., volume 40, pages 65--70, 1967.
16
17
 
18
A. Raniwala and T.-C. Chiueh. Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network. In Proc. IEEE INFOCOM, 2005.
19

CITED BY  66

Collaborative Colleagues:
Mansoor Alicherry: colleagues
Randeep Bhatia: colleagues
Li (Erran) Li: colleagues