Abstract

Wireless Sensor Networks (WSNs) consist of a large number of low-power nodes sensing data from the environment. The sensor nodes are equipped with small and often irreplaceable batteries with limited power capacity. One of the areas of sensor networking that has attracted a lot of attention recently is the prolonging of the life span of sensor networks by exploiting energy-efficient routing schemes. We propose a novel energy-efficient centralised clustering algorithm for WSN. The proposed algorithm generates a set of possible clustering alternatives from which it selects the optimal clustering. We also present a performance evaluation of the proposed algorithm using two performance metrics Max-min and Max-sum. We found that Max-sum yields superior performance. In addition, our proposed algorithm improves the system lifetime performance over Low Energy Adaptive Clustering Hierarchy-C by almost 15%. We also compare performance results obtained with the chosen metric (Max-sum) with those obtained using other strategies (such as random and configuration 0). The Max-sum metric outperforms the random and configuration 0 strategies by almost 8.5 and 11%;, respectively, for system lifetime. Moreover, we found that the total amount of data collected using the Max-sum metric is at least 9% higher than with random and configuration 0 strategies.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call