One of the most pressing issues in wireless sensor networks (WSNs) is energy efficiency. Sensor nodes (SNs) are used by WSNs to gather and send data. The techniques cluster-based hierarchical routing significantly considered for lowering WSN’s consumption. Because SNs battery-powered, face significant constraints, problems an energy-efficient protocol designing. Clustering algorithms drasticall...

The Minimum Dominating Set (MDS) problem is to find a minimum such S for a given network graph. It is the fundamental math problem underlying routing: construct “cluster heads” in the network graph so you can rapidly, hierarchically, send messages from one cluster to another, and the cluster heads will oversee routing within and through the individual cluster. Of course, the members of S are th...

Most of the clustering algorithms utilize two techniques which are selecting cluster-heads with more residual energy and rotating cluster-heads periodically to balance energy consumption of the sensor nodes over the network . These clustering algorithms do not take the location of the base station into consideration. This lack of consideration causes the hot spots problem in multi-hop wireless ...

Increased network lifetime is a desired property of low-powered and energy-constrained Internet Things (IoT) devices that are deployed in wireless environments. Clustering used as technique multiple solutions to improve overall lifetime. Further variants the clustering process defined optimize results. One such variant equal clustering, where all clusters have same size. However, this approach ...

Environmental monitoring is one of the most important applications of wireless sensor networks (WSNs), which usually requires a lifetime of several months, or even years. However, the inherent restriction of energy carriedwithin the battery of sensor nodes brings an extreme difficulty to obtain a satisfactory network lifetime, which becomes a bottleneck in scale of such applications in WSNs. In...

As a classic clustering algorithm, LEACH is widely used in wireless sensor networks. Due to the random cluster head selection process, LEACH does not guarantee optimization for the number and position of cluster heads. In order to further optimize LEACH, an optimal energyefficient cluster-heads selection algorithm LEACH-G for LEACH protocol is presented. We calculate the optimal number of clust...

Wireless sensor networks (WSNs) comprise several cooperating nodes capable of sensing, computing, and transmitting sensed signals to a central server. This research proposes system-based network with low power communication using swarm intelligence integrated multi-hop (SIMHC). routing protocol selects the optimal route based on link distance, transmission power, residual energy optimize lifeti...

Minimizing energy consumption to maximize network lifetime is one of the crucial concerns in designing wireless sensor network routing protocols. Cluster-based protocols have shown promising energy-efficiency performance, where sensor nodes take turns to act as cluster heads (CHs), which carry out higher-level data routing and relaying. In such case the energy consumption is more evenly distrib...

Abstract—Wide research has been carried out in this Wireless Sensor Networks to improve the lifetime of the sensor nodes in order to enhance the performance of the network. Clustering h reduces the energy consumption of each node, but it increases the communication burden of the cluster heads. In the proposed intra-cluster and inter-cluster traffic are used to reduce the load of the cluster hea...

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 the energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor network. In this ...