Distributed Dynamic Navigation for Sensor Networks  

作　　者：Xiaoping Wu Shili Tan Tao Chen Xiaomei Yi Dan Dai 

机构地区：[1]Research Institute of Service Robot, Shanghai University, Shanghai 200444, China [2]Zhejiang Agriculture ＆ Forest University, Hangzhou 311300, China [3]National University of Defense Technology, Changsha 410073, China

出　　处：《Tsinghua Science and Technology》2011年第6期648-656,共9页清华大学学报（自然科学版（英文版）

基　　金：Supported by the National Key Basic Research and Development Program (973) of China (No. 2011CB302705);in part by the Zhejiang Agriculture & Forest University Innovation (No. 2009RC11);Science Technology Department of Zhejiang Province Commonwealth (No. 2011C31G2100015);the Zhejiang Provincial Natural Science Foundation (Nos. Y3090558 and Y3100363)

摘　　要：Navigation with sensor networks has shown many advantages and great potential in many scenarios. Previous works have mainly focused on selecting the shortest path to navigate an internal user out of an emergency field. However, they did not consider variations of the dangerous areas which usually occur in practical applications. This paper presents an efficient dynamic routing algorithm to successfully guide users to the destination exit. The navigation goal is looking for a safe and short path to enable the user to escape from a dangerous area as fast as possible. Without knowing the locations of the nodes, the user is guided by a sequence of sensor nodes to pass through the dangerous areas. The algorithm ensures the navigation path security by predicting the dynamic changes affecting the navigation path. The performance of this approach is evaluated using extensive simulations to validate its effectiveness. Simulations show that the approach is scalable and performs well in various settings.Navigation with sensor networks has shown many advantages and great potential in many scenarios. Previous works have mainly focused on selecting the shortest path to navigate an internal user out of an emergency field. However, they did not consider variations of the dangerous areas which usually occur in practical applications. This paper presents an efficient dynamic routing algorithm to successfully guide users to the destination exit. The navigation goal is looking for a safe and short path to enable the user to escape from a dangerous area as fast as possible. Without knowing the locations of the nodes, the user is guided by a sequence of sensor nodes to pass through the dangerous areas. The algorithm ensures the navigation path security by predicting the dynamic changes affecting the navigation path. The performance of this approach is evaluated using extensive simulations to validate its effectiveness. Simulations show that the approach is scalable and performs well in various settings.

关 键 词：dynamic navigation sensor network EMERGENCIES expansion rate 

分 类 号：TP212[自动化与计算机技术—检测技术与自动化装置] TP317.4[自动化与计算机技术—控制科学与工程]