A Spanning Tree based Data Collection for Real-Time Streaming Sensor Data

Wireless sensor networks are widely used for gathering data in the distributed fashion. Since the network consists of low-cost nodes of limited battery power, it is a challenging task to design an energy efficient routing scheme. In this paper we propose a novel clustering algorithm based on spanning tree of bounded degree in each cluster for energy efficient WSNs. The proposed scheme selects the cluster-head considering the residual energy of each node, and partitions each cluster for constructing efficient routing paths to the base station. Computer simulation shows that the proposed scheme effectively reduces and balances the energy consumption among the nodes, and thus significantly extends the network lifetime compared to the existing schemes such as LEACH, PEGASIS, and TREEPSI.