ACM Home Page
Please provide us with feedback. Feedback
Interference-aware topology control and QoS routing in multi-channel wireless mesh networks
Full text PdfPdf (280 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing table of contents
Urbana-Champaign, IL, USA
SESSION: Topology control & mobility table of contents
Pages: 68 - 77  
Year of Publication: 2005
ISBN:1-59593-004-3
Authors
Jian Tang  Arizona State University, Tempe, AZ
Guoliang Xue  Arizona State University, Tempe, AZ
Weiyi Zhang  Arizona State University, Tempe, AZ
Sponsors
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 45,   Downloads (12 Months): 455,   Citation Count: 26
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/1062689.1062700
What is a DOI?

ABSTRACT

The throughput of wireless networks can be significantly improved by multi-channel communications compared with single-channel communications since the use of multiple channels can reduce interference influence. In this paper, we study interference-aware topology control and QoS routing in IEEE 802.11-based multi-channel wireless mesh networks with dynamic traffic. Channel assignment and routing are two basic issues in such networks. Different channel assignments can lead to different network topologies. We present a novel definition of co-channel interference. Based on this concept, we formally define and present an effective heuristic for the minimum INterference Survivable Topology Control (INSTC) problem which seeks a channel assignment for the given network such that the induced network topology is interference-minimum among all K-connected topologies. We then formulate the Bandwidth-Aware Routing (BAR) problem for a given network topology, which seeks routes for QoS connection requests with bandwidth requirements. We present a polynomial time optimal algorithm to solve the BAR problem under the assumption that traffic demands are splittable. For the non-splittable case, we present a maximum bottleneck capacity path routing heuristic. Simulation results show that compared with the simple common channel assignment and shortest path routing approach, our scheme improves the system performance by 57% on average in terms of connection blocking ratio.


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
 
2
 
3
P. Bahl, Opportunities and challenges of community mesh networking, Keynote Presentation @ MICS Workshop in ETH Zurich, 2004.
 
4
V. Bahl, A. Adya, J. Padhye, A. Wolman. Reconsidering the wireless LAN platform with multiple radios, Workshop on Future Directions in Network Architecture, 2003.
5
 
6
7
8
 
9
S. Even, An algorithm for determining whether the connectivity of a graph is at least k, SIAM Journal of Computing Vol. 4(1975), pp. 393--396.
 
10
S. Guo, O. Yang, QoS-aware minimum energy multicast tree construction in wireless ad hoc networks, Elsevier Journal of Ad Hoc Networks, Vol. 2(2004), pp. 217--229.
 
11
P. Gupta, P. R. Kumar, The capacity of wireless networks, IEEE Transactions on Information Theory, Vol. 46(2000), pp. 388--404.
 
12
IEEE 802.11 Working Group, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, 1997.
 
13
IEEE 802.11a Working Group, Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications - Amendment 1: High-speed Physical Layer in the 5 GHz band, 1999.
14
 
15
P. Kyasanur, N. H. Vaidya, Routing and interface assignment in multi-channel multi-interface wireless networks, Proceedings of WCNC'2005.
 
16
W. H. Liao, Y. C. Tseng, K. P. Shih, A TDMA-based bandwidth reservation protocol for QoS routing in a wireless mobile ad hoc network, Proceedings of IEEE ICC'2002, pp. 3186--3190.
 
17
C. R. Lin, J. S. Liu, QoS routing in ad hoc wireless networks, IEEE Journal on Selected Areas in Communications Vol. 17(1999), pp. 1426--1438.
 
18
H. Liu, X. Jia, D. Li, C. H. Lee, Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks, Elsevier Journal of Ad Hoc Networks(2005), In press.
 
19
K. Moaveninejad, X. Y. Li, Low-interference topology control for wireless ad hoc networks, Journal of Ad Hoc and Sensor Wireless Networks(2005), Accepted for publication.
 
20
C. E. Perkins, E. M. Royer, S. R. Das, Quality of service for ad hoc on-demand distance vector routing (work in progress), IETF Internet Draft, 2000.
 
21
A. Raniwala, T. Chiueh, Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network, Proceedings of IEEE INFOCOM'2005.
22
23
 
24
J. So, N. H. Vaidya, A routing protocol for utilizing multiple channels in multi-hop wireless networks with a single transceiver, UIUC Technical Report, 2004. Available at: http://www.crhc.uiuc.edu/wireless/groupPubs.html
 
25
 
26
H. Zhai, J. Wang, Y. Fang, Distributed packet scheduling for multihop flows in ad hoc networks,Proceedings of IEEE WCNC'2004, pp. 1081--1086.
 
27
C. Zhu, S. Corson, QoS routing for mobile ad hoc networks, Proceedings of IEEE INFOCOM'2002, pp. 958--967.

CITED BY  28

Collaborative Colleagues:
Jian Tang: colleagues
Guoliang Xue: colleagues
Weiyi Zhang: colleagues