Skip to main content

Query Dissemination with Predictable Reachability and Energy Usage in Sensor Networks

  • Conference paper
Ad-hoc, Mobile and Wireless Networks (ADHOC-NOW 2008)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 5198))

Included in the following conference series:

Abstract

Energy-efficient query dissemination plays an important role for the lifetime of sensor networks. In this work, we consider probabilistic flooding for query dissemination and develop an analytical framework which enables the base station to predict the energy consumed and the nodes reached according to the rebroadcast probability. Furthermore, we devise a topology discovery protocol that collects the structural information required for the framework. Our analysis shows that the energy savings exceed the energy spent to obtain the required information after a small number of query disseminations in realistic settings. We verified our results both with simulations and experiments using the SUN Spot nodes.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Intel berkeley research lab data, http://db.csail.mit.edu/labdata/labdata.html

  2. SUN Microsystems Inc., Small Programmable Object Technology (SPOT)

    Google Scholar 

  3. Xbow technology inc. wireless sensor networks

    Google Scholar 

  4. Chang, E.J.H.: Echo algorithms: Depth parallel operations on general graphs. IEEE Transactions on Software Engineering 8(4), 391–401 (1982)

    Article  Google Scholar 

  5. Eugster, P.T., Guerraoui, R., Kermarrec, A.-M., Massoulieacute, L.: Epidemic information dissemination in distributed systems. Computer 37(5), 60–67 (2004)

    Article  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness (1990)

    Google Scholar 

  7. Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D.E., Pister, K.S.J.: System architecture directions for networked sensors. In: Proc. 9th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (2000)

    Google Scholar 

  8. Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed diffusion for wireless sensor networking. IEEE/ACM Trans. Netw. (2003)

    Google Scholar 

  9. Kellner, S., Pink, M., Meier, D., Blaß, E.-O.: Towards a realistic energy model for wireless sensor networks. In: WONS 2008 (to appear) (January 2008)

    Google Scholar 

  10. Lim, H., Kim, C.: Multicast tree construction and flooding in wireless ad hoc networks. In: MSWIM 2000: Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems (2000)

    Google Scholar 

  11. Madden, S., Franklin, M., Hellerstein, J., Hong, W.: Tag: a tiny aggregation service for ad-hoc sensor networks. In: SIGOPS (2002)

    Google Scholar 

  12. Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: Tinydb: an acquisitional query processing system for sensor networks. In: ACM TODS (2005)

    Google Scholar 

  13. Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., Sheu, J.-P.: The broadcast storm problem in a mobile ad hoc network. In: MobiCom 1999: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking (1999)

    Google Scholar 

  14. Obraczka, K., Viswanath, K., Tsudik, G.: Flooding for reliable multicast in multi-hop ad hoc networks (2001)

    Google Scholar 

  15. Peng, W., Lu, X.-C.: On the reduction of broadcast redundancy in mobile ad hoc networks. In: MobiHoc 2000: Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing (2000)

    Google Scholar 

  16. Qayyum, A., Viennot, L., Laouiti, A.: Multipoint relaying for flooding broadcast messages in mobile wireless networks. In: HICSS 2002: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS 2002), vol. 9 (2002)

    Google Scholar 

  17. Williams, B., Camp, T.: Comparison of broadcasting techniques for mobile ad hoc networks. In: Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC) (2002)

    Google Scholar 

  18. Yao, Y., Gehrke, J.: The cougar approach to in-network query processing in sensor networks. In: SIGMOD Rec. (2002)

    Google Scholar 

  19. Yao, Y., Gehrke, J.: Query processing in sensor networks. 2003. In: CIDR 2003: Proceedings of the First Biennial Conference on Innovative Data Systems Research (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benenson, Z., Bestehorn, M., Buchmann, E., Freiling, F.C., Jawurek, M. (2008). Query Dissemination with Predictable Reachability and Energy Usage in Sensor Networks. In: Coudert, D., Simplot-Ryl, D., Stojmenovic, I. (eds) Ad-hoc, Mobile and Wireless Networks. ADHOC-NOW 2008. Lecture Notes in Computer Science, vol 5198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85209-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85209-4_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85208-7

  • Online ISBN: 978-3-540-85209-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics