Anotace:
Energy is seen as a significant factor in wireless sensor networks (WSNs). It is a challenge to balance between battery lifetime of the different sensors and network lifetime. The main contribution of the proposed approach is to decrease the energy consumption of each sensor node, overcome unbalanced energy usage among sensor nodes, reduce the data gathering time and enhance the network lifetime. To achieve these goals, we combine the Hierarchical Agglomerative algorithm and an optimal path selection method. First, the suitable cluster heads (CHs) are elected based on the Euclidean distance and the residual energy of each sensor node. Then, the base station is situated at the center of the field, which will be partitioned into equal subareas, one for every mobile data collector (MDC). Second, the Kruskal algorithm is used to create an optimal data gathering path from each subset of elected cluster heads. Finally, each mobile data collector travels the optimal path to collect the data from the set of cluster heads of each subarea and returns periodically to the base station to upload gathered data. Computer simulation proves that the proposed approach outperforms existing ones in terms of data gathering time, residual energy and network lifetime