A Novel cluster-based routing protocol with extending lifetime for wireless sensor networks

SummaryEnergy conservation and fault tolerance are two critical issues in the deployment of wireless sensor networks (WSNs). Many cluster‐based fault‐tolerant routing protocols have been proposed for energy conservation and network lifetime maximization in WSNs. However, these protocols suffer from high frequency of re‐clustering as well as extra energy consumption to tolerate failures and consider only some very normal parameters to form clusters without any verification of the energy sufficiency for data routing. Therefore, this paper proposes a cluster‐based fault‐tolerant routing protocol referred as CFTR. This protocol allows higher energy nodes to become Cluster Heads (CHs) and operate multiple rounds to diminish the frequency of re‐clustering. Additionally, for the sake to get better energy efficiency and balancing, we introduce a cost function that considers during cluster formation energy cost from sensor node to CH, energy cost from CH to sink, and another significant parameter, namely, number of cluster members in previous round. Further, the proposed CFTR takes care of nodes, which have no CH in their communication range. Also, it introduces a routing algorithm in which the decision of next hop CH selection is based on a cost function conceived to select routes with sufficient energy for data transfer and distribute uniformly the overall data‐relaying load among the CHs. As well, a low‐overhead algorithm to tolerate the sudden failure of CHs is proposed. We perform extensive simulations on CFTR and compare their results with those of two recent existing protocols to demonstrate its superiority in terms of different metrics.

Limited energy supply (battery-powered) is a crucial problem in wireless sensor networks (WSNs). Sensor node placement schemes and routing protocols are mostly proposed to address this problem. In this paper, we first present how to place sensor nodes by use of a minimal number of them to maximize the coverage area when the communication radius of the sensor node is different from the sensing radius, which results in the application of regular topology to WSNs deployment. With nodes placed at an equal distance and equipped with an equal power supply, the problem of unbalanced energy consumption in 2-D regular topologies becomes more severe and much more difficult to tackle than that in 1-D chains, though the latter is known as an already quite hard problem. We address this problem and propose an adaptive data collection scheme by employing different communication radii for nodes in different locations to balance the energy consumption in WSNs. In order to achieve the ultimate goal of maximizing network lifetime in grid-based WSNs, we give a mathematical formulation, which shows the problem of maximizing network lifetime is a nonlinear programming problem and NP-hard even in the 1-D case. We discuss several heuristic solutions and show that the halving shift data collection scheme is the best solution among them. We also generalize the maximizing network lifetime problem to the randomly-deployed WSNs, which shows the significance of our mathematical formulation for this crucial problem in WSNs.

The lifetime of Wireless Sensor Network (WSN) is based on the energy of each sensor. Therefore, numerous routing protocols have been introduced such as SEP (Stable Election Protocol), LEACH (Low energy adaptive clustering hierarchy) and EAMMH (Energy Aware Multi-hop Multi-path Hierarchical routing protocol) to stable the lifetime of WSN by efficient utilization of energy of the sensors. In WSN networks data is collected and forwarded wirelessly to the base stations. Routing protocols in WSN provide an efficient path for multi-hop communication because the transmission range and battery power storage of nodes is limited. As nodes are usually deployed in remote areas so, they face challenges of long lifetime, network architecture, security issues, and network coverage. Many routing protocols have been developed to increase the efficiency of networks. Out of these clustering algorithms are the best choice to increase the lifetime of the nodes. Each protocol has its limitations in different scenarios. In this paper, we discussed and compared the performance of LEACH, EAMMH and SEP. SEP is an efficient algorithm due to its weighted cluster head (CH) selection method. Simulation results are obtained using MATLAB. Design metrics of energy consumption and network lifetime are under consideration in this research work.

Nowadays Wireless Sensor Networks WSNs are playing a vital role in several application areas ranging health to battle field. Wireless sensor networks are easy to deploy due to its unique characteristics of size and self-organizing networks. Wireless sensor nodes contain small unchangeable and not chargeable batteries. It is a resource constraint type network. Routing in WSN is most expensive task as it utilizes more power resources. This paper is intended to introduce energy efficient routing protocol, known as Position Responsive Routing Protocol (PRRP) to enhance energy efficiency of WSN. Position responsive routing protocol differs in several ways than other existing routing techniques. Position response routing protocol approach allows fair distribution of gateway\cluster head selection, maximum possible distance minimization among nodes and gateways\cluster heads to utilize less energy. Position responsive routing protocol shows significant improvement of 45% in energy efficiency of wireless sensor network life time as a whole by increasing battery life of individual nodes. Furthermore PRRP shows drastic increases for data throughput and provide better solution to routing energy hole due to it fair distributed approach of gateway selection. This work is the extension of Energy efficient routing protocol for wireless sensor network published in IEEE ICACT 2014.

