Comparison of Residual Energy-Based Clustering Algorithms for Wireless Sensor Network

Wireless sensor networks consist of small nodes with sensing, computation, and wireless communications capabilities.Many routing, power management, and data dissemination protocols have been specifically designed for WSNs where energy awareness is an essential design issue.Routing protocols in WSNs might differ depending on the application and network architecture.In this article we present a survey of stateof-the-art routing techniques in WSNs.We first outline the design challenges for routing protocols in WSNs followed by a comprehensive survey of routing techniques.Overall, the routing techniques are classified into three categories based on the underlying network structure: flit, hierarchical, and location-based routing.Furthermore, these protocols can be classified into multipath-based, query-based, negotiation-based, QoSbased, and coherent-based depending on the protocol operation.We study the design trade-offs between energy and communication overhead savings in every routing paradigm.We also highlight the advantages and performance issues of each routing technique.The article concludes with possible future research areas.

Wireless sensor networks (WSNs) have been an emerging field in recent years. WSNs have major advantages in battlefields and emergency situations. However, due to the limited power of the sensor nodes, WSNs are restricted with their applications. The effective management of energy over the sensor nodes leads to good performance of the network. In this paper, we are proposing the energy-aware cluster head selection algorithm (ECHSA) for WSNs. The cluster head selection plays a major role in reducing the energy consumption of the cluster. To support our approach, the minimum energy transmission is proposed, and the simulation of the ECHSA is carried out with the NS-2 simulation. The results are compared with the sectored low energy adaptive cluster head (S-LEACH) and Theins algorithms. The results proved the efficiency of the proposed algorithm.

Wireless sensor networks are energy constraint networks. Energy efficiency, to prolong the network for a longer time is critical issue for wireless sensor network protocols. Clustering protocols are energy efficient approaches to extend the lifetime of network. Intra-cluster communication is the main driving factor for energy efficiency of clustering protocols. Intra-cluster energy consumption depends upon the position of cluster head in the cluster. Wrongly positioned clusters head make cluster more energy consuming. In this paper, a simple and efficient cluster head selection scheme is proposed, named Smart Cluster Head Selection (SCHS). It can be implemented with any distributed clustering approach. In SCHS, the area is divided into two parts: border area and inner area. Only inner area nodes are eligible for cluster head role. SCHS reduces the intra-cluster communication distance hence improves the energy efficiency of cluster. The simulation results show that SCHS has significant improvement over LEACH in terms of lifetime of network and data units gathered at base station.

Radio transmission and reception consumes a lot of energy in a wireless sensor network (WSN), which are made of low-cost, low-power, small in size, and multifunctional sensor nodes. Thus, one of the important issues in wireless sensor network is the inherent limited battery power within the sensor nodes. Therefore, battery power is crucial parameter in the algorithm design in maximizing the lifespan of sensor nodes. It is also preferable to distribute the energy dissipated throughout the wireless sensor network in order to maximize overall network performance. Much research has been done in recent years in the area of low power routing protocol, but, there are still many design options open for improvement, and for further research targeted to the specific applications, need to be done. In this paper, we propose a new approach of an energy-efficient homogeneous clustering algorithm for wireless sensor networks in which the lifespan of the network is increased by ensuring a homogeneous distribution of nodes in the clusters. In this clustering algorithm, energy efficiency is distributed and network performance is improved by selecting cluster heads on the basis of (i) the residual energy of existing cluster heads, (ii) holdback value, and (iii) nearest hop distance of the node. In the proposed clustering algorithm, the cluster members are uniformly distributed and the life of the network is further extended.

Due to the characteristics of energy-limited, how to reduce the energy consumption of the wireless sensors network has become the crucial point. Research shows that it can reduce energy consumption to organize the nodes in the network into a hierarchical cluster structure. This paper synthetically analyzes several existing cluster algorithms, and then proposes an energy-efficient and variation-sensitive clustering algorithm. This algorithm makes some modification on the basis of some existing classical clustering algorithms. In order to reduce energy consumption, we adopt some special measures to form cluster, elect cluster head and change the way in which the sense data is constantly sent to cluster head by non-cluster head node.

