scholarly journals SAGRA: A SPECTRUM AWARE GEOGRAPHIC ROUTING ALGORITHM PROPOSAL FOR MULTI-HOP COGNITIVE RADIO NETWORKS

2011 ◽  
Vol 219-220 ◽  
pp. 1055-1059 ◽  
Author(s):  
Zhan Jun Liu ◽  
Feng Xie Qin ◽  
Qian Bin Chen

Aiming to the shortcoming of traditional route protocols in cognitive radio networks, joint cognitive routing and spectrum assignment (JCRSA) algorithm was proposed. According to the characteristic of cognitive network, the most capacity channel is selected as communication channel on every link, and JCRSA calculates the transmission delay on every link for a given packet, and then uses classic Dijkstra algorithm to find the smallest transmission delay route. According to the route table, spectrum is assigned on every link. Simulation results show that the End-to-End delay of JCRSA is less than that of traditional routing algorithm.


2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Peng Huang ◽  
Feng Lin ◽  
Jiliu Zhou

Cognitive Radio Networks (CRNs) are an outstanding solution to improve efficiency of spectrum usage. Secondary users in cognitive networks may select from a set of available channels to use provided that the occupancy does not affect the prioritized licensed users. However, CRNs produce unique routing challenges due to the high fluctuation in the available spectrum as well as diverse quality-of-service (QoS) requirements. In CRNs, distributed multihop architecture and time varying spectrum availability are some of the key factors in design of routing algorithms. In this paper, we develop an ant-colony-optimization- (ACO-) based on-demand cognitive routing algorithm (ACO-OCR), jointly consider path and spectrum scheduling, and take advantage of the availability of multiple channels, to improve the delivery latency and packet loss rate. Then, an analytical framework based on M/G/1 queuing theory is introduced to illustrate the relay node queuing model. The performances of ACO-OCR have been evaluated by means of numerical simulations, and the experimental results confirm its effectiveness. Simulation results show that ACO-OCR outperforms other routing approaches in end-to-end path latency and package loss rate.


2011 ◽  
Vol 225-226 ◽  
pp. 319-323
Author(s):  
Zhan Jun Liu ◽  
Feng Xie Qin ◽  
Qian Bin Chen

Aiming to the shortcoming of traditional route protocols in cognitive radio networks, cognitive radio routing and optimal spectrum assignment (CRRSA) algorithm was proposed. In this paper, we consider the situation that non-interfering among the adjacent jump, and present the optimal allocation of available spectrum, and then calculate the bandwidth of end-to-end path, finally select the maximize bandwidth of end-to-end path as the best transmission route. Simulation results show that the End-to-End bandwidth of CRRSA is larger than that of traditional routing algorithm.


Sign in / Sign up

Export Citation Format

Share Document