Skip to main content

Scale Free Aggregation in Sensor Networks

  • Conference paper
Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2004)

Abstract

Sensor networks are distributed data collection systems, frequently used for monitoring environments in which “nearby” data has a high degree of correlation. This induces opportunities for data aggregation, that are crucial given the severe energy constraints of the sensors. Thus it is very desirable to take advantage of data correlations in order to avoid transmitting redundancy. In our model, we formalize a notion of correlation, that can vary according to a parameter k. We propose a very simple randomized algorithm for routing information on a grid of sensors in a way which promotes data aggregation. We prove that this simple scheme is a constant factor approximation (in expectation) to the optimum aggregation tree simultaneously for all correlation parameters k.

The key idea of our randomized analysis is to relate the expected collision time of random walks on the grid to scale free aggregation.

Research supported in part by NSF grants CCR-0126347, IIS-0118173, EIA-0137761, and ITR-0331640, NSF Career grants No. 0339262 and No. 0339262, and a SNRC grant.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bonnet, P., Gehrke, J., Seshadri, P.: Querying the Physical World. IEEE Personal Communications Special Issue on Networking the Physical World (October 2000)

    Google Scholar 

  2. Cristescu, R., Beferull-Lozano, B., Vetterli, M.: On Network Correlated DataGathering. In: IEEE Proceedings of INFOCOM, Hong Kong (2004)

    Google Scholar 

  3. Goel, A., Estrin, D.: Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk. In: Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 499–505 (2003)

    Google Scholar 

  4. Heidemann, J., Silva, F., Intanagonwiwat, C., Govindan, R., Estrin, D., Ganesan, D.: Building Efficient Wireless Sensor Networks with Low-Level Naming. In: Symposium on Operating Systems Principles (2001)

    Google Scholar 

  5. Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-Ecient Communication Protocol for Wireless Microsensor Networks. In: 33rd Hawaii International Conference on System Sciences, HICSS 2000 (2000)

    Google Scholar 

  6. Intanagonwiwat, C., Estrin, D., Govindan, R., Heidemann, J.: The Impact ofNetwork Density on Data Aggregation in Wireless Sensor Networks. In: ICDCS 2002 (2002)

    Google Scholar 

  7. Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J.S., Silva, F.: Directed diffusion for wireless sensor networking. IEEE/ACM Transactions on Networking 11(1), 2–16 (2003)

    Article  Google Scholar 

  8. Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for WirelessNetworks. Mobile Computing and Networking, MobiCom (2000)

    Google Scholar 

  9. Krishnamachari, B., Estrin, D., Wicker, S.B.: The Impact of Data Aggregation in Wireless Sensor Networks. In: ICDCS Workshop on Distributed Event-based Systems, DEBS (2002)

    Google Scholar 

  10. Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a TinyAGgregation Service for Ad-Hoc Sensor Networks. In: Fifth Annual Symposium on Operating Systems Design and Implementation, OSDI (2002)

    Google Scholar 

  11. Madden, S.R., Szewczyk, R., Franklin, M.J., Culler, D.: Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks. In: Fourth IEEE Workshop on Mobile Computing and Systems Applications (2002)

    Google Scholar 

  12. Pattem, S., Krishnmachari, B., Govindan, R.: The Impact of Spatial Correlation on Routing with Compression in Wireless Sensor Networks. In: Symposium on Information Processing in Sensor Networks, IPSN (2004)

    Google Scholar 

  13. Savvides, A., Han, C.C., Strivastava, M.B.: Dynamic Fine-Grained Localization. Ad-Hoc Networks of Sensors, MobiCom (2001)

    Google Scholar 

  14. Scaglione, A., Servetto, S.D.: On the Interdependence of Routing and Data Compression in Multi-Hop Sensor Networks. MobiCom (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Enachescu, M., Goel, A., Govindan, R., Motwani, R. (2004). Scale Free Aggregation in Sensor Networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2004. Lecture Notes in Computer Science, vol 3121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27820-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27820-7_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22476-1

  • Online ISBN: 978-3-540-27820-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics