Wireless sensor networks (WSNs) are one of the most promising technologies and have immense potential in both the military and civil field. WSNs offer a range of challenges for scientists and engineers of today. The biggest challenge among all is the energy constraint of these networks. In this context, various schemes have been presented in order to improve the life time of these networks and to overcome the energy constraint. One of the effective schemes is based on clustering of sensor nodes within a network in order to improve the network life time and decrease communication latency. Clustering algorithms are believed to be the best for wireless sensor networks because they work on the principle of divide and conquer. This paper includes a brief survey of various existing clustering algorithms and present a new clustering algorithm based on nondetermistic finite automata which further divides the communication between cluster heads into multihop by using a few nodes from each cluster. Performance studies indicate that the proposed algorithm is more efficient in terms of energy consumption and network connectivity.
|Number of pages||18|
|Journal||International Journal of Distributed Sensor Networks|
|Publication status||Published - 1 Apr 2008|