Role and channel assignments for wireless mesh networks using hybrid approach

被引:3
作者
Jeng, Andy An-Kai [1 ]
Jan, Rong-Hong [1 ]
机构
[1] Natl Chiao Tung Univ, Dept Comp Sci, Hsinchu 30050, Taiwan
关键词
Wireless mesh network; Multi-channel multi-interface; Channel assignment; Role assignment; NP-hardness; Greedy algorithm;
D O I
10.1016/j.comnet.2009.03.020
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The wireless mesh network has been considered one of the most promising techniques to extend the broadband access to the last mile. To utilize multiple channels on more than one interface, a number of approaches have been proposed. In particular, the hybrid strategy that combines the benefits of high channel diversity and low coordination cost has seen growing interest in recent studies. In this paper, we define two optimization problems, named the role assignment and the semi-fixed channel assignment, to characterize the unique feature in the hybrid strategy. We proved that the two problems are NP-hard even if the transmission ranges of interfaces are equal. In order to solve our problems in reasonable time, we design efficient algorithms. For the role assignment problem, we give an 1/2-approximate algorithm to find a nearly optimal solution. For the semi-fixed channel assignment problem, a heuristic algorithm, based on transferring from a coloring-based problem, is proposed. Experimental results show that optimizing the defined problems is indeed beneficial to improve the network throughput, and the proposed algorithms are significantly superior to existing methods. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:2225 / 2240
页数:16
相关论文
共 26 条
  • [11] Gopalan K., 2004, ACM MOBILE COMPUTING, V8, P50, DOI DOI 10.1145/997122.997130
  • [12] A multichannel CSMA MAC protocol with receiver-based channel selection for multihop wireless networks
    Jain, N
    Das, SR
    Nasipuri, A
    [J]. TENTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2001, : 432 - 439
  • [13] On the hardness of approximating max k-CUT and its dual
    Kann, V
    Khanna, S
    Lagergren, J
    Panconesi, A
    [J]. CHICAGO JOURNAL OF THEORETICAL COMPUTER SCIENCE, 1997, (02): : 1 - 18
  • [14] Karp R. M., REDUCIBILITY COMBINA, P85
  • [15] Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
    Kodialam, M
    Nandagopal, T
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (04) : 868 - 880
  • [16] Multichannel Mesh networks: Challenges and protocols
    Kyasanur, P
    So, JM
    Chereddi, C
    Vaidya, NH
    [J]. IEEE WIRELESS COMMUNICATIONS, 2006, 13 (02) : 30 - 36
  • [17] Kyasanur P, 2005, IEEE WCNC, P2051
  • [18] Kyasanur P., 2005, P 11 ANN INT C MOBIL, P43
  • [19] Kyasanur P., 2006, SIGMOBILE MOBILE COM, V10, P31
  • [20] Li CY, 2007, J INF SCI ENG, V23, P1041