论文标题
根据浸出
Optimal Number of Cluster Heads in Wireless Sensors Networks Based on LEACH
论文作者
论文摘要
无线传感器网络（WSN）一直是无线网络的领先研究领域之一，尤其是最近一年。传感器是随机位于该区域的，每个节点都会感应周围环境，并将收集的数据发送到集群头（CH），该数据聚集并传输了将信息获取到基站（BS）。每个WSN节点上都包含一个不可充电的电池。 WSN的传感器能量和网络寿命延长是学术界和行业中最重要的考虑因素。因此，已经提出了许多路由协议来解决此问题，其中之一是Leach，这是引入群集构想以延长WSN寿命的早期协议。 LEACH受到随机选择的簇头数的影响，这对网络寿命产生了影响，此外，节点在每个群集中随机连接在一起，这意味着某些群集头比其他群集节点更少的群集工作更能工作。在本文中，提出了一种算法最大数量的群集头（Monch），以识别WSN中的最佳群集头，并找到哪个是最接近的BS，并有助于将节点与最合适的群集集成在一起。结果表明，浸出算法的能源消耗性能提高。
The Wireless Sensor Network (WSN) has been one of the leading research fields of wireless networks, particularly in recent year. Sensors are randomly positioned in the region, every node senses the surroundings and sends the data collected to the cluster head (CH), which aggregates and transmits obtained information to the Base Station (BS). A non-rechargeable battery is included on each WSN node. The sensor energy and network life extension of WSN are the most important considerations in the academia and industry. And thus, many routing protocols have been proposed to solve this issue, one of these is LEACH, the early protocol that introduced the clustering idea to extend the life of the WSN. LEACH is affected by the number of heads of the Clusters as it is randomly selected, and this has an impact on network lifetime, furthermore, the nodes are randomly joined in each cluster, this means that some of the cluster heads work more than others with fewer cluster nodes. In this paper, it is proposed an algorithm Maximum Optimal Number of Cluster Heads (MONCH) to identify the optimum cluster heads in WSN and to find which is the nearest one to BS and helps to integrate nodes with the most appropriate cluster. The results show improved energy consumption performance for the LEACH algorithm.