Designing and development of energy effective path planning algorithm is very key research domain in order to tackle the issues of limited life-time for Wireless Sensor Networks (WSNs). So in WSNs, energy efficiency is major concern of researchers. Overall advancement in routing protocols prove that clustering is much better approach as compared to flat and location-based energy efficient routing protocols. Due to better performance, multiple energy efficient clustering routing protocols have been proposed. But existing clustering algorithms are centralized or distributed, which are not intelligent enough and do not produce hybrid cluster-head selection. In this paper, we propose a cluster structured path planning algorithm named, Hybrid Advance Distributed Centralized Clustering (HADCC) path planning energy efficient algorithm. HADCC proposed model is fascinated with hybrid cluster head selection algorithm. This hybrid algorithm makes decision of cluster head selection of nodes. In order to execute proposed model we have also proposed an advance network topology, in which the whole network region is divided into two physical levels. First physical level consists of a circular region, containing homogeneous normal nodes and all important Base Station. While, second physical level is outer region of the circle that contains advanced heterogeneous nodes. Simulation results indicate that HADCC prolongs the network lifetime as compared to existing advanced clustering routing protocols for both homogeneous and heterogeneous WSNs. HADCC outperforms in case of stability and network life time as compared to the existing clustering algorithms.

Wireless sensor networks (WSNs) are formed using a cluster of sensor nodes (SNs), deployed randomly to perform sensing operations in an area under observation. Due to the unavailability of an external power source, the energy efficiency considered as one of the critical issues in WSNs. Selection of a sensor node (SN) from a wireless sensor network (WSN) cluster to serve as an aggregator or cluster head (CH), considered as an efficient method to increase the lifetime of wireless sensor network (WSN). In this paper, we have proposed an energy efficient CH selection scheme for WSN, to enhance the lifetime and average residual energy of a single WSN cluster. The proposed strategy nominates a group SNs as CHs, based on their channel condition with the base station (BS) and their residual energy. The proposed algorithm is helpful in solving the problem of unbalanced energy consumption in WSNs. Furthermore, the mechanism of using mobile sink during the hand-off stage helps to overcome the delay in data transmission. Moreover, the incorporation of energy harvesting significantly increases the lifetime of WSN. In comparison to a state-of-art technique available in the literature, our scheme shows a 33% increase in lifetime and presents a steady decrease in residual energy for the same rounds of data transmission.

Wireless sensor network is an emerging technology capable of having low-cost and low-power and battery-powered sensor node. At this point the protocol concentric clustered power-efficient gathering in sensor information systems and clustered general self organized tree based energy-balance routing protocol energy efficient protocol are used to increase the energy and to extend network lifetime. For these achievement of clustering techniques, optimization technique particle swarm optimization is used for data transmission through base station. If the base station is inaccessible region from the cluster-head, energy consumption will be augmented and it can shrink the lifetime of wireless sensor network. To conquer these, multi-hop gateway node is implemented with both protocol to achieve maximum lifetime and energy efficiency of wireless sensor network. To improve the quality-of-service (QoS) placing more number of gateways is required. So we propose a new algorithm nearer optimal algorithm which recursively computes least possible adequate dominating sets, at the time constantly preserving QoS requirements across iterations. In this paper comparison is done in terms of throughput, packets delivery ratio and number of nodes alive.

—Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

Wireless sensor networks (WSNs) consist of an enormous number of tiny sensor nodes deployed in huge numbers which are able to sense, process and transmit environmental information to the base station (BS) for a variety of applications. Energy efficiency is one of the primary concerns for maintaining WSN in operation. In this study, an energy efficient clustering protocol based on K‐means algorithm named EECPK‐means has been proposed for WSN where midpoint algorithm is used to improve initial centroid selection procedure. The proposed approach produces balanced clusters to ultimately balance the load of cluster heads (CHs) and prolong the network lifetime. It considers residual energy as the parameter in addition to Euclidean distance used in basic K‐means algorithm for appropriate CH selection. Multi‐hop communication from CH nodes to BS takes place depending on their distances from BS. Simulation result shows that the proposed approach outperforms LEACH‐B, balanced parallel K‐means (BPK‐means), Park's approach and Mk‐means with respect to network lifetime and energy efficiency. Simulation result also demonstrates that the proposed approach can reduce the energy consumption at most 50% compared to LEACH‐B, 14% compared to BPK‐means protocol, 10% compared to Park's approach and 6% compared to Mk‐means.

