Abstract

As there is rapid development of wireless and mobile communications, limited opening band is unable to meet the growing usage of mobile communication. In order to make better use of scarce spectrum resources, Cognitive Radio (CR) has been proposed to exploit underutilization portions of the spectrum, which is capable of interference sensing, environmental learning, and dynamic spectrum access. In this paper, a new routing algorithm for Cognitive Radio networks has been proposed. The algorithm is based on atomic time, known as DDCR (DillyDally Cognitive Routing). The DillyDally path is found by calculating the transmission delay of given packets on every link (weighted link). The transmission delays are found by using classic Dijkstra algorithm. Simulation results show the End-End delay of DDCR is less than that of the traditional routing algorithm. Thereby the network performance is improved.

Highlights

  • Wireless networks are assigned by government agencies according to a static assignment policy

  • Users in CRNs are classified into two types depending on utilization of spectrum bands: Primary users or licensed users (PUs) have priority in spectrum utilization and have license, Secondary users or unlicensed users (SUs) can interact without interfacing and dynamic manner

  • To reduce the problem such as deficiency of spectrum and to increase the un-utilized space in a network, Cognitive radio technique has been came into existence

Read more

Summary

INTRODUCTION

Wireless networks are assigned by government agencies according to a static assignment policy. Users in CRNs are classified into two types depending on utilization of spectrum bands: Primary users or licensed users (PUs) have priority in spectrum utilization and have license, Secondary users or unlicensed users (SUs) can interact without interfacing and dynamic manner. Research in this area mainly focus on lower layers OSI model that is physical layer and MAC layer [3]. The purpose of developing “Cognitive Routing Algorithm" is for finding the shortest path from source to destination in Cognitive radio network consisting of one or more channels. V.Lokeshwari Vinya et al, International Journal of Advanced Research in Computer Science, 9 (1), Jan-Feb 2018,423-426

SYSTEM OVERVIEW AND DESIGN
Work flow of network simulator
IMPLEMENTATION OF THE SYSTEM
CONCLUSION

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.