Optimization of Contact Search Policy in Wireless Mobile Ad Hoc Networks


Contact-based is an attractive choice for resource discovery in wireless sensor networks because of energy efficient and scalable characteristics. Contact-based resource discovery combine proactive and reactive schemes in an attempt to establish a reasonable overhead balance. In this architecture, the requests are forwarded to only a small number of selected nodes out of the zone, called contact. The requests are forwarded out of the zone randomly. In this paper, I propose a new search policy, called Caching Search Policy (CSP), which can forwarded targeted. In this policy, each border node has a cache to store previous contact searches. I studied the rate of energy consumption and efficiency on the new policy. My simulation and modeling results on different network parameters shows that the CSP is more effective than random policy.

  • Abstract
  • Key Words
  • 1. Introduction
  • 2. Caching Model Resource Discovery
  • 3. Contact-Based Resource Discovery
  • 4. Random Search Policy(RSP)
  • 5. Caching Search Policy(CSP)
  • 6. Simulation and Analysis
  • 7. Summaries
  • References

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In