scholarly journals Interference Aware Routing Game for Cognitive Radio Ad-hoc Networks

2018 ◽  
Vol 3 ◽  
pp. 55-63
Author(s):  
Soodeh Amiri-Doomari ◽  
Ghasem Mirjalily ◽  
Jamshid Abouei
Keyword(s):  
Cognitive Radio ◽  
Ad Hoc ◽  
Network Formation ◽  
Mesh Networks ◽  
Secondary Users ◽  
End To End Delay ◽  
Aggregate Interference ◽  
End To End ◽  
Network Formation Game ◽  
Formation Game

Cognitive radio is a new communication paradigm that is able to solve the problem of spectrum scarcity in wireless networks. In this paper, interference aware routing game, (IRG), is proposed that connects the flow initiators to the destinations. A network formation game among secondary users (SUs) is formulated in which each secondary user aims to maximize its utility, while it reduces the aggregate interference on the primary users (PUs) and the end-to-end delay. In order to reduce the end-to-end delay and the accumulated interference, the IRG algorithm selects upstream neighbors in a view point of the sender. To model the interference between SUs, IRG uses the signal-to-interference-plus noise (SINR) model. The effectiveness of the proposed algorithm is validated by evaluating the aggregate interference from SUs to the PUs and end-to-end delay. A comprehensive numerical evaluation is performed, which shows that the performance of the proposed algorithm is significantly better than the Interference Aware Routing (IAR) using network formation game in cognitive radio mesh networks.

scholarly journals End-to-End Delay Analysis in Cognitive Radio Ad Hoc Networks with Different Traffic Models

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Jing Gao ◽  
Changchuan Yin ◽  
Xi Han
Keyword(s):  
Cognitive Radio ◽  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Transmission Probability ◽  
Closed Form Expression ◽  
Traffic Models ◽  
End To End Delay ◽  
Source Models ◽  
End To End ◽  
Hoc Networks

Delay and throughput are important metrics for network performance. We analyze the end-to-end delay of cognitive radio ad hoc networks for two traffic models: backlogged and geometric, respectively. By modelling the primary users as a Poisson point process and the secondary network deploying multihop transmissions, we derive the closed-form expression for the end-to-end delay in secondary networks. Furthermore, we optimize the end-to-end delay in terms of the hop number and the secondary transmission probability, respectively. The range of the optimal hop number and the equation satisfied by the optimal transmission probability are obtained for backlogged source models. The equation met by the optimal hop number is presented for geometric source models.

Improved frog leap inspired protocol (IFLIP) – for routing in cognitive radio ad hoc networks (CRAHN)

2018 ◽  
Vol 15 (2) ◽  
pp. 306-311 ◽  
Author(s):  
Ramkumar J. ◽  
Vadivel R.
Keyword(s):  
Cognitive Radio ◽  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Research Work ◽  
Service Rate ◽  
Secondary Users ◽  
Content Type ◽  
End To End ◽  
Hoc Networks

Purpose End-to-end latency in network affects the overall performance in number of ways. It is one of the major tasks to minimize the end-to-end latency in cognitive radio ad hoc networks (CRAHN), as the transmission of packets passes through every hop of the routing path. This paper aims to propose a new reactive multicast routing protocol, namely, improved frog leap inspired protocol (IFLIP) to reduce the overall end-to-end latency in CRAHN. Design/methodology/approach It is difficult to solve the problems that emerge in optimization. Routing is the procedure for choosing the best network path. This paper proposes a novel algorithm by improving the FLIP to use an ideal route, which progressively reduces the congestion level on various routing path by considering the spectrum accessibility and the service rate of each hop in CRAHN. Findings Result of this research work concludes that IFLIP significantly outperforms other baseline schemes (namely, TIGHT and Greedy TIGHT) in minimizing the end-to-end latency in CRAHN. Originality/value It is proved that IFLIP gives a better ratio of packet delivery under varying primary users and secondary users. IFLIP results in increased packet deliver ratio, reduced end-to-end latency and better throughput.

A New Routing Selection Algorithm in Cognitive Mesh Networks

2013 ◽  
Vol 427-429 ◽  
pp. 2527-2530
Author(s):  
Zhi Ren ◽  
Yuan Zheng ◽  
Dong Yuan Liu ◽  
Hong Jiang Lei
Keyword(s):  
Mesh Networks ◽  
Routing Algorithm ◽  
Cognitive Networks ◽  
Stability Factor ◽  
Selection Algorithm ◽  
Secondary Users ◽  
Data Packets ◽  
Success Ratio ◽  
End To End Delay ◽  
End To End

In cognitive networks, the existing RASR routing algorithm does not consider channel usage ratio of the PU and results in an unstable path problem. To address these issues, a new Routing Selection Algorithm in Cognitive mesh networks (RSAC) is proposed in this paper. RSAC is designed by piggybacking the information of link stability factor which is the sum of the channel usage ratio of secondary users and choosing routes based on it. It enhances the route stability, improving the success ratio of data packets transmission, reducing the average end-to-end delay. Theoretical analysis and simulation results show that RSAC outperforms the RASR routing algorithm in terms of the success ratio of data packets transmission, the average end-to-end delay.

Sign in / Sign up

Export Citation Format

Share Document