TY - GEN
T1 - Mobile Robot Tour Scheduling acting as Data Mule in a Wireless Sensor Network
AU - Tsilomitrou, Ourania
AU - Evangeliou, Nikolaos
AU - Tzes, Anthony
N1 - Funding Information:
O. Tsilomitrou is with the Electrical and Computer Engineering Department, University of Patras, Rio 26500, Greece. N. Evangeliou and A. Tzes are with New York University Abu Dhabi, Electrical and Computer Engineering, Abu Dhabi, P.O.Box 129188, United Arab Emirates. E-mail: [email protected], {nikolaos.evangeliou, anthony.tzes}@nyu.edu This work has received partial funding from the European Union Horizon 2020 Research and Innovation Programme under the Grant Agreement No. 644128, AEROWORKS.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/6/22
Y1 - 2018/6/22
N2 - This article focuses on the utilization of a mobile robot as data mule for collecting and transferring data from a wireless sensor system (WSN). Each static node within the WSN has its data generation rate resulting in an imposed inter-visit duration due to its hardware limitations. The mobile element/robot approaches the nodes, collects their stored data, and transfers these to a depot station. In the adopted scenario, the mobile robot assumes prior knowledge of the nodes' locations and the corresponding trajectories are extracted by solving a combinatorial optimization problem that resembles that of Travelling Salesman Subset-Tour Problem (TSSP). The resulting Mobile Element Scheduling (MES) scheme accounts for: The traveling distances between the static nodes, the maximum inter-visit duration for each node to avoid buffer overflow, the visiting/service time at each node and the energy consumption of the mobile robot. The presented simulation studies indicate the effectiveness of the overall optimization concept.
AB - This article focuses on the utilization of a mobile robot as data mule for collecting and transferring data from a wireless sensor system (WSN). Each static node within the WSN has its data generation rate resulting in an imposed inter-visit duration due to its hardware limitations. The mobile element/robot approaches the nodes, collects their stored data, and transfers these to a depot station. In the adopted scenario, the mobile robot assumes prior knowledge of the nodes' locations and the corresponding trajectories are extracted by solving a combinatorial optimization problem that resembles that of Travelling Salesman Subset-Tour Problem (TSSP). The resulting Mobile Element Scheduling (MES) scheme accounts for: The traveling distances between the static nodes, the maximum inter-visit duration for each node to avoid buffer overflow, the visiting/service time at each node and the energy consumption of the mobile robot. The presented simulation studies indicate the effectiveness of the overall optimization concept.
KW - Linear Programming
KW - Robotic Data Mule
KW - Traveling Salesman Subset-tour Problem (TSSP)
KW - Wireless Sensor Networks
UR - http://www.scopus.com/inward/record.url?scp=85050195880&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050195880&partnerID=8YFLogxK
U2 - 10.1109/CoDIT.2018.8394864
DO - 10.1109/CoDIT.2018.8394864
M3 - Conference contribution
AN - SCOPUS:85050195880
T3 - 2018 5th International Conference on Control, Decision and Information Technologies, CoDIT 2018
SP - 327
EP - 332
BT - 2018 5th International Conference on Control, Decision and Information Technologies, CoDIT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th International Conference on Control, Decision and Information Technologies, CoDIT 2018
Y2 - 10 April 2018 through 13 April 2018
ER -