ACM Home Page
Please provide us with feedback. Feedback
A channel and rate assignment algorithm and a layer-2.5 forwarding paradigm for multi-radio wireless mesh networks
Full text PdfPdf (1.14 MB)
Source IEEE/ACM Transactions on Networking (TON) archive
Volume 17 ,  Issue 1  (February 2009) table of contents
Pages 267-280  
Year of Publication: 2009
ISSN:1063-6692
Authors
Stefano Avallone  Department of Computer Engineering, University of Naples, Naples, Italy
Ian F. Akyildiz  Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA
Giorgio Ventre  Department of Computer Engineering, University of Naples, Naples, Italy
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 32,   Downloads (12 Months): 168,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: 10.1109/TNET.2008.918091

ABSTRACT

The availability of cost-effective wireless network interface cards makes it practical to design network devices with multiple radios which can be exploited to simultane-ously transmit/receive over different frequency channels. It has been shown that using multiple radios per node increases the throughput of multi-hop wireless mesh networks. However, multi-radios create several research challenges. A fundamental problem is the joint channel assignment and routing problem, i.e., how the channels can be assigned to radios and how a set of flow rates can be determined for every network link in order to achieve an anticipated objective. This joint problem is NP-com-plete. Thus, an approximate solution is developed by solving the channel assignment and the routing problems separately. The channel assignment problem turns out to be the problem to assign channels such that a given set of flow rates are schedulable and itself is shown to be also NP-complete. This paper shows that not only the channels but also the transmission rates of the links have to be properly selected to make a given set of flow rates schedulable. Thus, a greedy heuristic for the channel and rate assignment problem is developed. Algorithms to schedule the resulting set of flow rates have been proposed in the literature, which require synchronization among nodes and hence modified coordination functions. Unlike previous work, in this paper a forwarding paradigm is developed to achieve the resulting set of flow rates while using a standard MAC. A bi-dimensional Markov chain model of the proposed forwarding paradigm is presented to analyze its behavior. Thorough performance studies are con-ducted to: a) compare the proposed greedy heuristic to other channel assignment algorithms; b) analyze the behavior of the forwarding paradigm through numerical simulations based on the Markov chain model; c) simulate the operations of the forwarding paradigm and evaluate the achieved network throughput.


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
Y. Liu and E. Knightly, "Opportunistic fair scheduling over multiple wireless channels," in Proc. IEEE INFOCOM, 2003, vol. 2, pp. 1106-1115.
3
 
4
P. Kyasanur and N. H. Vaidya, "Routing and interface assignment in multi-channel multi-interface wireless networks," in Proc. IEEE WCNC, 2005, vol. 4, pp. 2051-2056.
5
 
6
A. Raniwala and T. Chiueh, "Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network," in Proc. IEEE IN-FOCOM, 2005, vol. 3, pp. 2223-2234.
 
7
M. Alicherry, R. Bhatia, and E. Li, "Joint channel assignment and routing for throughput optimization in multiradio wireless mesh net-works," IEEE J. Sel. Areas Commun., vol. 24, no. 11, pp. 1960-1971, Nov. 2006.
8
 
9
M. K. Marina and S. R. Das, "A topology control approach for uti-lizing multiple channels in multi-radio wireless mesh networks," in Proc. IEEE BroadNets, 2005, vol. 1, pp. 381-390.
 
10
K. N. Ramachandran, E. M. Belding, K. C. Almeroth, and M. M. Bud-dhikot, "Interference-aware channel assignment in multi-radio wireless mesh networks," in Proc. IEEE INFOCOM, 2006, pp. 1-12.
11
 
12
A. H. Mohsenian Rad and V. W. S. Wong, "Joint optimal channel as-signment and congestion control for multi-channel wireless mesh net-works," in Proc. IEEE ICC, 2006, vol. 5, pp. 1984-1989.
 
13
M. Chiang, "Balancing transport and physical layers in wireless mul-tihop networks: Jointly optimal congestion control and power control," IEEE J. Sel. Areas Commun., vol. 23, no. 1, pp. 104-116, 2005.
 
14
 
15
 
16
P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 388-404, Mar. 2000.
17
 
18
 
19
B. V. Cherkassky and A. V. Goldberg, "On implementing push-relabel method for the maximum flow problem," Algorithmica, vol. 19, pp. 390-410, 1997.
 
20
F. Ye, A. Chen, S. Lu, and L. Zhang, "A scalable solution to minimum cost forwarding in large sensor networks," in Proc. IEEE ICCCN, 2001, pp. 304-309.
 
21
 
22


Collaborative Colleagues:
Stefano Avallone: colleagues
Ian F. Akyildiz: colleagues
Giorgio Ventre: colleagues