scholarly journals Design and Implementation of EOICHD Based Clustered Routing Protocol Variants for Wireless Sensor Networks

2021 ◽  
Vol 4 (2) ◽  
pp. 25
Author(s):  
Anupkumar Bongale ◽  
Arunkumar Bongale ◽  
Satish Kumar ◽  
Rahul Joshi ◽  
Kishore Bhamidipati

Efficient energy utilization and network life prolongation are primary objectives to be considered when designing a Wireless Sensor Network. Cluster-based routing protocols are most suitable for achieving such goals. Energy and Optimal Inter Cluster Head Distance (EOICHD) is a cluster-based hierarchical routing protocol inspired by the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. EOICHD resolves the problems associated with LEACH protocol, such as selecting cluster head nodes in close proximity. By carefully selecting the cluster head nodes based on residual energy and optimal inter-cluster head distance, EOICHD ensures that selected cluster head nodes are separated by a certain optimal distance. This approach ensures uniform distribution of cluster head nodes across the entire network. The study of the EOICHD protocol presented so far is not sufficient. Hence, in this paper, we propose three variants of EOICHD protocol to understand its behavior in a better manner. A comparative analysis of all three EOICHD variants, LEACH and LEACH-central constrained (LEACH-C) protocol, is performed by considering comparative parameters such as alive nodes, cumulative network energy, data packets arrived at the base station, and stability of the network.

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Jun Wang ◽  
Zhuangzhuang Du ◽  
Zhengkun He ◽  
Xunyang Wang

Balancing energy consumption using the clustering routing algorithms is one of the most practical solutions for prolonging the lifetime of resource-limited wireless sensor networks (WSNs). However, existing protocols cannot adequately minimize and balance the total network energy dissipation due to the additional tasks of data acquisition and transmission of cluster heads. In this paper, a cluster-head rotating election routing protocol is proposed to alleviate the problem. We discovered that the regular hierarchical clustering method and the scheme of cluster-head election area division had positive effects on reducing the energy consumption of cluster head election and intracluster communication. The election criterion composed of location and residual energy factor was proved to lower the probability of premature death of cluster heads. The chain multihop path of intercluster communication was performed to save the energy of data aggregation to the base station. The simulation results showed that the network lifetime can be efficiently extended by regulating the adjustment parameters of the protocol. Compared with LEACH, I-LEACH, EEUC, and DDEEC, the algorithm demonstrated significant performance advantages by using the number of active nodes and residual energy of nodes as the evaluation indicators. On the basis of these results, the proposed routing protocols can be utilized to increase the capability of WSNs against energy constraints.


2012 ◽  
Vol 562-564 ◽  
pp. 1304-1308 ◽  
Author(s):  
Qing Hui Wang ◽  
Hong Yan Guo ◽  
Yong Huan Ji

The data transfer of wireless sensor network (WSN) can not be separated with routing protocol, Energy efficiency is one of the most important factors in wireless sensor networks. In this paper based on the uneven distribution of the LEACH cluster head and the different lengths and base station communications, we present a improved LEACH algorithm which refers to remaining energy and optimal cluster heads. Computer simulation using NS2 reveals that the proposed protocol reduces the energy consumption compared with the existing LEACH protocol.


2021 ◽  
Vol 17 (2) ◽  
pp. 190-197
Author(s):  
Enaam Al-Husain ◽  
Ghaida Al-Suhail

Clustering is one of the most energy-efficient techniques for extending the lifetime of wireless sensor networks (WSNs). In a clustered WSN, each sensor node transmits the data acquired from the sensing field to the leader node (cluster head). The cluster head (CH) is in charge of aggregating and routing the collected data to the Base station (BS) of the deployed network. Thereby, the selection of the optimum CH is still a crucial issue to reduce the consumed energy in each node and extend the network lifetime. To determine the optimal number of CHs, this paper proposes an Enhanced Fuzzy-based LEACH (E-FLEACH) protocol based on the Fuzzy Logic Controller (FLC). The FLC system relies on three inputs: the residual energy of each node, the distance of each node from the base station (sink node), as well as the node’s centrality. The proposed protocol is implemented using the Castalia simulator in conjunction with OMNET++, and simulation results indicate that the proposed protocol outperforms the traditional LEACH protocol in terms of network lifetime, energy consumption, and stability.


