多信道无线网络可利用多个信道通信，提高网络容量. 为链路分配信道是多信道无线网络研究中的重要问题. 文中提出一种基于冲突矩阵随机排序的多信道分配算法. 节点根据可用信道数目将网络划分为相应子网，然后对链路随机排序，并根据网络冲突图得到冲突矩阵. 最后以减少子网内链路冲突为目标，根据冲突矩阵将信道分配给各链路. 分析和仿真结果表明，该算法有效降低了网络冲突，提高了归一化网络吞吐率.
Multi-channel wireless network improves network capacity by using multiple channels. Channel allocation is a key in a multi-channel network. This paper presents a conflict matrix random sort (CMRS) based channel allocation algorithm. According to the number of available channels, the CMRS channel allocation algorithm divides a multi-channel network into several subnets based on the number of available channels. Links are sorted randomly and a conflict matrix is obtained from the contention graph of the network. To reduce conflicts in subnets, channels are allocated to each link based on conflict matrix. Analysis and simulation results show that the CMRS channel allocation algorithm effectively decreases the number of conflicts in the
network, and increases the normalized network throughput.
[1] IEEE Working Group. Part 11: wireless LAN medium access control (MAC) and physical layer (PHY) specifications: High-speed physical layer extension in the 2.4 GHz band [S]. IEEE Standard 802.11b , 1999.
[2] IEEE 802.11 Working Group. Part 11: wireless LAN medium access control (MAC) and physical layer (PHY) specifications: high-speed physical layer in the5Ghz band [S]. IEEE Standard 802.11a, 1999.
[3] WU S L, LIN Y C, TSENG Y C, SHEU J P. A new multi-channel MAC protocol with on-demand channel assignment for mobile Ad Hoc networks [C]// Proceedings of International Symposium on Parallel Architectures, Algorithms and networks, Dallas, TX, 2000: 232-237.
[4] HWANG K. Energy efficient channel agility utilizing dynamic multi-channel CCA for ZigBee RF4CE [J]. IEEE Transactions on Consumer Electronics, 2011, 57(1): 113-119.
[5] TZAMALOUKAS A, GARCIA-LUNA-ACEVES J J. Channel-hopping multiple access[C]// IEEE International Conference on Communications, New Orleans, LA, 2000: 216-230
[6] BAHL P, CHANDRA R, DUNAGAN J. SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 Ad-Hoc Wireless Networks [C]// ACM international conference on Mobile computing and networking, NY, 2004: 216-230.
[7] SO J, VAIDYA N. Multi-channel MAC for ad hoc networks: handling multi-channel hidden terminals using a single transceiver [C]// ACM international conference on Mobile computing and networking, NY, 2004: 222-233.
[8] JHA S C, PHUYAL U, RASHID M M, BHARGAVA V K. Design of OMC-MAC: an opportunistic multi-channel MAC with QoS provisioning for distributed cognitive radio networks [J]. IEEE Transactions on Wireless Communications. 2010, 10(10): 3414 -3425.
[9] ZHOU L, WANG X B, TU W, MUNTEAN G, GELLER B. Distributed scheduling scheme for video streaming over multi-channel multi-radio multi-hop wireless networks[J]. IEEE Journal on Selected Areas in Communications, 2010, 28(3):409-419.
[10] KIM S J, WANG X D, MADIHIAN M. Distributed joint routing and medium access control for lifetime maximization of wireless sensor networks [J]. IEEE Transactions on Wireless Communications, 2007, 6(7): 2669-2677.
[11] CAI H K, SOUNG C L. Towards a more accurate carrier sensing model for CSMA wireless networks [C]//IEEE International Conference on Communications, Cape Town, 2010:1 – 6.
[12] RAD A H M, WONG V W S. joint channel allocation, interface assignment and mac design for multi-channel wireless mesh networks [C]// IEEE International Conference on Computer Communications, Anchorage, AK, 2007:1469 -1477.
[13] LI H K, CHENG Y, WAN P J, CAO J N. Local sufficient rate constraints for guaranteed capacity region in multi-radio multi-channel wireless networks [C]// IEEE International Conference on Computer Communications. Shanghai, 2011: 990-998.
[14] GUPTA P AND KUMAR P R. The capacity of wireless network [J]. IEEE Transaction on Information Theory, 2000, 46(2): 388-405.
[15] TOMITA E, TANAKA A, TAKAHASHI H. The worst-case time complexity for generating all maximal cliques and computational experiments [J]. Theoretical Computer Science, 2006, 363: 28-42.
