Data-centric routing in sensor networks using biased walk

Huilong Huang, John H. Hartman, Terril N. Hurst

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations

Abstract

We present Spiral, a data-centric routing algorithm for short-term communication in unstructured sensor networks. Conventional data-centric routing algorithms are based on flooding or random walk. Flooding returns the shortest route but has a high search cost; random walk has a lower search cost but returns a sub-optimal route. Spiral offers a compromise between these two extremes -it has a lower search cost than flooding and returns better routes than random walk. Spiral is a biased walk that visits nodes near the source before more distant nodes. This results in a spiral-like search path that is not only more likely to And a closer copy of the desired data than random walk, but is also able to compute a shorter route because the network around the source is more thoroughly explored. Our experiments show that in a 500-node network with an average degree of 20 and two copies of every data object, for a short-term communication of 40 packets the total communication cost by Spiral is only 72% of that by flooding, 81% of ERS, 74% of random walk, and 73% of DFS.

Original languageEnglish (US)
Title of host publication2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1-9
Number of pages9
ISBN (Print)1424406269, 9781424406265
DOIs
StatePublished - Jan 1 2006
Event2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006 - Reston, VA, United States
Duration: Sep 25 2006Sep 28 2006

Publication series

Name2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006
Volume1

Other

Other2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006
CountryUnited States
CityReston, VA
Period9/25/069/28/06

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Huang, H., Hartman, J. H., & Hurst, T. N. (2006). Data-centric routing in sensor networks using biased walk. In 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006 (pp. 1-9). [4068102] (2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006; Vol. 1). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SAHCN.2006.288403