2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Jia Yanfei ◽  
Chen Guangda ◽  
Zhao Liquan

In heterogeneous wireless sensor networks, sensor nodes are randomly distributed in some regions. In some applications, they may be randomly distributed in different regions. Besides, nodes with the same type have almost the same probability to be selected as cluster head. The cluster head will consume much more energy to receive and transmit data than the other nodes. If nodes with little residual energy have been elected as cluster heads, it will affect the efficiency of the network due to its early death. An improved energy-efficient routing protocol is proposed for heterogeneous wireless sensor networks. Firstly, it supposes that the different types of nodes are distributed in different zones. Secondly, by improving the threshold, nodes with large residual energy have a greater possibility of becoming cluster heads. In the end, it designs a mixed data transmission method. The cluster heads of supper nodes and advance nodes directly transmit data to the base station. The normal nodes adopt single hops and multiple hops mixed methods to transmit data. This can minimize the energy of the communication from cluster head to base station. Simulation results show that this algorithm has achieved a longer lifetime for the wireless sensor network than stable election protocol and threshold-sensitive stable election protocol algorithm.


2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Rohit Pachlor ◽  
Deepti Shrimankar

A wireless sensor network (WSN) is a collection of hundreds to thousands of compact, battery-operated sensors. It is deployed to accumulate useful information from the nearby environment. Depending upon the type of application, the sensors have to work for months to years with a finite energy source. In some extreme environments, the replacement of energy source is challenging and sometimes not feasible. Therefore, it is vital for sensors to perform their duties in an energy efficient way to improve the longevity of the network. This paper proposes an energy-efficient centralized cluster-based routing protocol called Vice-Cluster-Head-Enabled Centralized Cluster-based Routing protocol (VCH-ECCR). The VCH-ECCR uses a two-level hierarchy of vice cluster heads to use the energy of sensors efficiently and to cut back the frequency of the clustering. The performance of VCH-ECCR is compared with low-energy adaptive clustering hierarchy (LEACH), LEACH-Centralized (LEACH-C), and base station controlled dynamic clustering protocol (BCDCP). The experimental results show that the VCH-ECCR outperforms over its comparative in terms of network lifetime, overall energy consumption, and throughput.


Author(s):  
Meriem Boumassata ◽  
Mohamed Benmohammed

Wireless sensor networks (WSNs) are networks formed by a large number of electronic devices called sensor nodes, where each node is capable of measuring environmental or physical values and communicating data, through wireless links, to a base station. The main problem that WSNs routing protocols face, is that sensors are powered with low power batteries, which plays an important role in network lifetime. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical cluster based routing protocol that was proposed as a solution for low power consumption in WSNs. One of LEACH protocol limitations is “Extra Transmissions”. This paper studies LEACH protocol, some of its various enhancements and finally proposes a new clustering and selecting cluster head scheme with the goal of optimizing the energy consumption in WSNs.


2014 ◽  
Vol 644-650 ◽  
pp. 2707-2710
Author(s):  
Jing Feng Xu ◽  
Feng Xu ◽  
Qi Lu Meng

In wireless sensor network (WSN), LEACH protocol is a typical representative of the hierarchical topology control protocol. Compared to plane multiple hops routing protocol, it can significantly prolong the life cycle of the network. But LEACH protocol having the problem of uneven distribution at the cluster head election, this paper proposes a low energy adaptive clustering routing protocol based on the partition. On the basis of the partition, cluster heads are selected by the energy of nodes and their location information. Simulation experiments show that the proposed protocol can be more effective than LEACH to balance the energy and improve the life cycle of the network.


2014 ◽  
Vol 519-520 ◽  
pp. 1214-1219
Author(s):  
Yong Chao Liu ◽  
Yue Xia Zhang ◽  
Min Miao

It is especially important to save energy and prolong the network lifetime because the WSN nodes energy is limited. Optimizing the routing algorithm for WSN is one of the important ways to reduce energy consumption. LEACH routing protocol is the first cluster-based routing protocol for wireless sensor networks. But LEACH have some deficiencies, such as agreement of uneven clustering, the nodes energy imbalance, frequent clustering and consume too much energy. The paper proposes an improved LEACH protocol to solve the above problem. It takes the residual energy of the nodes into account when nodes selected the cluster-head so that the nodes that hold high-energy have the high possibility to be selected as cluster-head. The improved algorithm uses the incomplete clustering which does not need to cluster every round but interval cluster. Simulation results show that the improved LEACH protocol effectively increases the nodes energy utilization and extends the network lifetime.


