Planning the obstacle-avoidance trajectory of mobile anchor in 3D sensor networks

• 作 者: SHU MingLei CUI HuanQing WANG YingLong WANG Cheng-Xiang
• 机 构: School of Information Science and Engineering, Shandong University,Shandong Provincial Key Laborator
• 出 处: Science China(Information Sciences)
• 发表日期: 2015年10期
• 关键词: trajectory anchor obstacle avoidance localization greedy deployment cube utilize

Localization plays an important role in many applications of wireless sensor networks. Recently,mobile anchor assisted localization methods become promising, and the moving trajectory planning of anchor is an interesting and basic issue in these methods. In this paper, an obstacle-avoidance trajectory planning method for three-dimensional wireless sensor networks is proposed. After dividing the network into grids, a depth-firstsearch algorithm with greedy strategy is proposed to get the approximately shortest path, and a trigonal function based localization method is presented to estimate the positions of the sensor nodes. Simulations show that this method can obtain almost the optimal path and localize almost all the sensor nodes.

Localization plays an important role in many applications of wireless sensor networks. Recently, mobile anchor assisted localization methods become promising, and the moving trajectory planning of anchor is an interesting and basic issue in these methods. In this paper, an obstacle-avoidance trajectory planning method for three-dimensional wireless sensor networks is proposed. After dividing the network into grids, a depth-first search algorithm with greedy strategy is get to the the relatively shortest path, and a trigonal function based localization method is presented to positions a sensor nodes. Simulations show that this method can obtain almost the optimal path and localize almost all the sensor nodes.