arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.03079cs.NI
收藏

WSN中一种新的大规模覆盖聚类算法

A novel clustering algorithm for coverage a large scale in WSN

Wassim Jerbi, Abderrahmen Guermazi, Hafedh Trabelsi

摘要:

这些应用需要长时间覆盖整个监测区域。分簇是一种减少通信、最小化能量消耗和在簇头及其成员之间组织消息的方法。由于传感器的能量资源有限,为了保持和延长网络的生命周期,必须尽量减少不同传感器节点之间的通信和数据传输的消息交换。在本文中,我们考虑的问题孤立的节点,远离簇头(CH)和后果或CH是不是从这些节点的范围内。为了解决这个问题,我们提出了O-LEACH(孤儿低能量自适应聚类层次)的路由协议,考虑到孤儿节点。事实上,集群成员将能够扮演网关的角色,允许孤儿节点加入。我们的贡献是选举一个簇头,有足够的能量,更好地与这些成员节点协调,并保持对应用程序的全面覆盖,需要有用的数据,整个区域被覆盖。仿真结果表明,O-LEACH协议在连通率、能量、可扩展性和覆盖范围等方面均优于LEACH协议。

英文摘要:

The applications require coverage of the whole monitored area for long periods of time. Clustering is a way to reduce communications, minimize energy consumption and organize messages among the cluster head and their members. The message exchange of communication and data transmission between the different sensor nodes must be minimized to keep and extended the lifetime of the network because of limited energy resources of the sensors. In this paper, we take into consideration the problem isolated nodes that are away from the cluster head (CH) and by consequence or CH is not within the reach from these nodes. To solve this problem, we propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy) a routing protocol that takes into account the orphan nodes. Indeed, a cluster member will be able to play the role of a gateway which allows the joining of orphan nodes. Our contribution is to election a cluster head that has enough energy for a better now to coordinate with these member nodes and maintain the full coverage for applications which requires of useful data for the entire area to be covered. The simulation results show that O-LEACH performs better than LEACH in terms of connectivity rate, energy, scalability and coverage.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