Wavelength Assignment and Adaptive Shortest Path Algorithm in Cognitive Radio Networks Using Ant Colony Optimization

摘要

Cognitive radio (CR) is a promising technology that enriches spectrum efficiency by providing opportunistic transmissions over channels to maintain the routing function in cognitive radio related networks. This motivates a flexible and active dynamic channel assignment scheme which can utilize the licensed spectrum very effectively. On the other hand, the flexibility of the spectrum access phase increases the complexity in the design of the communication protocols at different layers. This work emphasis on the problem of designing active routing solutions for Cognitive Radio Networks. Beam forming is a technique used for controlling the transmitter and reception of radio signals. We propose ant colony optimization and Adaptive shortest path algorithm in this paper. The former is a Meta heuristic algorithm, which is used for solving the complex multiobjective optimization problem and simplify the computational process. The latter is also used for finding the shortest path to reach the destination. Validity for both the algorithms has been verified through several experimental tests.