Applicability of Hop Distance in Random Sensor Networks

  • Authors:
  • Oscar J. Somsen;Raymundo R. Hordijk;Theo M. Hupkens

  • Affiliations:
  • Netherlands Defense Academy, Den Helder, The Netherlands 1780 CA;Netherlands Defense Academy, Den Helder, The Netherlands 1780 CA;Netherlands Defense Academy, Den Helder, The Netherlands 1780 CA

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Future sensor networks may be composed of a large number of low cost sensors, also known as "smart-dust". A simple measure for the distance between any two sensors is the number of re-broadcasts that is necessary to send a message between them. We wish to determine to what extent this so called hop distance provides a useful estimate of the geometric distance between the sensors and can thus be used to derive a map of the network. For the present paper we simulated a number of networks and determined hop distance distributions. We also considered heterogeneity of sensor density and hop range, which is to be expected when a network will be delivered on a featured terrain. Our results demonstrate that, with a proper calibration, hop distance can provide a reliable estimate for geometric distance, provided that the minimum (local) sensor density is sufficient and that hop range heterogeneities do not extend over large regions of the network.