J4 ›› 2010, Vol. 37 ›› Issue (6): 1143-1147.doi: 10.3969/j.issn.1001-2400.2010.06.029

• Original Articles • Previous Articles     Next Articles

Routing algorithm based on the smallest transmission delay for cognitive radio networks

LI Yun;QIN Feng-xie;LI Yuan-yuan;CAO Bin   

  1. (Research Center of Wireless Information Networks,Chongqing University of Posts and Telecommunications, Chongqing  400065, China)
  • Received:2010-01-04 Online:2010-12-20 Published:2011-01-22
  • Contact: LI Yun E-mail:liyun@cqupt.edu.cn

Abstract:

Aiming to the shortcoming of traditional route protocols in cognitive radio networks, a smallest delay cognitive routing (SDCR) algorithm is proposed. According to the characteristic of a cognitive network, SDCR calculates the transmission delay in every link for a given packet, and uses the classic Dijkstra algorithm to find the smallest transmission delay route. Simulation results show that the End-to-End delay of SDCR is less than that by the traditional routing algorithm.

Key words: cognitive radio, transmission delay, routing algorithm