ABSTRACT
Recently, several aggregation methods have been proposed to save energy by reducing the number of transmissions from source to the sink. They assumed a single sink for aggregation of data. In this paper, we propose the way to find an aggregation point for wireless sensor networks with multiple sinks and multiple sources. It is very difficult to find an optimal aggregation point to conserve the node energy in real networks. In our scheme, each node caches the gradient information collected from its local neighbors to determine the aggregation point for merging data to be delivered to multiple sinks. Another word, we find a cross point on the multiple paths. The experimental results show that our scheme can reduce the number of transmissions and thus save the energy than other Greedy Incremental Tree and the shortest path schemes.
