Skip to main content

IDEA: An Iterative-Deepening Algorithm for Energy-Efficient Querying in Ad Hoc Sensor Networks

  • Conference paper
Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2865))

Included in the following conference series:

  • 570 Accesses

Abstract

The data-centric ad hoc sensor networks make efficient searching a crucial and challenging operation. Dynamic topology make flooding the most widely adopted solution at a cost of high bandwidth congestion leading to inefficient use of resources and low network lifetime. This paper presents IDEA, an efficient querying and searching technique for ad hoc sensor networks that reduces average energy consumption while maintaining the capacity and performance of the network. IDEA is based on iterative-deepening search which check-points the flooding of requests based on the results. This is further extended to a token-based approach called T-IDEA, which involves local decisions made by nodes to determine their participation in a virtual searching network. Results show that IDEA and T-IDEA significantly reduces the energy consumption compared to classical flooding approaches. Apart from that T-IDEA presents a highly distributed self-supervising topology formation which performs very well to increase the lifetime of the ad hoc sensor network.

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. Perkins, C., Royer, E., Das, S.: Ad hoc on demand distance vector (AODV) routing (1999), http://www.ietf.org/internet-drafts/draft-ieftmanet-aodv-03.txt

  2. Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Johnson, D.B., Maltz, D.A. (eds.) Mobile Computing, pp. 153–181. Academic Publishers, New York (1996)

    Chapter  Google Scholar 

  3. Lee, S.-J., Su, W., Gerla, M.: On-Demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks. Internet Draft, draftietf-manet-odmrp-02.txt (January 2000)

    Google Scholar 

  4. Stojmenovic, I., Seddigh, M., Zunic, J.: Internal node based broadcasting algorithms in wireless networks. In: Proceedings of the HawaiiInt. Conf. on System Sciences (January 2001)

    Google Scholar 

  5. Chen, B., Jamieson, K.H., Morris, R.: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks. Mobicom (2001)

    Google Scholar 

  6. Lin, C.R., Gerla, M.: Adaptive Clustering for Mobile Wireless Networks. IEEE Journal on Selected Areas in Communications 15(7), 1265–1275 (1997)

    Article  Google Scholar 

  7. Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems 12(12) (December 2001)

    Google Scholar 

  8. Peng, W., Lu, X.C.: On the reduction of broadcast redundancy in mobile ad hoc networks. In: Proceedings of the Annual Workshop on Mobile and Ad Hoc Networking and Computing (MobiHOC 2000), Boston, Massachusetts, USA, August 2000, pp. 129–130 (2000)

    Google Scholar 

  9. Wu, J., Li, H.: A dominating-set-based routing scheme in ad hoc wireless networks. In: Proceedings of the Third Int’l Workshop Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pp. 7-14 (August 1999)

    Google Scholar 

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

    Google Scholar 

  11. Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., Sheu, J.-P.: The broadcast storm problem in a mobile ad hoc network. In: Proceedings of the MobiCom 1999, Seattle WA (August 1999)

    Google Scholar 

  12. Gerla, M., Tasi, J.: A Multi-cluster, mobile, multimedia radio network. ACMBaltzer Journal of Wireless Networks 1(3) (1995)

    Google Scholar 

  13. Krishna, P., Vaidya, N.H., Chatterjee, M., Pradhan, D.K.: A cluster-based approach for routing in dynamic networks. Computer Communication Review 27(2). ACM (April1997)

    Google Scholar 

  14. Russel, S., Norvig, P.: Artificial Intelligence: A Modern Approach. Prentice-Hall, Englewood Cliffs (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Patil, S. (2003). IDEA: An Iterative-Deepening Algorithm for Energy-Efficient Querying in Ad Hoc Sensor Networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2003. Lecture Notes in Computer Science, vol 2865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39611-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39611-6_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20260-8

  • Online ISBN: 978-3-540-39611-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics