基于信道分配的多跳认知无线电网络路由算法

Multi-hop routing algorithm with spectrum assignment for cognitive radio networks

现有认知无线电网络中路由算法没有综合考虑主用户的到达率和认知用户竞争使用信道对网络性能的影响。针对上述问题,结合认知无线电网络频谱动态变化的特性,提出一种基于信道分配的多跳认知无线电网络路由算法(multi-hop cognitive routing basedan channel allocation,MCRC)。MCRC算法先得到最大化总吞吐量的全局信道分配,然后考虑主用户使用授权信道的概率和认知用户竞争使用信道的概率,得到认知用户使用某个信道的概率,最后以信道的有效传输时延作为选路标准,根据Dijkstra算法选择最小时延的路径。性能评估结果表明,MCRC明显地减小了平均端到端时延,极大地提高了平均端到端吞吐量。

To solve the drawbacks that the existing routmg algorttnms do not val rate of primary users and the competitive channel use of secondary users, a newly routing algorithm called multi-hop cognitive routing based on channel allocation （MCRC） is presented, which takes the channel allocation and probability of secondary users in cognitive radio networks （CRNs） into consideration. Firstly, MCRC can obtain the global channel allocation which has the maximization system throughout. Secondly, in order to get the channel used probability of secondary users, MCRC considers the probability ofprimary users and the channel competition probability of secondary users jointly. Finally, the channel effective transmission delay is used as the routing index and the smallest transmission delay route can be found by using Dijkstra algorithm. Numerical outcomes show that MCRC exceeds the existing routing algorithm, by means of which the average end-to end delay can be evidently reduced and the average end to-end throughput in the CRNs is also significantly improved.