By Topic

Dynamic Channel Assignment and Link Scheduling in Multi-Radio Multi-Channel Wireless Mesh Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hua Yu ; Department of Computer Science, University of California, Davis. Email: ; Prasant Mohapatra ; Xin Liu

Capacity limitation is one of the fundamental issues in wireless mesh networks. This paper addresses capacity improvement issues in multi-radio multi-channel wireless mesh networks. Our objective is to find a dynamic channel assignment and link schedule that maximizes the network capacity for ftp-type applications and video-type applications, respectively. Specifically, we minimize the number of time slots needed to schedule all the flows for ftp-type applications and maximize the minimal link satisfaction ratio for video-type applications. The problems are formulated as linear programming and we provide two heuristics to solve these problems. One heuristic uses a set covering strategy and the other uses a link-weight- adjusting strategy. We perform a trade-off analysis between network performance and hardware cost based on the number of radios and channels in different topologies. This work provides valuable insights for wireless mesh network designers during network planning and deployment.

Published in:

Mobile and Ubiquitous Systems: Networking & Services, 2007. MobiQuitous 2007. Fourth Annual International Conference on

Date of Conference:

6-10 Aug. 2007