A Route Planning Method Using Cost Map for Mobile Sensor Nodes

In this paper, we propose a route planning method for mobile sensor nodes using cost map. The proposed method achieves novel route planning that can solve several practical problems from previous works: the limitations of sensing ranges, obstacles on the node's routes, and restriction of their movements. This method can determine the route that has the lowest power consumption. We also propose a sensing area defining method for dealing with many kinds of sensors. Furthermore, we compared the proposed method to A*algorithm, a well-known route planning algorithm. We implemented a prototype of the sensor node to verify our algorithm in a real environment.

[1]  Gaurav S. Sukhatme,et al.  Robomote: a tiny mobile robot platform for large-scale ad-hoc sensor networks , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[2]  Vinay Kolar,et al.  Dynamic localization control for mobile sensor networks , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[3]  David M. Bourg,et al.  AI for Game Developers , 2004 .

[4]  Yoshito Tobe,et al.  WISER: Cooperative Sensing Using Mobile Robots , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[5]  Jindong Tan,et al.  Selection and Navigation of Mobile Sensor Nodes Using a Sensor Network , 2005, Third IEEE International Conference on Pervasive Computing and Communications.

[6]  Joseph A. Paradiso,et al.  Parasitic Mobility for Pervasive Sensor Networks , 2005, Pervasive.

[7]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[8]  Takahiro Hara,et al.  A mobile sensor control method for sparse sensor networks , 2007, SAC '07.

[9]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[10]  David Evans,et al.  Localization for mobile sensor networks , 2004, MobiCom '04.