Layered Graph Model using Ant Colony Optimization in Cognitive Radio Mesh Network Routing
To handle the dynamic spectrum feature of cognitive radio network, layered graph model is introduced to describe the network topology and spectrum access. By finding the shortest path in the layered graph, the routing and spectrum assignment problem can be solved simultaneously. In this article, we introduced ant colony optimization into layered graph model. By doing this, we eliminated the dependency of layered graph on global information and control channel, and reduced network costs. The simulation showed that its an efficient algorithm to adapt the dynamic spectrum feature of cognitive radio network.
cognitive radio routing spectrum assignment layered graph ant colony optimization
Wang Xiao Sun Xuebin Zhao Chenglin Zhou Zheng
Key Lab of Universal Wireless Communications, MOE Wireless Network Lab Beijing University of Posts and Telecommunications Beijing, P.R.China
国际会议
2010 International Conference on Future Information Technology(2010年未来信息技术国际会议 ICFIT 2010)
长沙
英文
308-312
2010-12-14(万方平台首次上网日期,不代表论文的发表时间)