Distributed algorithms for guiding navigation across a sensor network
Proceedings of the 9th annual international conference on Mobile computing and networking
Distributed Path Planning for Robots in Dynamic Environments Using a Pervasive Embedded Network
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Navigation protocols in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Graph Theory: Modeling, Applications, and Algorithms
Graph Theory: Modeling, Applications, and Algorithms
Emergency guiding and monitoring applications in indoor 3D environments by wireless sensor networks
International Journal of Sensor Networks
Selection and navigation of mobile sensor nodes using a sensor network
Pervasive and Mobile Computing
Roadmap query for sensor network assisted navigation in dynamic environments
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
A SURVEY OF VOID HANDLING TECHNIQUES FOR GEOGRAPHIC ROUTING IN WIRELESS NETWORKS
IEEE Communications Surveys & Tutorials
Large scale simulation for human evacuation and rescue
Computers & Mathematics with Applications
| Hi-index | 0.00 |
Wireless sensor networks can be employed to provide distributed real-time navigation instructions to users attempting to travel in hazardous environments. In this work, we propose a distributed path planning algorithm for sensor network navigation in dynamic hazardous environments. Using geographic or virtual coordinates of sensors and based on a partial reversal method for directed acyclic graphs (DAG), our algorithm constructs a distributed in-network directed navigation graph, where each source sensor is guaranteed to have at least one desired directed path to one destination sensor. When the hazardous environment changes due to its dynamic nature, path replanning does not need to reconfigure most of the directed links in the graph unaffected by the changes. Correctness of our algorithm is proved and extensive simulation results demonstrate that the constructed navigation graph provides near-optimal navigation paths for users, successfully adapts to dynamic hazardous environments, and requires very low communication overhead for maintenance, when compared to other navigation graphs constructed by existing algorithms that use frequent or periodic flooding. Copyright © 2010 John Wiley & Sons, Ltd.