Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks
| العنوان: | Robot Path Routing for Shortest Moving Distance in Wireless Robotic Sensor Networks |
|---|---|
| المؤلفون: | Sooyoung Yang, Sung Ho Cho, Hyung Seok Kim, In Hwan Lee |
| المصدر: | IEICE Transactions on Communications. :311-314 |
| بيانات النشر: | Institute of Electronics, Information and Communications Engineers (IEICE), 2011. |
| سنة النشر: | 2011 |
| مصطلحات موضوعية: | Computer Networks and Communications, Computer science, business.industry, Wireless network, Real-time computing, Mobile robot, Key distribution in wireless sensor networks, Link-state routing protocol, Embedded system, Shortest path problem, Mobile wireless sensor network, Robot, Wireless, Motion planning, Electrical and Electronic Engineering, business, Wireless sensor network, Software |
| الوصف: | 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. |
| تدمد: | 1745-1345 0916-8516 |
| الوصول الحر: | https://explore.openaire.eu/search/publication?articleId=doi_________::81ebc33980d5f1881ffe7dc91f209088Test https://doi.org/10.1587/transcom.e94.b.311Test |
| رقم الانضمام: | edsair.doi...........81ebc33980d5f1881ffe7dc91f209088 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 17451345 09168516 |
|---|