| |
Graph coloring based channel assignment framework for rural wireless mesh networks
- 作者:Chao Zuo (1) (2) (4)
Cong Xiong (2) Han Zhang (3) Chang Fang (1)
- 关键词:IEEE 802.11 ; Rural mesh networks ; Channel assignment ; Adjacent Vertex Distinguishing Edge Coloring (AVDEC) ; TN911
- 刊名:Journal of Electronics (China)
- 出版年:2013
- 出版时间:October 2013
- 年:2013
- 卷:30
- 期:5
- 页码:436-446
- 全文大小:
- 作者单位:Chao Zuo (1) (2) (4)
Cong Xiong (2) Han Zhang (3) Chang Fang (1)
1. School of Management, Hefei University of Technology, Hefei, 230009, China 2. School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, 30332-0250, USA 4. School of Management, Hefei University of Technology, Hefei, 230009, China 3. College of Information Technical Science, Nankai University, Tianjin, 300071, China
- ISSN:1993-0615
文摘
IEEE 802.11 based wireless mesh networks with directional antennas are expected to be a new promising technology and an economic approach for providing wireless broadband services in rural areas. In this paper, we discuss interference models and address how they can affect the design of channel assignment in rural mesh networks. We present a new channel assignment framework based on graph coloring for rural wireless mesh networks. The goal of the framework is to allow synchronously transmitting or receiving data from multiple neighbor links at the same time, and continuously doing full-duplex data transfer on every link, creating an efficient rural mesh network without interference. Channel assignment is shown to be NP-hard. We frame this channel allocation problem in terms of Adjacent Vertex Distinguishing Edge Coloring (AVDEC). Detailed assignment results on grid topology are presented and discussed. Furthermore, we design an algorithm. Finally, we evaluate the performance of the proposed algorithm through extensive simulations and show the algorithm is effective to the regular grid topologies, and the number of colors used by the algorithm is upper bounded by Δ + 1. Hence the algorithm guarantees that the number of channels available in standards such as IEEE 802.11a is sufficient to have a valid AVDEC for many grid topologies. We also evaluate the proposed algorithm for arbitrary graphs. The algorithm provides a lower upper bound on the minimum number of channels to the AVDEC index channel assignment problem.
| |
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.
| |