Premium
An efficient algorithm for backbone construction in cognitive radio networks
Author(s) -
Kumar Santosh,
Sharma Bharti,
Singh Awadhesh Kumar
Publication year - 2020
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.4345
Subject(s) - computer science , backbone network , overhead (engineering) , computer network , cognitive radio , protocol (science) , convergence (economics) , tree (set theory) , algorithm , routing protocol , distributed computing , wireless , routing (electronic design automation) , telecommunications , medicine , mathematical analysis , alternative medicine , mathematics , pathology , economics , economic growth , operating system
Summary Numerous research articles exist for backbone formation in wireless networks; however, they cannot be applied straightforward in cognitive radio network (CRN) due to its peculiar characteristics. Since virtual backbone has many advantages such as reduced routing overhead, dynamic maintenance, and fast convergence speed, we intend to propose a backbone formation protocol in CRN. In this paper, we propose a tree‐based backbone formation protocol along with its maintenance. Our protocol is based on non‐iterative approach, thus leading towards limited message overhead and faster convergence speed. The proposed algorithm first forms the tree by maintaining the parent‐child relationship, and second, the parent nodes are connected together to form the virtual backbone. In the end, we evaluate the performance our protocol through extensive simulations.