The hierarchical topology of wireless sensor networks can effectively reduce the consumption in communication. Clustering algorithm is the foundation to realize herarchical structure, so it has been extensive researched. On the basis of Leach algorithm, a distance density based clustering algorithm (DDBC) is proposed, considering synthetically the distribution density of around nodes and the remaining energy factors of the node to dynamically banlance energy usage of nodes when selecting cluster heads. We analyzed the performance of DDBC through compared with the existing other clustering algorithms in simulation experiment. Results show that the proposed method can generare stable quantity cluster heads and banlance the energy load effectively.

Automatic localization is one of the major issues in Wireless Sensor Networks (WSN). DV-hop algorithm is a well-known localization algorithm in WSN but with limited localization accuracy. In this paper, an improved DV-hop localization algorithm in hybrid optical wireless sensor networks is proposed based on the optimization of the parameters in WSN. Various factors that affect the localization accuracy of the DV-hop algorithm in WSN are investigated, including the communication radius of the node, the number of beacon nodes and the number of the total nodes. As the DV-hop algorithm is applied into hybrid optical sensor and WSNs (O-WSN) with rectangular topology, different parameters have to be optimized accordingly. Simulation results show that the square topology outperforms the rectangle topology more than 45 % under the same network parameters using the improved DV-hop algorithm. Therefore another improved DV-hop called Sub-Square Weighted DV-hop (SSW DV-hop) is proposed for the rectangle topology. Both simulation and experiment results demonstrate that applying the SSW DV-hop algorithmin O-WSNs could significantly improve the localization accuracy.

The rapid growth in wireless technology is enabling a variety of advances in wireless sensor networks (WSNs). By providing the sensing capabilities and efficient wireless communication, WSNs are becoming important factor in day to day life. WSNs have many commercial, industrial and telecommunication applications. Maximizing network lifespan is a primary objective in wireless sensor networks as the sensor nodes are powered by a non-rechargeable battery. The main challenges in wireless sensor networks (WSNs) are area of coverage, network’s lifetime and aggregating. Balanced node establishment (clustering) is the foremost strategy for extending the entire network's lifetime by aggregating the sensed information at the head of the cluster. The recent research trend suggests Meta-heuristic algorithms for the intelligent selection of ideal Cluster Heads (CHs). The existing Cluster Head Selection (CHS) algorithm suffers from the inconsistent trade-offs between exploration – exploitation and global best examine constraints. In this research, a novel Camel series Elephant Herding Optimization (CSEHO) algorithm is proposed to enhance the random occurrences of Camel algorithm by the Elephant Herding Optimization algorithm for optimal CHS. The Camel algorithm imitates the itinerant actions of a camel in the desert for the scavenging procedure. The visibility monitoring condition of the camel algorithm improves the efficiency of exploitation, whereas the exploration inefficiency of a Camel algorithm is compensated optimally by the Elephant Herding Optimization operator (Clan and separator). The superior performance of the proposed CSEHO algorithm is validated by comparing its performance with various other existing CHS algorithms. The overall attainment of the offered CSEHO algorithm is 21.01%, 31.21%, 44.08%, 67.51%, and 85.66%, better than that of EHO, CA, PSO, LEACH, and DT, respectively.

In Wireless Sensor Network (WSN), unreasonable node clustering algorithm will inevitably lead to premature death, unawareness of regional information.To address problems of traditional LEACH algorithm, An improved LEACH multi-hop routing algorithm based on Energy Distance Threshold (EDT) is presented. It mainly improves from aspects of cluster number, cluster head selection and inter-cluster communication. The improved clustering hierarchy algorithm considers the nodes Energy Distance Threshold as an important factor in selection then chooses the best cluster head within the area. The selection of cluster head is based on re-select manner, which dynamically and effectively select cluster heads by control cluster number and combing with EDT. After cluster head completes local data fusion and processing, it look for adjacent cluster head as next hop closer to base station with larger EDT if the head is far away from station. The next hop repeats above process till the base station is arrived. Such manner of multi-hop among clusters enables communication among clusters and base stations so as to avoid direct communication between head and station. The method reduces energy consumption and also balances energy. Simulation results show the improved LEACH algorithm has higher energy utilizing rate, and it helps prolong network’s lifetime.

