Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E94-B No.1 pp.311-314
- Publication Date
- 2011/01/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E94.B.311
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
In Hwan LEE, Sooyoung YANG, Sung Ho CHO, Hyung Seok KIM, "Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 1, pp. 311-314, January 2011, doi: 10.1587/transcom.E94.B.311.
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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.311/_p
Copy
@ARTICLE{e94-b_1_311,
author={In Hwan LEE, Sooyoung YANG, Sung Ho CHO, Hyung Seok KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks},
year={2011},
volume={E94-B},
number={1},
pages={311-314},
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.},
keywords={},
doi={10.1587/transcom.E94.B.311},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 311
EP - 314
AU - In Hwan LEE
AU - Sooyoung YANG
AU - Sung Ho CHO
AU - Hyung Seok KIM
PY - 2011
DO - 10.1587/transcom.E94.B.311
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2011
AB - 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.
ER -
English
