To gain high user diversity and routing stability in wireless mesh network, a virtual hierarchical structure was proposed, in which the nearby nodes were aggregated to virtual cells. Nodes inside the virtual cell can communicate with each other and take the identical traffic relay functions. The bottom-level virtual hierarchical architecture is formed by node-s direct connection inside each virtual cell, while the top-level virtual hierarchical architecture is consisted of virtual cells taking in routing functions. A generalized set T-coloring model, a kind of graph coloring model, was devised for the channel assignment algorithm of this virtual hierarchical architecture. Based on virtual cells, the radio frequency interference was introduced as the optimized indicator so as to reduce wireless channel interference and maximize the channel-s utilization while maintaining network connectivity. The cell splitting strategy was utilized to improve the network capacity and the fairness of the channel assignment scheme. The validity of the proposed scheme is proven by the simulation result.
Raniwala A,Gopalan K,Chiueh T C.Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks[J].ACM Mobile Computing and Communications Review (MC2R.2004,8(2):50-65
Jensen T R,Toft B.Graph coloring problems[M].New York: Wiley Interscience,1995:50-95
Nieuwenhuijzen A C.Frequeccy asignment: models and algorithms [M].Maastricht: Arie Marinus Catharinus Antonius Koster,1999:11-46
Rad A H M,Wong V W S.Logical topology design and interface assignment for multi-channel wireless mesh networks[C]//Kero T.Proc IEEE Global Telecommunications Conference (Globecom).USA,Piscataway,NJ: IEEE,2006:1-6
Aardal K I,Hipolito A,Hoesel C P M van.A branch-and-cut algorithm for the frequency assignment problem[J].Research Memorandum 96/011,Maastricht University,1996:3-7
Marco C,Thomas S.Local search algorithms for graph set T-colouring and frequency Assignment[J].Source,Constraints Archive,2007,12(3): 371-403