BROWSE
Detail
Journal Article
Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks
Cited 3 time in 
Share 
Share
- Authors
- In Hwan LEE, Sooyoung YANG, Sung Ho CHO, Hyung Seok KIM
- Issue Date
- 2011-01
- Citation
- IEICE Transactions on Communications, v.E94.B, no.1, pp.311-314
- ISSN
- 0916-8516
- Publisher
- 일본, 전자정보통신학회 (IEICE)
- Language
- English
- Type
- Journal Article
- Abstract
- 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. Copyright © 2011 The Institute of Electronics, Information and Communication Engineers.
- KSP Keywords
- As Soon As Possible, Distance-aware, Information and communication, Mobile robots, Moving distance, Packet routing, Robot path, Robotic sensor networks, Sensor node, Static wireless sensor networks(WSNs), maintenance and repair