基于最短时延的认知无线电网络安全路由算法  

Security Routing Algorithm Based on Shortest Delay for Cognitive Radio Networks

作　　者：薛楠[1] 周贤伟[1] 林琳[1] 周健[1] 

机构地区：[1]北京科技大学信息工程学院通信工程系,北京100083

出　　处：《计算机科学》2010年第1期68-71,共4页Computer Science

基　　金：国家自然科学基金项目(No.60773074)认知无线电安全关键技术研究资助

摘　　要：针对认知无线电网络可用频谱动态变化和路由过程中出现的安全问题,提出将最短数据传输时延和高安全等级路由作为选路标准,设计了一种跨层路由选择算法。算法通过优化转发节点个数和各转发节点接收、发送数据信道来减少数据传输时延。通过选择具有高安全级别的转发节点来保证路由的安全性。理论分析表明算法是高效和可行的。它的时间复杂度是O(N2),其中N是拓扑图中节点的个数。The paper proposed a cross-layer routing selection algorithm, which considers the shortest delay and highest security as routing selection standard. The routing algorithm aims to solve the problem of both the dynamic spectrum and security problem in cognitive radio networks. The Algorithm reduces the data transfer delay by optimizing the number of forwarding nodes and selecting channel for transmitting and receiving, and ensures routing security by choosing a forwarding node of high level security. The results of theory analysis show that the algorithm is efficient and feasible. The computing complexity of the algorithm is O（N^2 ） ,where N is the number of nodes in the network topology graph.

关 键 词：认知无线电网络 跨层路由选择算法 安全路由 最短时延 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]