An Energy-Efficient Clustering Routing for Wireless Sensor Networks Based on Energy Consumption Optimization

Abstract

In order to alleviate energy consumption of wireless sensor networks (WSNs), energy consumption optimization-based clustering routing (ECOR) is proposed in this paper. In ECOR, network is gridding by hexagon. And there is only a cluster head (CH) in each hexagon, which makes the distribution of CHs more even. Residual energy of nodes and distance from the centroid of hexagon are used to elect CHs. For any a CH, dynamic time slot allocation strategy is adopted to allocate time slot for its cluster members. According to status of cluster members, the duration of time slot is dynamically adjusted. In intercluster communication, the Dijkstra algorithm is used to construct the shortest path between CHs in order to shorten the distance of transmitting data. Simulation results show that the ECOR algorithm outperforms the improved-Low Energy Adaptive Clustering Hierarchy (I-LEACH) algorithm in terms of distribution of CHs and energy consumption.