Efficient data dissemination and aggregation in large wireless sensor networks

In this paper, we investigate an energy-efficient data dissemination scheme that prolongs the lifetime of battery-powered sensors by reducing the amount of communication required. In order to save energy and bandwidth, the proposed scheme constructs and maintains only one grid structure per data type, and sources of same data type share the grid structure to disseminate sensing data. Another novel idea in the proposed scheme is to use a hash function in order to retrieves the position of the nearest grid point. By using a hashing function, a sink can substitute expensive local query flooding with unicasting. Our simulation results show that the proposed scheme consumes much less energy than previously known schemes by sharing grid structures and eliminating local flooding.