Division of the entire wireless sensor network geographic area into number of equal sized regions by applying virtual grid and strategy to appoint head node of the cluster in each region improves stability, consistency, and lifetime of the wireless sensor network. Applying the same size of grid to the different size of wireless sensor networks will not give consistent performance. In this paper, we are presenting a protocol which will dynamically determine the size of the virtual grid, which will give optimal performance of any geographic sized wireless sensor network. The protocol also allows to place sink node to any location and not at some fixed specific location. Protocol discussed in this paper can also support multiple sink nodes. Protocol dynamically takes decision to transmit the data directly to the sink node or by using multi-hop transmission by considering distances between sensor nodes internally and sink node(s), which will optimize energy efficiency of the sensor nodes and increases the lifetime of wireless sensor network.

SummaryIn wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering‐based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked–LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols.

Nowadays wireless sensor Networks (WSNs) have significant task into diverse field. Sensor network include several sensor nodes designed for the principle of sensing the information from the surroundings of a particular area. Sensor nodes include restricted battery time with their recharging be difficult. As a result, to rest the time span of WSNs various optimization techniques have been introduced. Cluster be the organized as a set of groups of sensor nodes. Clustering is a procedure toward utilize the energy of system resourcefully. The primary hierarchical based clustering algorithm was LEACH wherein Cluster Heads (CHs) are determined through means of probabilistic approach into a distributed method. several new protocols have be introduce which make use of select the cluster heads along with rotating them toward sense of steadiness the energy practice. In this paper investigates configuration of cluster, predominantly promote a novel scheme; mobility based LEACH-ERE along by Handover method is used for proficient cluster head choice for efficient the network life span.

Wireless sensor networks (WSNs) are widely applied in monitoring and communication but remain constrained by limited energy resources. Efficient routing protocols are critical to prolong network lifetime and ensure balanced energy consumption among sensor nodes. Traditional cluster-based routing often fails to achieve optimal energy balance, leading to premature node failures and degraded performance. Intelligent optimization algorithms, including meta heuristics such as particle swarm optimization (PSO) and emperor penguin optimization (EPO), have been applied to improve routing efficiency. These methods enhance convergence and adaptability but typically operate as standalone approaches. Limited attention has been given to integrating multi criteria decision making (MCDM) methods with meta heuristics. Without this integration, assigning precise weights to multiple criteria and balancing energy consumption across nodes remains difficult. This paper proposes a novel uneven cluster-based routing protocol that integrates fuzzy constrained nonlinear programming- variable weight analysis-technique for order preference by similarity to ideal solution (FCNP-VWA-TOPSIS) with an improved EPO. The protocol first assigns accurate weights to seven multi criteria using FCNP VWA and selects cluster heads (CHs) with TOPSIS. It then constructs the routing tree using improved EPO guided by the weighted fitness function. Extensive simulations show that the proposed protocol achieves superior energy balance, extending network lifetime by 158.0%, 119.3%, and 113.7% compared to uneven clustering routing (UCR), unequal clustering fuzzy logic intelligent algorithm (UCFIA), and fuzzy multi-criteria clustering and bio-inspired energy-efficient routing (FMCB ER), respectively. By combining MCDM and meta heuristic optimization, the protocol advances cluster-based routing in WSNs, significantly enhancing energy efficiency and reliability for real world applications.

The paper presents a novel algorithm called Modified End-to-End Secure Low Energy Adaptive Clustering Hierarchy (ME-LEACH) for extending the lifetime of Wireless Sensor Networks (WSNs).Energy constraints are a significant challenge in WSNs, and thus, efficient energy usage is essential for all activities within a WSN.Existing protocols have been introduced to address energy dissipation issues, such as the End-to-End Secure Low Energy Adaptive Clustering Hierarchy (E-LEACH) protocol, which is a hierarchical routing algorithm.However, E-LEACH suffers from high energy consumption as each Cluster Head (CH) directly sends data to the base station.In the proposed ME-LEACH method, a CH identifies the nearest CH and uses it as the next hop, forming a chain of CHs that serve as a path to the base station or sink.This approach aims to improve energy efficiency in WSNs and reduce energy dissipation during data transmission.The widespread applications of WSNs in various fields of science and technology highlight the significance of this research.

Hybrid meta-heuristic optimization based energy efficient protocol for wireless sensor networks