International Journal of Computer Applications
In wireless sensor networks, potential sink selection and sink movements are costly in terms of node energy. In this paper, the authors propose k-partitioned minimum depth tree using the optimal search in placing optimal number of sinks in sensor networks for improving the network lifetime maximization. Initially, the optimal number of sinks is determined using the optimal sink algorithm satisfying the h-hop constraint. Then a k-Partitioned Minimum Depth Tree (k-PMDT) is constructed for positioning multiple sink nodes and setting up the routes.