Optimasi Efisiensi Energi untuk Pemilihan Intermediate Cluster Head menggunakan MI-C LEACH: Multi-hop Inter-Cluster pada Jaringan Sensor Nirkabel

Perbincangan hangat para peneliti pada jaringan sensor nirkabel masih kompleksitas pada penggunaan energi disetiap node. Hal ini dikarenakan kebutuhan informasi meningkat yang mempengaruhi perkembangan teknologi semakin meningkat pula. Sehingga, pertukaran informasi secara terus menerus menyebabkan penurunan masa hidup node. Solusi untuk permasalahan tersebut adalah menggunakan routing protocol seperti Low Energy Adaptive Clustering Hierarchy (LEACH). Protokol LEACH bekerja dengan melakukan pengelompokan node dan memilih kepala kluster (CH) yang bertugas untuk mengirimkan data ke Sink Node (SN). Salah satu kelemahan protokol LEACH adalah CH yang jauh dari SN dimana memerlukan energi banyak untuk pengiriman data ke SN. Salah satu cara untuk mengurangi konsumsi energi tiap CH jauh adalah dengan menggunakan komunikasi multi-hop. Pada makalah ini, kami mengusulkan Multi-hop Inter-Cluster LEACH (MI-C LEACH) dengan algoritma pengembangan dari protokol LEACH. Hasil simulasi menggunakan OMNeT++ menunjukkan bahwa jumlah node 100 pada rata-rata energi tersisa dari MI-C LEACH jauh lebih banyak dari LEACH dengan perbedaan rata-rata 27.082 watt. Tetapi pada jumlah node 200, MI-C LEACH tidak berbeda jauh energi yang tersisa dari LEACH untuk setiap jumlah putaran 100 hingga 600

An improved cluster formation process in wireless sensor network to decrease energy consumption

Wireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time. © 2020, The Author(s)

Energy Optimization in Cluster-Based Routing Protocols for Large-Area Wireless Sensor Networks

In large-area wireless sensor networks with hierarchical cluster-based routing protocols, the average number of clusters, k, and the transmission range for the control messages, R, significantly affect the network lifespan. We analyze energy consumption in depth as a function of ( k , R ) , taking into account the energy dissipation of cluster head nodes and the member nodes, separately. To achieve joint optimization of ( k o p t , R o p t ) , we adopt derivative-free Nelder–Mead Simplex method. Computer simulations have shown that our approach effectively reduces energy consumption of sensor nodes in the process of clustering and data transmission in large-area sensor fields. Our optimization can be applied to existing cluster-based routing schemes to maximize their energy efficiency