MISTER: An approximate minimum steiner tree based routing scheme in wireless sensor networks

Abstract

In this paper, we propose the MISTER (approximate Minimum Steiner TreE based Routing) scheme which can construct the routing paths among sinks in multi-sink wireless sensor networks or cluster heads in clustered wireless sensor networks. By extracting a hierarchically well-separated tree based on the proposed scheme, we can build a bounded approximate minimum Steiner tree among multiple sinks or cluster heads. The experiments show that the MISTER scheme can reduce the average hop counts among multiple sinks or cluster heads. Therefore, we can save the energy of wireless sensor nodes and prolong the lifetime of wireless sensor networks.