In general, environment monitoring cluster based hierarchical routing protocol is among the most common protocol being opted due to the load balancing among each other sensor. Sensors are randomly deployed in a specific area to collect useful information periodically for a few months or even a few years. Therefore, battery power limitation becomes a challenging issue. It is also impractical to maintain the network lifetime by changing the battery frequently. Low energy adaptive cluster hierarchical (LEACH) is one of the common clustering protocols that will elect the cluster head based on the probability model which will possibly lead to a reduce in network lifetime due to election of cluster head with a least desired location in the network. For wireless sensor networks, the distribution of cluster head selection directly influences the network's lifetime. This paper presents factors which will affect the network lifetime and apply fuzzy logic based cluster head selection conducted in base station. The base station considers two selection criteria from sensor nodes which are energy level and distance to the base station to select the suitable cluster head that will prolong the first node die (FND) time, data stream guaranteed for every round and also increase the throughput received by the base station before FND.

Effect of Heterogeneous Nodes Location on the Performance of Clustering Algorithms for Wireless Sensor Networks

SummaryThe arbitrary distribution of sensor nodes and irregularity of the routing path led to unordered data, which is complex to handle in a wireless sensor network (WSN). To increase WSN lifetime, data aggregation models are developed to minimize energy consumption or ease the computational burden of nodes. The compressive sensing (CS) provides a new technique for prolonging the WSN lifetime. A hybrid optimized model is devised for cluster head (CH) selection and CS‐based data aggregation in WSN. The method aids to balance the energy amidst different nodes and elevated the lifetime of the network. The hybrid golden circle inspired optimization (HGCIO) is considered for cluster head (CH) selection, which aids in selecting the CH. The CH selection is done based on fitness functions like distance, energy, link quality, and delay. The routing is implemented with HGCIO to transmit the data projections using the CH to sink and evenly disperse the energy amidst various nodes. After that, compressive sensing is implemented with the Bayesian linear model. The convolutional neural network‐long short term memory (CNN‐LSTM) is employed for the data aggregation process. The proposed HGCIO‐based CNN‐LSTM provided the finest efficiency with a delay of 0.156 s, an energy of 0.353 J, a prediction error of 0.044, and a packet delivery ratio (PDR) of 76.309%.

For the problems of uneven clustering, unreasonable selection of cluster heads and excessive energy consumption in wireless sensor networks for smart grid, an energy efficient clustering algorithm for wireless sensor networks in smart grid (EECSG) is proposed. The algorithm first calculates the optimal number of cluster heads, and then uses k-means algorithm to evenly divide the whole network based on the optimal number of cluster heads. In the selection of cluster head, residual node energy and distance influence factor are introduced to comprehensively select, and finally the data is transmitted stably. The simulation results show that EECSG can dynamically determine the cluster head through the introduction of cluster head selection factor, which reduces the energy loss during data communication in the network and improves the overall life of the wireless sensor network.

Energy conservation is the most significant issue in wireless sensor networks due to limited power sources of sensor nodes that cannot be recharged or replaced. Clustering is considered to be energy-efficient in WSN as it reduces the number of sensor nodes taking part in long range communication. During clustering, each sensor node selects a cluster head (CH) to join a cluster among several candidate CHs. The selection of cluster head uses different parameters such as residual energy of cluster head and distance between node and cluster head. A poor selection of cluster head will lead to increased energy consumption in network that will degrade the network lifetime. Furthermore, sensor nodes are likely to fail due to different factors such as limited energy and environment hazards. So, the fault tolerance is another challenge for long run of the WSNs. In this paper, we propose a distributed fault-tolerant multi-objective clustering algorithm (DFMCA). In this algorithm, each sensor takes its decision using local information only. We also propose a recovery algorithm in case of sudden death of the cluster heads in the network. A simulation result demonstrates that our algorithm outperforms the existing state-of-the-art algorithms, namely FTCA and LBCA, in terms of network lifetime.

In general, wireless sensor network works by a small battery-powered, or limited energy. Once the wireless sensor network is deployed, the energy of small sensor nodes can not be replaced. So, to improve energy efficiency and extend the survival time of the whole network is a crucial issue. This paper presents a new type of energy balancing algorithm for wireless sensor networks. The BCDCP-M algorithm draws on the main idea of the BCDCP routing protocol. When the base station divides the network, the new algorithm makes the number of cluster heads equal to the optimal number of cluster heads as far as possible. On cluster head election, not only the average energy of the sensor network, but also the remaining energy of the individual node must be taken into account. In data transmission, we use the multi-hop method to select the optimal path. The simulation results show that the survival time of the network in the new BCDCP-M algorithm is 19% longer than BCDCP.