Title: k-hop neighbour knowledge-based clustering in CRN under opportunistic channel access

Authors: Rajiv Misra; Ram Narayan Yadav

Addresses: Department of Computer Science Engineering, Indian Institute of Technology, Patna, Patna – 801103 (Bihar), India ' Department of Computer Science Engineering, Indian Institute of Technology, Patna, Patna – 801103 (Bihar), India

Abstract: Cognitive radio networks (CRNs) enables cognitive users (CUs) to use available spectrum of primary users (PUs) using innovative techniques. On appearance of PUs, the available channel of CUs at different position may have different available channels which changes dynamically over time. Due to temporal and spatial variations of opportunistic channel availability, to ensure connectivity and robustness in CRN is of great research interests. We have proposed novel approach of k-hop neighbour knowledge-based clustering algorithm which guarantees robustness in CRN and converges in O(n²m), for n CUs and m clusters in the network. We have evaluated for varying 3-hop, 4-hop, … k-hop through simulation which shows that our scheme achieves 25%-30% more numbers of outward common channels and outperforms in terms of inner common channel index, outward common channel index, number of isolated nodes, throughput and frequency of route discovery compared to the competitive approaches.

Keywords: cognitive radio network; CRN; connectivity; clustering; performance analysis.

DOI: 10.1504/IJCNDS.2017.087381

International Journal of Communication Networks and Distributed Systems, 2017 Vol.19 No.4, pp.369 - 393

Received: 16 Sep 2015
Accepted: 10 Aug 2016
Published online: 14 Oct 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article