Abstract
Compared with traditional computer network, wireless sensor network has the characteristics with limited energy, lower computing capacity, multi-jump communication, no global IP address, datacentric, self-organization and topological dynamic change. Thus, the traditional network routing mechanism is not suitable for cognitive radio network. This paper presents an improved algorithm for Ant Colony algorithm based on random state transition rule and pheromones adjustment mechanism to promote the efficiency. Firstly, it optimizes Ant Colony algorithm in order to deal with the deficiency of network congestion and routing control in cognitive radio network. Secondly, it gives the basic idea and steps of such approach by combining with Ant's pheromone and Network node. At the same time, the method can hasten the search speed according to global refresh strategy of optimum and worst path pheromone. Thirdly, two routing application experiments are carried out based on the presented algorithm, and the results show that the algorithm is feasible and effective. It can avoid the network congestion and energy consumption by individual node so as to prolong the life cycle of the entire network.
| Original language | English |
|---|---|
| Pages (from-to) | 73-81 |
| Number of pages | 9 |
| Journal | International Journal of Advancements in Computing Technology |
| Volume | 3 |
| Issue number | 7 |
| DOIs | |
| State | Published - Aug 2011 |
Indexed by
- EI
- Scopus
Fingerprint
Dive into the research topics of 'An improved ant colony optimization for routing in cognitive radio network'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver