Energy-efficient Clustering Routing Algorithm Research Articles

A Clustering Routing Algorithm Based on Improved Ant Colony Optimization Algorithms for Underwater Wireless Sensor Networks

Because of the complicated underwater environment, the efficiency of data transmission from underwater sensor nodes to a sink node (SN) is faced with great challenges. Aiming at the problem of energy consumption in underwater wireless sensor networks (UWSNs), this paper proposes an energy-efficient clustering routing algorithm based on an improved ant colony optimization (ACO) algorithm. In clustering routing algorithms, the network is divided into many clusters, and each cluster consists of one cluster head node (CHN) and several cluster member nodes (CMNs). This paper optimizes the CHN selection based on the residual energy of nodes and the distance factor. The selected CHN gathers data sent by the CMNs and transmits them to the sink node by multiple hops. Optimal multi-hop paths from the CHNs to the SN are found by an improved ACO algorithm. This paper presents the ACO algorithm through the improvement of the heuristic information, the evaporation parameter for the pheromone update mechanism, and the ant searching scope. Simulation results indicate the high effectiveness and efficiency of the proposed algorithm in reducing the energy consumption, prolonging the network lifetime, and decreasing the packet loss ratio.

An Energy-Efficient Clustering Routing Algorithm Based on Geographic Position and Residual Energy for Wireless Sensor Network

Recently wireless sensor network (WSN) has become one of the most interesting networking technologies, since it can be deployed without communication infrastructures. A sensor network is composed of a large number of sensor nodes; these nodes are responsible for supervision of the physical phenomenon and transmission of the periodical results to the base station. Therefore, improving the energy efficiency and maximizing the networking lifetime are the major challenges in this kind of networks. To deal with this, a hierarchical clustering scheme, called Location-Energy Spectral Cluster Algorithm (LESCA), is proposed in this paper. LESCA determines automatically the number of clusters in a network. It is based on spectral classification and considers both the residual energy and some properties of nodes. In fact, our approach uses theK-ways algorithm and proposes new features of the network nodes such as average energy, distance to BS, and distance to clusters centers in order to determine the clusters and to elect the cluster's heads of a WSN. The simulation results show that if the clusters are not constructed in an optimal way and/or the number of the clusters is greater or less than the optimal number of clusters, the total consumed energy of the sensor network per round is increased exponentially.

Routing Algorithm with Energy-Efficient and High Quality of Clusters in Wireless Sensor Network

This paper proposes an energy-efficient clustering routing algorithm based on the node degree, relative distance between nodes and residual energy. Selecting the cluster head fully consider the node degree and their relative distance. By this way, the coverage performance of cluster head is better and the average distance between member nodes and cluster head is short, so the cost of communication in the cluster is decreased. At the same time, the nodes with low energy have less probability to become the cluster head. Therefore, it can improve the quality of cluster; prolong the life time of the network.

Energy Efficient Clustering Routing Algorithm in Wireless Sensor Networks

A wireless sensor node can only be equipped with a limited power source due to the several hardware constraints. Moreover, for most applications, replenishment of power resources is impossible. WSN lifetime, therefore, shows a strong dependence on battery lifetime. Thus the sources that consume energy during the operation of each node should be analyzed and maintained efficiently. In this paper, we propose a energy efficient clustering routing algorithm based on LEACH (EE_LEACH), which aims to balance energy consumption in WSN through modification of the threshold and multi-hop data transmission. Simulation results show that the algorithm can save node energy consumption effectively and prolong the network lifetime.

A Energy-Efficient Clustering Routing Algorithm Based on Distance and Residual Energy for Wireless Sensor Networks

Aiming at the problem of limited energy of sensors in Wireless Sensor Network, based on the classic clustering routing algorithm LEACH, a distance-energy cluster structure algorithm considering both the distance and residual energy of nodes is presented in the dissertation, which improves the process of cluster head election and the process of data transmission. It reduces the adverse effect on the energy consumption of the cluster head, resulting from the non-uniform distribution of nodes in network and avoids the direct communication between the base station and cluster head, which may has low energy and far away from base station The results of simulation indicate that the improved algorithm effectively balances the energy consumption, prolongs 31% of the lifetime, reduces 40% of the energy consumption and has a better performance than the original LEACH protocol.

An energy efficient clustering routing algorithm for wireless sensor networks

This article proposes an energy efficient clustering routing (EECR) algorithm for wireless sensor network. The algorithm can divide a sensor network into a few clusters and select a cluster head base on weight value that leads to more uniform energy dissipation evenly among all sensor nodes. Simulations and results show that the algorithm can save overall energy consumption and extend the lifetime of the wireless sensor network.