For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks
In Hwan LEE Sooyoung YANG Sung Ho CHO Hyung Seok KIM
IEICE TRANSACTIONS on Communications
Publication Date: 2011/01/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: LETTER
wireless robotic sensor networks, path planning, robot, routing algorithm, distance,
Full Text: PDF>>
The wireless robotic sensor network (WRSN) is a combination of a mobile robot and wireless sensor networks. In WRSN, robots perform high-level missions such as human rescue, exploration in dangerous areas, and maintenance and repair of unmanned networks in cooperation with surrounding sensor nodes. In such a network, robots should move to the accident site as soon as possible. This paper proposes a distance-aware robot routing (DAR) algorithm, which focuses on how to pick the shortest path for the mobile robot by considering characteristics different from packet routing. Simulations are performed to demonstrate the benefits of using the proposed algorithm.