scholarly journals E-FLEACH: An Improved Fuzzy Based Clustering Protocol for Wireless Sensor Network

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.

Author(s):  
Nezha El Idrissi ◽  
Abdellah Najid ◽  
Hassan El Alami

Energy conservation plays a role important in wireless sensor network (WSN) design. The technique of clustering is one of the approaches to save energy of WSNs; several protocols based on the clustering technique are proposed in the context of energy conservation and maximization of network lifetime. This article proposed a new routing technique to maximize the network lifetime and enhance energy efficiency in WSNs, namely optimal selection of cluster head in the grid (OSCH-Gi). This technique divides the network area into a clustered grid. Each clustered grid has a cluster head (CH) it has been chosen based on the residual energy and distance to the base station of each node. Simulation results indicate that the proposed technique is more effective than other clustering algorithms in terms of the network lifetime and energy consumption.


Author(s):  
Sandeep Kaur ◽  
Dr. Rajeev Bedi ◽  
Mohit Marwaha

In WSNs, the only source to save life for the node is the battery consumption. During communication with other area nodes or sensing activities consumes a lot of power energy in processing the data and transmitting the collected/selected data to the sink. In wireless sensor networks, energy conservation is directly to the network lifetime and energy plays an important role in the cluster head selection. A new threshold has been formulated for cluster head selection, which is based on remaining energy of the sensor node and the distance from the base station. Proposed approach selects the cluster head nearer to base station having maximum remaining energy than any other sensor node in multi-hop communication. The multi hop approach minimizing the inter cluster communication without effecting the data reliability.


2020 ◽  
Vol 10 (21) ◽  
pp. 7886
Author(s):  
Atefeh Rahiminasab ◽  
Peyman Tirandazi ◽  
M. J. Ebadi ◽  
Ali Ahmadian ◽  
Mehdi Salimi

Wireless sensor networks (WSNs) include several sensor nodes that have limited capabilities. The most critical restriction in WSNs is energy resources. Moreover, since each sensor node’s energy resources cannot be recharged or replaced, it is inevitable to propose various methods for managing the energy resources. Furthermore, this procedure increases the network lifetime. In wireless sensor networks, the cluster head has a significant impact on system global scalability, energy efficiency, and lifetime. Furthermore, the cluster head is most important in combining, aggregating, and transferring data that are received from other cluster nodes. One of the substantial challenges in a cluster-based network is to choose a suitable cluster head. In this paper, to select an appropriate cluster head, we first model this problem by using multi-factor decision-making according to the four factors, including energy, mobility, distance to centre, and the length of data queues. Then, we use the Cluster Splitting Process (CSP) algorithm and the Analytical Hierarchy Process (AHP) method in order to provide a new method to solve this problem. These four factors are examined in our proposed approach, and our method is compared with the Base station Controlled Dynamic Clustering Protocol (BCDCP) algorithm. The simulation results show the proposed method in improving the network lifetime has better performance than the base station controlled dynamic clustering protocol algorithm. In our proposed method, the energy reduction is almost 5% more than the BCDCP method, and the packet loss rate in our proposed method is almost 25% lower than in the BCDCP method.


2019 ◽  
Vol 8 (4) ◽  
pp. 11996-12003

Wireless Sensor network becomes an essential part of Internet of things paradigm due their scalability, ease of deployment and user-friendly interface. However, certain issues like high energy consumption, low network lifetime and optimum quality of service requirement force researchers to develop new routing protocols. In WSNs, the routing protocols are utilized to obtain paths having high quality links and high residual energy nodes for forwarding data towards the sink. Clustering provide the better solution to the WSN challenges by creating access points in the form of cluster head (CH). However, CH must tolerate additional burden for coordinating network activities. After considering these issues, the proposed work designs a moth flame optimization (MFO) based Cross Layer Clustering Optimal (MFO-CLCO) algorithm to consequently optimize the network energy, network lifetime, network delay and network throughput. Multi-hop wireless communication between cluster heads (CHs) and base station (BS) is employed along with MFO to attain optimum path cost. The simulation results demonstrate that the proposed scheme outperforms existing schemes in terms of energy consumption, network lifetime, delay and throughput.


2020 ◽  
Vol 2020 ◽  
pp. 1-9 ◽  
Author(s):  
Aruna Pathak

In wireless sensor network, replacement of node’s battery is very tough task in hostile environments. Therefore, to maximize network lifetime is the ultimate solution. Dividing the sensing region of wireless sensor network into clusters is an excellent approach to gain high energy efficiency and to enhance lifetime of the network. On the other hand, heads of the cluster need additional energy because of additional work such as obtaining data from its member nodes, aggregation of their data, and finally sending it to the base station. To enhance the lifetime of these networks, proper selection of heads plays a vital role. In this paper, we propose proficient bee colony-clustering protocol (PBC-CP) which is based on artificial bee colony algorithm. In PBC-CP approach, we have taken important factors for selection of heads such as node’s energy, degree of node, and distance from base station to node. For transmitting the data from cluster head to base station, it chooses the energy-efficient path which further minimizes the energy consumption of sensor network. Simulation experiments show the effectiveness of our proposed approach.


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.


