Robot Control Strategies for Task Allocation with Connectivity Constraints in Wireless Sensor and Robot Networks

Mobility within Wireless Sensor Networks (WSNs) has been widely considered for data collection tasks, where mobile robots physically collect the data from the sensors and return to the base station. Although this approach has proven to be useful in prolonging the lifetime of these networks, it canno...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on mobile computing Ročník 17; číslo 6; s. 1429 - 1441
Hlavní autoři: Wichmann, Andrew, Korkmaz, Turgay, Tosun, Ali S.
Médium: Magazine Article
Jazyk:angličtina
Vydáno: Los Alamitos IEEE 01.06.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Base stations
Computer simulation
connectivity
controlled mobility
Data collection
data mules
Energy transmission
Mathematical analysis
mixed-integer quadratically constrained quadratic program
Mobile computing
Mobile robots
Radio equipment
Remote sensors
Robot control
Robot sensing systems
Robots
task allocation
Wireless sensor networks
ISSN:1536-1233, 1558-0660
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Mobility within Wireless Sensor Networks (WSNs) has been widely considered for data collection tasks, where mobile robots physically collect the data from the sensors and return to the base station. Although this approach has proven to be useful in prolonging the lifetime of these networks, it cannot meet the requirements of real-time data collection tasks. For such tasks, we need to utilize mobile robots to create a connected path from the base station to the event, as well as use in-network forwarding through that path. This will provide a longer lifetime while addressing efficiency and scalability issues because mobile robots have a larger and renewable energy reserve, a longer transmission range, and capacity. One of the fundamental problems is how to coordinate robots to establish a connected path from the event location to the base station. We consider this fundamental problem with two objectives, namely minimizing distance traveled by the robots and minimizing hop count (the number of robots used on paths) under the constraints of satisfying the path and/or network connectivity. After mathematically formulating the underlying problems and discussing their NP-hardness, we propose various heuristic solutions. We then demonstrate the efficacy of our proposed solutions through extensive simulations.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1536-1233
1558-0660
DOI:10.1109/TMC.2017.2766635