• 主题
高级搜索  >
历史搜索 清空历史
首页> 美国卫生研究院文献>Sensors (Basel Switzerland) >A Distributed Multi-Hop Intra-Clustering Approach Based on Neighbors Two-Hop Connectivity for IoT Networks
【2h】

A Distributed Multi-Hop Intra-Clustering Approach Based on Neighbors Two-Hop Connectivity for IoT Networks

机译：基于IOT网络的邻居两跳连接的分布式多跳内聚类方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务，本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文，但由于OA文献来源多样且变更频繁，仍可能出现获取不到、文献不完整或与标题不符等情况，如果获取不到我们将提供退款服务。请知悉。
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Under a dense and large IoT network, a star topology where each device is directly connected to the Internet gateway may cause serious waste of energy and congestion issues. Grouping network devices into clusters provides a suitable architecture to reduce the energy consumption and allows an effective management of communication channels. Although several clustering approaches were proposed in the literature, most of them use the single-hop intra-clustering model. In a large network, the number of clusters increases and the energy draining remains almost the same as in un-clustered architecture. To solve the problem, several approaches use the k-hop intra-clustering to generate a reduced number of large clusters. However, k-hop proposed schemes are, generally, centralized and only assume the node direct neighbors information which lack of robustness. In this regard, the present work proposes a distributed approach for the k-hop intra-clustering called Distributed Clustering based 2-Hop Connectivity (DC2HC). The algorithm uses the two-hop neighbors connectivity to elect the appropriate set of cluster heads and strengthen the clusters connectivity. The objective is to optimize the set of representative cluster heads to minimize the number of long range communication channels and expand the network lifetime. The paper provides the convergence proof of the proposed solution. Simulation results show that our proposed protocol outperforms similar approaches available in the literature by reducing the number of generated cluster heads and achieving longer network lifetime.
机译：在密集和大型的IOT网络下，一个星形拓扑，其中每个设备直接连接到互联网网关可能会导致能量和拥塞问题严重浪费。将网络设备分组为集群提供合适的架构，以降低能量消耗，并允许有效管理通信信道。虽然文献中提出了几种聚类方法，但其中大多数使用单跳内簇内模型。在大型网络中，群集的数量增加，并且能量排水仍然与未聚集的架构中的几乎相同。为了解决问题，几种方法使用K-Hop内部聚类来产生减少数量的大簇。然而，通常，k跳提出的方案通常是集中的，并且仅假设节点直接邻居信息缺乏鲁棒性。在这方面，本工作提出了一种称为分布式聚类的基于2跳连接（DC2HC）的K-Hop内部聚类的分布方法。该算法使用双跳邻居连接来选择相应的群集头集并加强群集连接。目的是优化代表性群集头集，以最小化长距离通信信道的数量并扩展网络寿命。本文提供了所提出的解决方案的收敛性证明。仿真结果表明，我们提出的协议通过减少生成的群集头数和实现更长的网络寿命，优于文献中可用的类似方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号