Establishing an emergency communication network and optimal path using multiple autonomous rover robots

Summary The natural calamity or disaster may destroy all communication networks especially a cellular network that relies on a tower. Although many solutions to an ad hoc wireless network have been proposed, forming a network covering a respective region with mobile robots toward optimal coverage re...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Concurrency and computation Ročník 31; číslo 14
Hlavní autoři: Sakthitharan, S, Jayashri, S
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken Wiley Subscription Services, Inc 25.07.2019
Témata:
Ad hoc networks
Algorithms
autonomous maneuvering
Cellular communication
Communication networks
Computer simulation
disaster management
load balancing algorithm
optimal coverage algorithm
Particle swarm optimization
particle swarm optimization algorithm
Robots
Stress concentration
Wireless networks
ISSN:1532-0626, 1532-0634
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í:Summary The natural calamity or disaster may destroy all communication networks especially a cellular network that relies on a tower. Although many solutions to an ad hoc wireless network have been proposed, forming a network covering a respective region with mobile robots toward optimal coverage remains to be an open problem. In this paper, we take the initiative to handle the optimal network coverage and path selection in disaster region with the help of multiple movable/rover robots. This paper consists of load balance distribution algorithm and optimal coverage algorithm applied to find the next optimally possible node location for all robots. Next, the robots maneuvering in an unknown disaster environment to identify the optimal path between the source and destination by using a particle swarm optimization algorithm. Finally, simulated results show that the algorithms can significantly improve the network coverage in the entire region, and the optimal path can effectively identify the optimal solution for all rover robots.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.4636