THESIS
2011
viii, 41 p. : ill. (some col.) ; 30 cm
Abstract
The performance of multi-radio multi-channel (MRMC) wireless mesh networks (WMNs) largely depends on their routing and channel assignment. Because routing and channel decisions are coupled tightly, they need to be jointly optimized to achieve the highest performance. This is the so-called routing and channel assignment (RCA) problem, which is known to be NP-hard. Most previous approaches addressing the problem either are centralized in nature or consider routing and channel decisions separately. There has been insufficient consideration on distributed and joint RCA optimization which takes into account of traffic demand in the network. In this thesis, we propose and study CRAG (Channel and Routing Assignment based on Game) for MRMC WMN. CRAG is game-based, simple, distributed and highly...[
Read more ]
The performance of multi-radio multi-channel (MRMC) wireless mesh networks (WMNs) largely depends on their routing and channel assignment. Because routing and channel decisions are coupled tightly, they need to be jointly optimized to achieve the highest performance. This is the so-called routing and channel assignment (RCA) problem, which is known to be NP-hard. Most previous approaches addressing the problem either are centralized in nature or consider routing and channel decisions separately. There has been insufficient consideration on distributed and joint RCA optimization which takes into account of traffic demand in the network. In this thesis, we propose and study CRAG (Channel and Routing Assignment based on Game) for MRMC WMN. CRAG is game-based, simple, distributed and highly effective. CRAG achieves high performance because it jointly optimizes routing and channel assignment by using a properly designed payoff function to maximize the throughput given the traffic of the network. CRAG is computationally efficient and fully implementable, and provably converges. Simulation results based on NS3 show that CRAG performs much better than other state-of-the-art schemes in terms of convergence, delay, loss rate and throughput.
Post a Comment