Topic-based data merging and routing scheme in many-to-many communication for WSNs

Abstract

This paper deals with an obvious application of the spanning tree in the many-to-many communication network design, with reflecting the optimum cost of data merging at a tuple-centroid node. Our scheme aims to achieve some degree of load balancing among the constituted tuple-nodes by defining the minimal number of tuples. Meanwhile, minimizing the number of nodes involved in data merging and forwarding towards the multiple sinks would be a fruitful mechanism to reduce the overall routing costs in the network. A mathematical evaluation shows that our method is competent to reduce the number of hops. Therefore, it is efficient in the energy minimization aspect on data routing and consequentially, fruitful to enhance the network lifetime. © 2014 Springer International Publishing.