Abstract:

According to the architecture and energy dissipation model of the LEACH protocol,the threshold of a node being a cluster-head is defined,which is dynamically determined by the index of forecasted energy dissipation and the ratio of residual energy.Then,a novel forecasted energy dissipation-based distributed clustering algorithm with a maximum iteration complexity of O（1）,named as FED,is proposed for the single-hop routing protocol.Moreover,the FED algorithms with three different priority strategies in terms of the time,the residual energy and the ratio of residual energy are compared via simulations.The results indicate that,as compared with the LEACH and the EECS algorithms,the FED algorithms with the priorities of energy and ratio greatly prolong the network lifetime and obviously improve the network energy utilization.

Key words: wireless sensor network, clustering, routing, network lifetime