Abstract
In this article we propose a lightweight algorithm for constructing multiresolution data representations for sensor networks. At each sensor node u, we compute O(log n) aggregates about exponentially enlarging neighborhoods centered at u. The ith aggregate is the aggregated data from nodes approximately within 2i hops of u. We present a scheme, named the hierarchical spatial gossip algorithm, to extract and construct these aggregates, for all sensors simultaneously, with a total communication cost of O(n polylog n). The hierarchical gossip algorithm adopts atomic communication steps with each node choosing to exchange information with a node distance d away with probability ∼ 1/d3. The attractiveness of the algorithm can be attributed to its simplicity, low communication cost, distributed nature, and robustness to node failures and link failures. We show in addition that computing multiresolution aggregates precisely (i.e., each aggregate uses all and only the nodes within 2i hops) requires a communication cost of Ω(n√n), which does not scale well with network size. An approximate range in aggregate computation like that introduced by the gossip mechanism is therefore necessary in a scalable efficient algorithm. Besides the natural applications of multiresolution data summaries in data validation and information mining, we also demonstrate the application of the precomputed multiresolution data summaries in answering range queries efficiently.
- Aysal, T. C., Yildiz, M. E., Sarwate, A. D., and Scaglione, A. 2009. Broadcast gossip algorithms for consensus. Trans. Signal Process. 57, 7, 2748--2761. Google ScholarDigital Library
- Bash, B. A. and Desnoyers, P. J. 2007. Exact distributed Voronoi cell computation in sensor networks. In Proceedings of the 6th International Conference on Information Processing in Sensor Networks. ACM Press, New York, NY, 236--243. Google ScholarDigital Library
- Boyd, S., Ghosh, A., Prabhakar, B., and Shah, D. 2006. Randomized gossip algorithms. IEEE Trans. Inform. Theor. (Special issue of IEEE Trans. Inform. Theor. and IEEE/ACM Trans. Netw.) 52, 6, 2508--2530. Google ScholarDigital Library
- Cohen, E. 1997. Size-estimation framework with applications to transitive closure and reachability. J. Comp. Syst. Sci. 55, 3, 441--453. Google ScholarDigital Library
- Considine, J., Li, F., Kollios, G., and Byers, J. 2004. Approximate aggregation techniques for sensor databases. In Proceedings of the 20th International Conference on Data Engineering. 449--460. Google ScholarDigital Library
- Dimakis, A. G., Sarwate, A. D., and Wainwright, M. J. 2006. Geographic gossip: Efficient aggregation for sensor networks. In Proceedings of the 5th International Conference on Information Processing in Sensor Networks. ACM Press, New York, NY, 69--76. Google ScholarDigital Library
- Fagnani, F. and Zampieri, S. 2008. Randomized consensus algorithms over large scale networks. IEEE J. Select. Areas Comm. 26, 4, 634--649. Google ScholarDigital Library
- Flajolet, P. and Martin, G. N. 1985. Probabilistic counting algorithms for data base applications. J. Comp. Syst. Sci. 31, 2, 182--209. Google ScholarDigital Library
- Ganesan, D., Estrin, D., and Heidemann, J. 2003a. Dimensions: why do we need a new data handling architecture for sensor networks? SIGCOMM Comp. Comm. Rev. 33, 1, 143--148. Google ScholarDigital Library
- Ganesan, D., Greenstein, B., Perelyubskiy, D., Estrin, D., and Heidemann, J. 2003b. An evaluation of multiresolution storage for sensor networks. In Proceedings of the 1st International Conference on Embedded Networked Sensor Systems. ACM Press, New York, NY, 89--102. Google ScholarDigital Library
- Ganesan, D., Greenstein, B., Perelyubskiy, D., Estrin, D., and Heidemann, J. 2005. Multi-resolution storage and search in sensor networks. ACM Trans. Stor. 1, 3, 277--315. Google ScholarDigital Library
- Gao, J., Guibas, L., Hershberger, J., and Zhang, L. 2004. Fractionally cascaded information in a sensor network. In Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks. 311--319. Google ScholarDigital Library
- Gao, J., Guibas, L., and Nguyen, A. 2006. Deformable spanners and their applications. Computat. Geom. Theor. Appl. 35, 1-2, 2--19. Google ScholarDigital Library
- Gao, J., Guibas, L., Hershberger, J., and Milosavljevic, N. 2007. Sparse data aggregation in sensor networks. In Proceedings of the 6th International Symposium on Information Processing in Sensor Networks. 430--439. Google ScholarDigital Library
- Greenstein, B., Estrin, D., Govindan, R., Ratnasamy, S., and Shenker, S. 2003. Difs: A distributed index for features in sensor networks. In Proceedings of the 1st IEEE. IEEE International Workshop. 163--173.Google Scholar
- Hedetniemi, S. M., Hedetniemi, S. T., and Liestman, A. 1988. A survey of gossiping and broadcasting in communication networks. Networks 18, 4, 319--349.Google ScholarCross Ref
- Kempe, D. and McSherry, F. 2004. A decentralized algorithm for spectral analysis. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY, 561--568. Google ScholarDigital Library
- Kempe, D., Kleinberg, J., and Demers, A. 2001. Spatial gossip and resource location protocols. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. ACM Press, New York, NY, 163--172. Google ScholarDigital Library
- Kempe, D., Dobra, A., and Gehrke, J. 2003. Gossip-based computation of aggregate information. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. 482--491. Google ScholarDigital Library
- Li, X., Kim, Y. J., Govindan, R., and Hong, W. 2003. Multi-dimensional range queries in sensor networks. In Proceedings of the 1st International Conference on Embedded Networked Sensor Systems. ACM Press, New York, NY, 63--75. Google ScholarDigital Library
- Madden, S., Franklin, M. J., Hellerstein, J. M., and Hong, W. 2002. TAG: A tiny aggregation service for ad-hoc sensor networks. SIGOPS Op. Syst. Rev. 36, SI, 131--146. Google ScholarDigital Library
- Moallemi, C. and Van Roy, B. 2006. Consensus propagation. IEEE Trans. Inform. Theor. 52, 11, 4753--4766. Google ScholarDigital Library
- Mosk-Aoyama, D. and Shah, D. 2006. Computing separable functions via gossip. In Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing. ACM Press, New York, NY, 113--122. Google ScholarDigital Library
- Nath, S., Gibbons, P. B., Seshan, S., and Anderson, Z. R. 2004. Synopsis diffusion for robust aggregation in sensor networks. In Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems. 250--262. Google ScholarDigital Library
- Rabbat, M., Haupt, J., Singh, A., and Nowak, R. 2006. Decentralized compression and predistribution via randomized gossiping. In Proceedings of the 5th International Conference on Information Processing in Sensor Networks. ACM Press, New York, NY, 51--59. Google ScholarDigital Library
- Shah, D. 2008. Gossip Algorithms. Foundations and Trends in Networking. Now Publishers, Delft, The Netherlands.Google Scholar
- Shrivastava, N., Buragohain, C., Agrawal, D., and Suri, S. 2004. Medians and beyond: New aggregation techniques for sensor networks. In Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems. ACM Press, New York, NY, 239--249. Google ScholarDigital Library
- Wang, W. and Ramchandran, K. 2006. Random distributed multiresolution representations with significance querying. In Proceedings of the 5th International Conference on Information Processing in Sensor Networks. ACM Press, New York, NY, 102--108. Google ScholarDigital Library
- Xiao, L. and Boyd, S. 2004. Fast linear iterations for distributed averaging. Syst. Contr. Lett. 53, 65--78.Google ScholarCross Ref
- Xiao, L., Boyd, S., and Lall, S. 2005. A scheme for robust distributed sensor fusion based on average consensus. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks. 63--70. Google ScholarDigital Library
- Xiao, L., Boyd, S., and Lall, S. 2006. A space-time diffusion scheme for peer-to-peer least-squares estimation. In Proceedings of the 5th International Symposium on Information Processing in Sensor Networks. 168--176. Google ScholarDigital Library
Index Terms
- Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks
Recommendations
Hierarchical spatial gossip for multi-resolution representations in sensor networks
IPSN '07: Proceedings of the 6th international conference on Information processing in sensor networksIn this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates about exponentially enlarging neighborhoods centered at u. The ith ...
Gossip-based scalable directed diffusion for wireless sensor networks
Directed diffusion (DD) is a promising data-centric routing scheme for wireless sensor networks (WSNs). But the heavy flooding overhead involved in interest propagation causes scalability issues when DD is applied in large scale, interactive and ...
Randomized gossip algorithms
Special issue on networking and information theoryMotivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip algorithms, for exchanging information and for computing in an arbitrarily connected network of nodes. The topology of such ...
Comments