Hausdorff Clustering and Minimum Energy Routing for Wireless Sensor Networks

We present a new method for data gathering that maximizes lifetime for wireless sensor networks. It involves three parts. First, nodes organize themselves into several static clusters by the Hausdorff clustering algorithm based on location, communication efficiency and network connectivity. Second, clusters are formed only once but the role of cluster-head is optimally scheduled among the cluster members. We formulate the cluster-head scheduling that maximizes the network lifetime as an integer programming problem and propose a greedy algorithm for its solution. Third, after cluster-heads are selected, they form a backbone network to periodically collect, aggregate, and forward data to the base station, where a minimum energy (cost) routing is used. Comparing with other known methods, significant lifetime extension is obtained with the use of this method.