Author(s):  
S. JERUSHA ◽  
K. KULOTHUNGAN ◽  
A Kannan

Wireless sensor nodes are usually embedded in the physical environment and report sensed data to a central base station. Clustering is one of the most challenging issues in wireless sensor networks. This paper proposes a new cluster scheme for wireless sensor network by modified the K means clustering algorithm. Sensor nodes are deployed in a harsh environment and randomly scattered in the region of interest and are deployed in a flat architecture. The transmission of packet will reduce the network lifetime. Thus, clustering scheme is required to avoid network traffic and increase overall network lifetime. In order to cluster the sensor nodes that are deployed in the sensor network, the location information of each sensor node should be known. By knowing the location of the each sensor node in the wireless sensor network, clustering is formed based on the highest residual energy and minimum distance from the base station. Among the group of nodes, one node is elected as a cluster head using centroid method. The minimum distance between the cluster node’s and the centroid point is elected as a cluster head. Clustering of nodes can minimize the residual energy and maximize the network performance. This improves the overall network lifetime and reduces network traffic.


2021 ◽  
Vol 20 (3) ◽  
pp. 161-166
Author(s):  
Asma Mesmoudi ◽  
Samira Mesmoudi ◽  
Zakarya Houari ◽  
Khelifa Mostefa

Wireless sensor networks have recently gained a lot of attention from the scientific community due to their very wide spectrum of applications. In such networks, the sensor nodes have limited resources. These constraints impose many challenges to the design of related protocols. Especially, routing protocols should be energy-efficient for the prolonged network lifetime. The LEACH protocol is the most popular energy-efficient hierarchical clustering protocol for WSNs that was proposed for reducing power consumption. However, LEACH suffers from several drawbacks such as the non uniform distribution of Cluster Head nodes, the possibility of choosing a low energy node as Cluster Head, etc. In this paper, an attempt is made to overcome this shortcoming by introducing a new hierarchical clustering protocol, called SCHP (Static Cluster-based Hierarchical Protocol). The SCHP protocol is based on a static cluster creation and an optimal cluster head selection. Simulation results show that the proposal guarantees better performance than the LEACH Protocol that is considered as the baseline in the literature. We used many metrics, as packet loss rate, end-to-end delay, and energy consumption to evaluate the efficiency of our proposal. We show also that the SCHP protocol can improve the network lifetime.


Author(s):  
Peng Xiong ◽  
Qinggang Su

Due to the resource constraint, in wireless sensor network, the node processing ability, wireless bandwidth and battery capacity and other resources are scarcer. For improving the energy efficient and extend the lifetime of the network, this paper proposes a novel algorithm with the distributed and energy-efficient for collecting and aggregating data of wireless sensor network. In the proposed protocol, nodes can autonomously compete for the cluster head based on its own residual energy and the signal strength of its neighbouring nodes. To reduce the energy overhead of cluster head nodes, with a multi-hop way among cluster heads, the collected data from cluster heads is sent to a designated cluster head so as to further send these data to a base station. For improving the performance of the proposed protocol, a new cluster coverage method is proposed to fit the proposed protocol so that when the node density increases, network lifetime can be increased linearly as the number of nodes is increased. Simulations experiments show that network lifetime adopting the proposed protocol is sharply increased. And, the proposed protocol makes all the nodes die (network lifetime is defined as the death of last one node) in the last 40 rounds so that networks adopting the proposed protocol have higher reliability than networks adopting compared protocols.


2010 ◽  
Vol 11 (1) ◽  
pp. 51-69
Author(s):  
S. M. Mazinani ◽  
J. Chitizadeh ◽  
M. H. Yaghmaee ◽  
M. T. Honary ◽  
F. Tashtarian

In this paper, two clustering algorithms are proposed. In the first one, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECS-M that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability.  In the competition phase in contrast to EECS using a fixed competition range for any volunteer node, we assign a variable competition range to it that is related to its distance to base station. The volunteer nodes compete in their competition ranges and every one with more residual energy would become cluster head. In the second one, we develop a clustering protocol for single hop wireless sensor networks. In the proposed algorithm some of the nodes become volunteers to be cluster heads. We develop a time based competitive clustering algorithm that the advertising time is based on the volunteer node’s residual energy. We assign to every volunteer node a competition range that may be fixed or variable as a function of distance to BS. The volunteer nodes compete in their competition ranges and every one with more energy would become cluster head. In both proposed algorithms, our objective is to balance the energy consumption of the cluster heads all over the network. Simulation results show the more balanced energy consumption and longer lifetime.


Sign in / Sign up

Export Citation Format

Share Document