4.8 Article

A localized algorithm for clustering in cognitive radio networks

出版社

ELSEVIER
DOI: 10.1016/j.jksuci.2018.04.004

关键词

Cognitive radio networks; Cognitive radio; Clustering; Distributed algorithm; Localized algorithm

向作者/读者索取更多资源

This article proposes a localized clustering scheme for CRN to improve stability, efficiency, and reduce communication overhead. The scheme achieves this through node weight calculation and cluster head selection.
With the steep increase in wireless devices, the requirement of the spectrum has increased for communication. However, despite huge demand, the available spectrum is underutilized. The cognitive radio network (CRN) is more challenging environment as compared to conventional mobile ad hoc network because of node mobility and dynamic channel availability. Therefore, we propose a localized clustering scheme, which aims to provide better stability, scalability, efficient spectrum management, and reduce communication overhead. Each node computes its weight and shares with its one hop neighbours, and a node with maximal weight becomes the cluster head. Subsequently, the neighbour nodes sharing the channel(s) with a cluster head join it to form a cluster. To provide fault tolerance, vice-cluster head is also selected along with cluster head. We compare the performance of our protocol with competing protocols in the CRN. Finally, we present analytic as well as simulation study of our protocol and provide a method to handle the cluster dynamics. (c) 2018 The Authors. Production and hosting by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据