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

• 研究论文 • 上一篇    下一篇

认知无线电最短传输时延路由算法

李云;覃凤谢;李嫄源;曹傧   

  1. (重庆邮电大学 无线信息网络研究中心,重庆400065)
  • 收稿日期:2010-01-04 出版日期:2010-12-20 发布日期:2011-01-22
  • 通讯作者: 李云
  • 作者简介:李云(1974-),男,教授,E-mail: liyun@cqupt.edu.cn.
  • 基金资助:

    国家自然科学基金资助项目(60702055);教育部新世纪优秀人才支持计划资助项目(NCET-07-0914);中国博士后自然科学基金资助项目(20090451158);重庆市教委自然科学基金资助项目(KJ070521);华为高校合作资助项目(YBWL2008033)

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

摘要:

针对传统路由协议在认知网络中存在的缺陷,提出了一种基于最短传输时延的路由算法(SDCR).SDCR综合考虑认知网络特性,通过计算给定数据包的链路传输时延,并将此传输时延作为链路的边权值,利用经典的迪克斯屈拉算法找出传输时延最短的路由.仿真分析表明,SDCR具有比传统路由协议更短的端到端时延.

关键词: 认知无线电, 传输时延, 路由算法

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

Baidu
map