Distributed navigation algorithms for sensor networks

Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri

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

75 Citations (Scopus)

Abstract

We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations and we use this information to find a safe path for the user through the sensor field. Traditional distributed navigation algorithms rely upon flooding the whole network with packets to find an optimal safe path. To reduce the communication expense, we introduce the concept of a skeleton graph which is a sparse subset of the true sensor network communication graph. Using skeleton graphs we show that it is possible to find approximate safe paths with much lower communication cost. We give tight theoretical guarantees on the quality of our approximation and by simulation, show the effectiveness of our algorithms in realistic sensor network situations.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
DOIs
Publication statusPublished - 1 Dec 2006
Externally publishedYes
EventINFOCOM 2006: 25th IEEE International Conference on Computer Communications - Barcelona, Spain
Duration: 23 Apr 200629 Apr 2006

Other

OtherINFOCOM 2006: 25th IEEE International Conference on Computer Communications
CountrySpain
CityBarcelona
Period23/4/0629/4/06

Fingerprint

Sensor networks
Navigation
Communication
Sensors
Information use
Parallel algorithms
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Buragohain, C., Agrawal, D., & Suri, S. (2006). Distributed navigation algorithms for sensor networks. In Proceedings - IEEE INFOCOM [4146844] https://doi.org/10.1109/INFOCOM.2006.191

Distributed navigation algorithms for sensor networks. / Buragohain, Chiranjeeb; Agrawal, Divyakant; Suri, Subhash.

Proceedings - IEEE INFOCOM. 2006. 4146844.

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

Buragohain, C, Agrawal, D & Suri, S 2006, Distributed navigation algorithms for sensor networks. in Proceedings - IEEE INFOCOM., 4146844, INFOCOM 2006: 25th IEEE International Conference on Computer Communications, Barcelona, Spain, 23/4/06. https://doi.org/10.1109/INFOCOM.2006.191
Buragohain C, Agrawal D, Suri S. Distributed navigation algorithms for sensor networks. In Proceedings - IEEE INFOCOM. 2006. 4146844 https://doi.org/10.1109/INFOCOM.2006.191
Buragohain, Chiranjeeb ; Agrawal, Divyakant ; Suri, Subhash. / Distributed navigation algorithms for sensor networks. Proceedings - IEEE INFOCOM. 2006.
@inproceedings{4dc4c500b408482689409a6e93592937,
title = "Distributed navigation algorithms for sensor networks",
abstract = "We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations and we use this information to find a safe path for the user through the sensor field. Traditional distributed navigation algorithms rely upon flooding the whole network with packets to find an optimal safe path. To reduce the communication expense, we introduce the concept of a skeleton graph which is a sparse subset of the true sensor network communication graph. Using skeleton graphs we show that it is possible to find approximate safe paths with much lower communication cost. We give tight theoretical guarantees on the quality of our approximation and by simulation, show the effectiveness of our algorithms in realistic sensor network situations.",
author = "Chiranjeeb Buragohain and Divyakant Agrawal and Subhash Suri",
year = "2006",
month = "12",
day = "1",
doi = "10.1109/INFOCOM.2006.191",
language = "English",
isbn = "1424402212",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Distributed navigation algorithms for sensor networks

AU - Buragohain, Chiranjeeb

AU - Agrawal, Divyakant

AU - Suri, Subhash

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations and we use this information to find a safe path for the user through the sensor field. Traditional distributed navigation algorithms rely upon flooding the whole network with packets to find an optimal safe path. To reduce the communication expense, we introduce the concept of a skeleton graph which is a sparse subset of the true sensor network communication graph. Using skeleton graphs we show that it is possible to find approximate safe paths with much lower communication cost. We give tight theoretical guarantees on the quality of our approximation and by simulation, show the effectiveness of our algorithms in realistic sensor network situations.

AB - We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations and we use this information to find a safe path for the user through the sensor field. Traditional distributed navigation algorithms rely upon flooding the whole network with packets to find an optimal safe path. To reduce the communication expense, we introduce the concept of a skeleton graph which is a sparse subset of the true sensor network communication graph. Using skeleton graphs we show that it is possible to find approximate safe paths with much lower communication cost. We give tight theoretical guarantees on the quality of our approximation and by simulation, show the effectiveness of our algorithms in realistic sensor network situations.

UR - http://www.scopus.com/inward/record.url?scp=34848819591&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34848819591&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2006.191

DO - 10.1109/INFOCOM.2006.191

M3 - Conference contribution

SN - 1424402212

SN - 9781424402212

BT - Proceedings - IEEE INFOCOM

ER -