For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Chordal Graph Based Channel Assignment for Multicast and Unicast Traffic in Wireless Mesh Networks
Junfeng JIN Yusheng JI Baohua ZHAO Hao ZHOU
IEICE TRANSACTIONS on Communications
Publication Date: 2010/12/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Section on Wireless Distributed Networks)
channel assignment, minimal triangulation, multiple radios, wireless mesh networks,
Full Text: PDF(752.6KB)
>>Buy this Article
With the increasing popularity of multicast and real-time streaming service applications, efficient channel assignment algorithms that handle both multicast and unicast traffic in wireless mesh networks are needed. One of the most effective approaches to enhance the capacity of wireless networks is to use systems with multiple channels and multiple radio interfaces. However, most of the past works focus on vertex coloring of a general contention graph, which is NP-Complete, and use the greedy algorithm to achieve a suboptimal result. In this paper, we combine unicast and multicast with a transmission set, and propose a framework named Chordal Graph Based Channel Assignment (CGCA) that performs channel assignment for multicast and unicast traffic in multi-channel multi-radio wireless mesh networks. The proposed framework based on chordal graph coloring minimizes the interference of the network and prevents unicast traffic from starvation. Simulation results show that our framework provides high throughput and low end-to-end delay for both multicast and unicast traffic. Furthermore, our framework significantly outperforms other well-known schemes that have a similar objective in various scenarios.