The Inter-cluster Routing Algorithm of Clustering Data Collection Protocol in WSNs

Abstract

In wireless sensor networks, clustering is considered as an effective energy-saving routing technology. In this paper, we proposed an inter-cluster routing schedule for data collection to solve inter-cluster communication problems: make sure the dominating set C produced by clustering algorithm meets the connectivity and constructs a routing pool tree, which can be got by using jump to jump transmission. For the cluster heads, we use tree¿s parent method for data structure, that is, we proposed an inter-cluster routing pool tree based on reversed spread way, and proved that as long as the cluster head¿s wireless communications radius is three times to the original one, it will be able to guarantee connectivity between cluster heads.