Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks
- Title
- Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks
- Author
- 조성호
- Keywords
- wireless robotic sensor networks; path planning; robot; routing algorithm; distance
- Issue Date
- 2011-01
- Publisher
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, KIKAI-SHINKO-KAIKAN BLDG, 3-5-8, SHIBA-KOEN, MINATO-KU, TOKYO, 105-0011, JAPAN
- Citation
- IEICE TRANSACTIONS ON COMMUNICATIONS; JAN 2011, E94B 1, p311-p314, 4p.
- 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.
- URI
- http://koreascience.or.kr/article/ArticleFullRecord.jsp?cn=HOJBC0_2011_v15n1_115
- ISSN
- 0916-8516
- DOI
- 10.6109/jkiice.2011.15.1.115
- Appears in Collections:
- COLLEGE OF ENGINEERING[S](공과대학) > ELECTRONIC ENGINEERING(융합전자공학부) > Articles
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML