IJERT-Energy Efficient Leader Election and Congestion Aware Protocol for Wireless Sensor Networks (original) (raw)

Improving the Energy Efficiency of a Cluster Head Election for Wireless Sensor Networks

International Journal of Distributed Sensor Networks, 2014

Sensor Networks can perceive the extensive area by applying many sensor nodes because the size of sensor nodes is relatively small and cheap. Sensor nodes can transfer multi-hop data to sink nodes which are far away than sending and receiving distance. Generally sensor nodes are composed of a large size so it is difficult that much capacity is loaded on nodes. Many routing methods are proposed in order to raise energy efficiency in sensor networks field. There is a routing method based on structure as a composing method of network by cluster. Cluster technology consisting and maintaining network topology based on cluster is mostly studied in routing protocol. There are demerits that LEACH, EACHS shall be rest energy of all nodes and HEED does not guarantee the number of cluster head. Proposed energy efficiency of selected cluster head guarantees the number of cluster head which is a demerit of HEED and minimizes the node of DEAD.

A local cluster head election algorithm in wireless sensor networks

2011 CSI International Symposium on Computer Science and Software Engineering (CSSE), 2011

Clustering is one of the basic approaches for designing energy-efficient and scalable distributed sensor networks. HEED is a well known energy efficient clustering protocol. In this protocol, the message overhead is low and cluster heads are distributed fairly across the network. Our distributed clustering protocol, HEED*, improves HEED protocol to achieve energy efficiency with three techniques: 1) local clustering, i.e., whenever a cluster head consumes a prespecified part of its energy, it only informs its member nodes to hold cluster head elections for the upcoming round. Therefore, clustering is performed locally (in contrast to performing it globally). 2) Reducing the number of message exchanges per iteration through eliminating unnecessary cluster head messages. 3) In HEED*, a node with higher amount of remaining energy is considered more eligible candidate for election as a cluster head. Besides, each node computes a communication cost, and a regular (non cluster head) node elects the cluster head with the least communication cost to connect to. Simulation results show that the protocol outperforms HEED protocol in terms of network lifetime.

LELE: Leader Election with Load Balancing Energy in Wireless Sensor Network

2009 WRI International Conference on Communications and Mobile Computing, 2009

In this article the LEACH (low energy adaptive clustering hierarchy) in the homogeneous wireless sensor networks (WSNs) was considered and a new protocol with an approach toward promoting LEACH was introduced. In the new protocol which is called LELE (leader election with load balancing energy), the major work was how to elect the leader which was done through changing the sensor's energy, LELE protocol compares the amount of energy and distance of a node with its neighbouring sensors to elect it as leader. And, finally the sensor with the higher energy (has more suitable position as compared with the neighbouring nodes ) for chosen as the leader. After simulating the new protocol and comparing it with the previous protocol it was well observed that LELE in addition to balancing the energy and throughput, increases the network's lifetime as compared with that of LEACH. In the new protocol the time distance between the observation of the first dead sensor and the last sensor's having lost its energy is so short.

Dynamic Cluster Head Node Election (DCHNE) Model over Wireless Sensor Networks (WSNs)

WSNs are becoming an appealing research area due to their several application domains. The performance of WSNs depends on the topology of sensors and their ability to adapt to changes in the network. Sensor nodes are often resource constrained by their limited power, less communication distance capacity, and restricted sensing capability. Therefore, they need to cooperate with each other to accomplish a specific task. Thus, clustering enables sensor nodes to communicate through the cluster head node for continuous communication process.

CLUSTER HEAD ELECTION USING WIRELESS SENSOR NETWORK

Abstract: Wireless sensor networks are equipped to handle more complex functions. In a network processing may require these battery powered sensor to judiciously use their constrained energy to prolong the effective network life time especially in a heterogeneous settings. Nodes are organized into clusters and in each cluster all non-cluster nodes transmit their data only to the cluster-head. Because of energy limitation in sensor nodes are energy reduction in each data transmission; appropriate cluster-head election can significantly reduce energy consumption and enhance the life of the network. Clustered techniques have since been employed to optimize energy consumption in this energy constrained wireless sensor networks. In this paper, we consider LEACH protocol in which most nodes transmit to cluster heads and explore how to elect the cluster heads with mobility as its parameter. Efficient distributed algorithms for cluster-head election in terms of energy are provided. Mobility based communication can prolong the life time of WSNs and increases the connectivity of cluster head. The experiment results show that our cluster-head election algorithms used in LEACH with the help of other two parameters (Euclidean distance and Mobility) can make the node live longer. Keywords: Wireless sensor networks, Cluster head, LEACH Protocol, Cluster Head Probability, Mobility. Title: CLUSTER HEAD ELECTION USING WIRELESS SENSOR NETWORK Author: Arti Khatri International Journal of Computer Science and Information Technology Research ISSN 2348-120X (online), ISSN 2348-1196 (print) Research Publish Journals

