Distributed Navigation Algorithms for Sensor Networks

Simple item page
dc.creatorBuragohain, Chiranjeeb
dc.creatorAgrawal, Divyakant
dc.creatorSuri, Subhash
dc.date2005-12-14
dc.date.accessioned2026-07-07T06:53:50Z
dc.date.available2026-07-07T06:53:50Z
dc.descriptionWe 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.
dc.descriptionTo Appear in INFOCOM 2006
dc.identifierhttps://arxiv.org/abs/cs/0512060
dc.identifierhttp://arxiv.org/abs/cs/0512060
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/105733
dc.subjectNetworking and Internet Architecture
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectData Structures and Algorithms
dc.titleDistributed Navigation Algorithms for Sensor Networks
dc.typetext

Files

Collections

arXiv