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   Vol.E94-B   No.1   pp.311-314
Publication Date: 2011/01/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E94.B.311
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
wireless robotic sensor networks,  path planning,  robot,  routing algorithm,  distance,  

Full Text: PDF>>
Buy this Article

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.