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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