2019 ◽  
Vol 5 (2) ◽  
pp. 164
Author(s):  
Kristoforus Fallo ◽  
Waskitho Wibisono ◽  
Kun Nursyaful Priyo Pamungkas

Development of a grid-based clustering mechanism to improve LEACH performance in the Wireless Sensor Network environmentLow Energy Adaptive Clustering Hierarchy (LEACH) merupakan algoritma routing pada Wireless Sensor Network (WSN) berbasis cluster. LEACH memilih sebuah node sebagai cluster head (CH) yang tugasnya untuk melakukan komunikasi dengan sink maupun guna mengumpulkan data dari member node. Persebaran CH pada LEACH yang dikatakan acak, kadang mengalami masalah mengingat rumus probabilitas pada tiap round. Hal ini akan menyebabkan CH yang terpilih bisa berada di tepi area, juga terjadinya pemborosan energi karena jalur yang terbentuk akan menjadi panjang. Oleh karena itu, kami ingin mengembangkan routing protocol G-LEACH menggunakan teknik merge CH dalam suatu area (grid) disertai beberapa parameter yang relevan, seperti posisi node, node dengan sisa energi terbesar, dan jarak yang dihitung dalam tiga jarak yaitu jarak node menuju cluster center, jarak node menuju merge CH, dan jarak merge CH menuju sink. Hasil pengujian menunjukan bahwa dengan menggabungkan cluster (merge CH) pada transmisi data menuju sink pada protokol G-LEACH dapat menghasilkan masa hidup jaringan yang lebih lama pada seluruh operasi node, energi yang dibutuhkan pada semua node lebih rendah, dan lebih banyak paket data yang dikirim dan diterima oleh sink. Low Energy Adaptive Clustering Hierarchy (LEACH) is a routing algorithm in a cluster-based Wireless Sensor Network (WSN). LEACH selects a node as a cluster head (CH) whose responsibility is for communicating with sinks and collect data from the node members. The distribution of CH on LEACH, which is basically random, sometimes has a problem in remembering the probability formula on each round. This may make the selected CH on the edge of the area as well as generate energy waste because the pathway formed will be lengthy. Therefore, we would like to develop the G-LEACH routing protocol using a merge CH technique in one area (grid) with several relevant parameters, such as the position of the node, the node with the largest remaining energy, and the distance calculated in three distances: the distance of the node to the clustercenter, the distance of the node to the merge CH, and the distance of the merge CH to the sink. The test result showed that combining clusters (merge CH) in the data transmission to the sink in the G-LEACH protocol could produce a longer network life on all node operations, lower energy required for all nodes, and more data package sent and received by the sink.


2020 ◽  
Vol 4 (1) ◽  
pp. 192-200
Author(s):  
Ahmad Ridwan ◽  
Rian Ferdian ◽  
Rahmadi Kurnia

Wireless sensor networks (WSNs) are small devices that are run by batteries as minimal energy resources. The cluster method is one of the ways on WSN that is widely applied to the routing protocols to extend the network's lifespan. Low-Energy Adaptive Clustering Hierarchy (LEACH) is a cluster-based protocol proven to increase energy efficiency in sensor networks. However, LEACH also has disadvantages such as a selection of cluster heads that don't consider residual energy at every node. It is the cause of failure in the election process and affects the stability of the network cluster. Period network stability is essential as reliable feedback from a network. Therefore, this study tries to investigate and solve stability problems in the LEACH algorithm. In this paper, the authors propose a new protocol that is Optimization-LEACH (O-LEACH), which is the development of the LEACH protocol. The O-LEACH protocol cluster-head selection process is developed based on the initial energy of each node, and a new beginning energy levels calculated from each node to every round. The test results show that the proposed O-LEACH protocol has a better stability period and network lifetime than the LEACH protocol.  


Sign in / Sign up

Export Citation Format

Share Document