Cluster Head Election in Wireless Sensor Network: A Comprehensive Study and Future Directions

International Journal of Computer Networks and Applications (IJCNA), 2020

Due to the advancement of wireless communication interchanges, electronic technology, and micro-electro-mechanical devices, Wireless Sensor Network (WSN) has got advanced as a promising zone of research. WSN consists of a collection of sensor nodes having a little calculative capability, limited memory, and constrained energy assets. Clusters are formed from the collection of sensor nodes whose leader node (Cluster head) can send the sensed information from hubs to the BS. To condense the power consumption and boost group longevity, the cluster head executes data accumulation. This paper discusses many algorithms based on deterministic, probabilistic, adaptive, fuzzy logic, and Multi-attribute decision-making techniques for clustering and cluster head election. Existing algorithms enhance the network lifetime and energy efficiency but fail to provide a better quality of service and security. So many issues and challenges have been laid down and it is concluded that when computational intelligence is combined with network intelligence then QoS and security both can be provided along with the network longevity and energy efficiency in homogeneous as well as a heterogeneous environment.

A New Energy Efficient Cluster based Protocol for Wireless Sensor Networks

Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, 2015

In Wireless Sensor Networks (WSNs), clustering techniques are usually used as a key effective solution to reduce energy consumption and prolong the network lifetime. Despite many works on clustering in WSNs, this issue is still, however, in its infancy as most existing solutions suffer from long and iterative clustering cycles. In an attempt to fill in this gap, we propose a new cluster-based protocol, referred to as Load-balancing Cluster Based Protocol (LCP) that introduces a new inter-cluster approach to increase network lifetime. This new protocol rotates continuously the election of the Cluster Head (CH) election in each cluster, and selects the node with the highest residual energy in each round. Extensive simulation experiments show that our proposed approach effectively balances energy consumer among all sensor nodes and increases network lifetime compared to other clustering protocols.

Cluster head election schemes for WSN and MANET: A survey

World Applied Sciences Journal, 2013

Wireless Sensor Network (WSN) is an arrangement of sensor nodes to collect environmental data and send it to Base Station (BS). Mobile Adhoc Networks (MANET) is a network composed of itinerant nodes via wireless links in deficiency of any infrastructure or topology. Nodes of WSN and MANET are divided into clusters to create a temporary infrastructure for the nodes. A cluster is supervised by a leader node called Cluster Head (CH). Purpose of CH is to maintain the list of affiliated nodes and commune with other cluster heads. CH election is a vital process in cluster based networks. Many parameters can be used for electing the node as a cluster head such as location, mobility, battery, throughput etc. Numerous techniques for selecting cluster head have been proposed by researchers, focusing on parameters. We present in this paper a wide taxonomy about Cluster Head Selection method in Wireless Sensor Networks. At the end of each section we have presented a comprehensive analysis of different methods.

Invulnerable Cluster Head Election Model to Handle Selfishness in Wireless Sensor Network

Research Journal of Applied Sciences, Engineering and Technology, 2015

Wireless Sensor Networks have found a vital place in current rapid moving world. Clustering is one of the most efficient and traditional methods for routing in such sensor networks. This study aims to propose an efficient cluster head election model to handle selfishness in the wireless sensor network. Clustering plays a very important role to increase the lifetime of the wireless sensor networks. In clustering techniques, every group called a cluster is controlled by the cluster head. Each sensor transmits its collected information to the base station via the cluster head. The load to the cluster head is higher than its members because it requires performing tasks like data aggregation, control and reporting to base station. In this case, the sensor nodes may act selfishly to participate in the cluster head selection process. To avoid selfishness in the cluster head selection process, the proposed scheme uses rate analysis method. In the proposed scheme, the load of the cluster head is shared among its members. The rate analysis value is updated for each and every round. So, all the sensors can honestly participate in the election without selfishness. The proposed scheme is gauged by using the QoS metrics through simulation results obtained by Network Simulator.

Distributed Algorithms for Energy-Efficient Cluster-head Election in Wireless Mobile Sensor Networks

The cluster-based architecture is an effective way to achieve the objective of energy efficiency in wireless sensor networks. One of the critical issues in wireless sensor networks is data-gathering. In this paper, we consider the cluster-based protocol for data-gathering and explore how to elect the cluster- heads with node mobility. Two efficient distributed algorithms for cluster-head election in terms of energy consumption are provided. The proposed algorithms will make each round have the same number of cluster-heads (except the final rounds) and guarantee that each round has at least one cluster-head elected. Two mobility models, Random Walk Mobility model and Random Direction Mobility model, are considered in this paper for node mobility. Last, we implement the algorithms and perform the experiments for evaluation. The experiment results show that our cluster-head election algorithms both outperform the cluster- head election strategy used in LEACH and can make the system liv...