4.8 Article

Energy-Efficient k-Hop Clustering in Cognitive Radio Sensor Network for Internet of Things

Journal

IEEE INTERNET OF THINGS JOURNAL
Volume 8, Issue 17, Pages 13593-13607

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2021.3065691

Keywords

Clustering; cognitive radio sensor networks (CRSNs); Internet of Things (IoT); neighbor discovery algorithm

Funding

  1. SERB-DST, Government of India [SRG/2020/000575]

Ask authors/readers for more resources

In this article, we propose a clustering scheme for CRSN that is suitable for IoT applications, aiming at achieving bichannel connectivity and maximizing network lifetime. Through simulation experiments, our proposed scheme shows significant performance improvements in terms of network lifetime, number of clusters, and network stability.
The design and development of energy and spectrum-efficient solutions are important in the success of the Internet of Things (IoT). Due to the presence of an enormous number of smart devices, such as sensors, actuators, and different household devices achieving such scalable and efficient solutions are challenging. A wireless sensor network (WSN) with dynamic spectrum access (DSA) capability, known as the cognitive radio sensor network (CRSN) is recently introduced to deal with spectrum scarcity problem. Although the spectrum scarcity is reduced with DSA paradigm, the energy-efficient solutions are still required to be addressed due to the involvement of energy constrained devices in CSRN. Clustering is one of the efficient ways to optimize the energy consumption in the networks. Due to combination of both WSN and cognitive radio network (CRN), existing solutions of WSN and of CRNs are not applicable to CRSN. In this article, we propose a neighbor discovery algorithm and two greedy k-hop clustering schemes (k-SACBWEC and k-SACB-EC) for CRSN with the aim focusing on IoT applications, which require constant intracluster and intercluster communications. We focus on achieving bichannel connectivity while maximizing network life. In our clustering different parameters, such as nodes' residual energy, spectrum awareness, appearance probability of primary users (PUs) of channels, channel quality, robustness on PUs' arrival, and the Euclidean distance between nodes are taken into consideration to select the hop count and common channels for clusters. Through simulation, we have highlighted the performance improvements of our proposed schemes in terms of the lifetime of the network, number of clusters, stability of networks, and frequency of reclustering over recently reported clustering algorithm in CRSN. The simulation results show that k-SACB-WEC generates at least 40% less number of clusters as compared to k-SACB-EC, network stability-aware clustering (NSAC), Prolong-SEP (PSEP), SACWCM, and Cognitive LEACH (CogLEACH). Also, in terms of network stability, the k-SACB-WEC achieves at least approximately 100% higher number of rounds before the first node dead than the compared competitive approaches.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available