Analysis of gradient-based routing protocols in sensor networks

  • Authors:

  • Jabed Faruque;Konstantinos Psounis;Ahmed Helmy

  • Affiliations:

  • Department of Electrical Engineering, University of Southern California, Los Angeles, CA;Department of Electrical Engineering, University of Southern California, Los Angeles, CA;Department of Electrical Engineering, University of Southern California, Los Angeles, CA

  • Venue:
  • DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Every physical event results in a natural information gradient in the proximity of the phenomenon. Moreover, many physical phenomena follow the diffusion laws. This natural information gradient can be used to design efficient information-driven routing protocols for sensor networks. Information-driven routing protocols based on the natural information gradient, may be categorized into two major approaches: (i) the single-path approach and (ii) the multiple-path approach. In this paper, using a regular grid topology, we develop analytical models for the query success rate and the overhead of both approaches for ideal and lossy wireless link conditions. We validate our analytical models using simulations. Also, both the analytical and the simulation models are used to characterize each approach in terms of overhead, query success rate and increase in path length.