Simultaneous aggregate sum retrieval from multiple regions in sensor networks by distributed data cubes Online publication date: Fri, 07-May-2010
by L.H. Lee, M.H. Wong
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 4, No. 2, 2010
Abstract: Several data aggregation algorithms aiming at the retrieval of data aggregates from a single set of sensors in a sensor network have been proposed. However, when data aggregates of several sets of sensors are needed, the only solution these techniques provide is to build multiple distributed data structures or gossip groups in the sensor network. Hence in a sensor network containing N sensors, we may need 2N distributed data structures or gossip groups in order to retrieve the aggregates from all possible sets of sensors. In this paper, we propose to build distributed data cubes for the fast retrieval of aggregate sums from multiple regions in a sensor network, such that only one distributed data structure is needed. The distributed data cube construction algorithms we propose are based on the inclusion-exclusion principle, and they are capable of building distributed Prefix Sum (PS) and Local Prefix Sum (LPS) data cubes in sensor networks.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook