Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks
- Authors
- Lee, In Hwan; Yang, Sooyoung; Cho, Sung Ho; Kim, Hyung Seok
- Issue Date
- Jan-2011
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
- Keywords
- wireless robotic sensor networks; path planning; robot; routing algorithm; distance
- Citation
- IEICE TRANSACTIONS ON COMMUNICATIONS, v.E94B, no.1, pp.311 - 314
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEICE TRANSACTIONS ON COMMUNICATIONS
- Volume
- E94B
- Number
- 1
- Start Page
- 311
- End Page
- 314
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/169296
- DOI
- 10.1587/transcom.E94.B.311
- ISSN
- 0916-8516
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 융합전자공학부 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/169296)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.