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.

中文翻译：

---

基于LEACH的无线传感器网络中簇头的最优数量

无线传感器网络（WSN）一直是无线网络的主要研究领域之一，尤其是近年来。传感器随机放置在区域内，每个节点感知周围环境并将收集到的数据发送到簇头（CH），簇头将获得的信息聚合并传输到基站（BS）。每个 WSN 节点上都包含一个不可充电电池。WSN的传感器能​​量和网络寿命延长是学术界和工业界最重要的考虑因素。因此，已经提出了许多路由协议来解决这个问题，其中之一是 LEACH，这是早期引入集群思想以延长 WSN 寿命的协议。LEACH 受簇头数量的影响，因为它是随机选择的，这对网络寿命有影响，此外，节点在每个集群中随机加入，这意味着一些集群头比其他集群节点少的集群头工作得更多。在本文中，提出了一种算法Maximum Optimal Number of Cluster Heads (MONCH)来识别WSN中的最佳簇头并找到离BS最近的簇头，并有助于将节点与最合适的簇集成。结果表明 LEACH 算法的能耗性能有所提高。