GRAPH-THEORETIC ALGORITHM FOR SPECTRUM ALLOCATION IN IEEE 802.22 WIRELESS MESH NETWORK  

作　　者：He Tao Wang Suoping Zhang Min 

机构地区：[1]College of Software, Nanjing University of Posts and Telecommunications, Nanjing 21003, China [2]College of Automation, Nanjing University of Posts and Telecommunications, Nanjing 21003, China

出　　处：《Journal of Electronics(China)》2010年第4期433-439,共7页电子科学学刊（英文版）

摘　　要：The IEEE 802.22 standard based on wireless Cognitive Radio (CR) is an optimal solution to resolve the inefficient spectrum utility problem. In this paper, we focus on the spectrum allocation in IEEE 802.22 mesh networks and propose a new graph-theory algorithm. The algorithm aims at two objectives: one is the sum of the allocated channel bandwidth is maximum, and the other is the number of users can be active simultaneity is maximum. In this proposed algorithm, the topology of network was modeled as a general graph and could be transformed into a weighted complete bipartite-graph by three processes. The simulations show that the presented algorithm can improve the performance of spectrum allocation.The IEEE 802.22 standard based on wireless Cognitive Radio （CR） is an optimal solution to resolve the inefficient spectrum utility problem. In this paper, we focus on the spectrum allocation in IEEE 802.22 mesh networks and propose a new graph-theory algorithm. The algorithm aims at two objectives： one is the sum of the allocated channel bandwidth is maximum, and the other is the number of users can be active simultaneity is maximum. In this proposed algorithm, the topology of network was modeled as a general graph and could be transformed into a weighted complete bipartite-graph by three processes. The simulations show that the presented algorithm can improve the performance of spectrum allocation.

关 键 词：Cognitive Radio （CR） Wireless Regional Area Network （WRAN） Spectrum allocation 

分 类 号：TN92[电子电信—通信与信息系统] TQ226.3[电子电信—信息与通信工程]