Distributed Channel Assignment for Multi-radio Wireless Networks
作者： Minho Shin , Seungjoon Lee , Yoo-ah Kim
DOI: 10.1109/MOBHOC.2006.278582
关键词:
摘要: We consider the channel assignment problem for multihop wireless networks in which nodes have multiple interfaces. Given number of interfaces at each node and available channels system, we find a feasible to improve network performance. Even when routing is given, finding optimal performance NP-hard. present SAFE (Skeleton Assisted partition FrEe) scheme, uses randomized distributed manner while maintaining connectivity. can utilize all independent system attempting distribute edges sharing particular evenly throughout network. To handle topology change incremental deployment better, decouples from routing. Our simulation results show that significantly improves terms throughput delay comparable best prior centralized scheme jointly considers assignment.
sci-hub.se 参考文章(31)
David P. Bunde, Jeff Erickson, Shripad Thite, Distance-2 Edge Coloring is NP-Complete arXiv: Discrete Mathematics. ,(2005)
N. Li, J.C. Hou, L. Sha, Design and analysis of an MST-based topology control algorithm international conference on computer communications. ,vol. 3, pp. 1702- 1712 ,(2003) , 10.1109/INFCOM.2003.1209193
A. Raniwala, Tzi-cker Chiueh, Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network international conference on computer communications. ,vol. 3, pp. 2223- 2234 ,(2005) , 10.1109/INFCOM.2005.1498497
A. Nasipuri, J. Zhuang, S.R. Das, A multichannel CSMA MAC protocol for multihop wireless networks wireless communications and networking conference. ,vol. 3, pp. 1402- 1406 ,(1999) , 10.1109/WCNC.1999.796968
E. Kubicka, A. J. Schwenk, An introduction to chromatic sums conference on scientific computing. pp. 39- 45 ,(1989) , 10.1145/75427.75430
Michael Randolph Garey, Johnson: computers and intractability: a guide to the theory of np- completeness (freeman ,(1979)
Ashish Raniwala, Kartik Gopalan, Tzi-cker Chiueh, Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks Mobile Computing and Communications Review. ,vol. 8, pp. 50- 65 ,(2004) , 10.1145/997122.997130
Michael R. Garey, David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness ,(1979)
Rajmohan Rajaraman, Topology control and routing in ad hoc networks ACM SIGACT News. ,vol. 33, pp. 60- 73 ,(2002) , 10.1145/564585.564602
Aravind Srinivasan, V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy, End-to-end packet-scheduling in wireless ad-hoc networks symposium on discrete algorithms. pp. 1021- 1030 ,(2004) , 10.5555/982792.982945