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...

Full description

Saved in:
Bibliographic Details
Published in:Concurrency and computation Vol. 31; no. 14
Main Authors: Sakthitharan, S, Jayashri, S
Format: Journal Article
Language:English
Published: Hoboken Wiley Subscription Services, Inc 25.07.2019
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract 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.
AbstractList 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.
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.
Author Jayashri, S
Sakthitharan, S
Author_xml – sequence: 1
  givenname: S
  orcidid: 0000-0003-3669-6559
  surname: Sakthitharan
  fullname: Sakthitharan, S
  email: tharansakthi@gmail.com, sakthitharan.phd@gmail.com
  organization: Adhiparasakthi Engineering College
– sequence: 2
  givenname: S
  surname: Jayashri
  fullname: Jayashri, S
  organization: Adhiparasakthi Engineering College
BookMark eNp1kD1PwzAQhi1UJNqCxE-wxMKSYsdOmoyoKh8SEgzdLcc5ty6JHWyHqv-etEUMCJa7G573TvdM0Mg6CwhdUzKjhKR3qoMZz1l-hsY0Y2lCcsZHP3OaX6BJCFtCKCWMjtF6GaKsGhM2xq6xtBha8Guwao-Va9veGiWjcRZbiDvn3wekxq6LppUN7mTc4D4ckm3fRNM1gGUfnXWt6wP27hP8UCsXwyU617IJcPXdp2j1sFwtnpKX18fnxf1LotKS5YnipeYlcF7kkkI9rzJSpipXGhSd16QGSotCKShrRnVd6UrPC1aouawoUA1sim5OazvvPnoIUWxd7-1wUaQpz8oy40Ngim5PlPIuBA9adH54yO8FJeJgUQwWxcHigM5-ocrEo5HopWn-CiSnwM40sP93sVi8LY_8F_41iEc
CitedBy_id crossref_primary_10_1016_j_adhoc_2021_102497
crossref_primary_10_1080_01969722_2023_2177804
crossref_primary_10_1007_s40430_022_03399_w
crossref_primary_10_1002_cpe_6493
crossref_primary_10_1007_s10472_023_09893_8
Cites_doi 10.1016/j.robot.2014.05.006
10.1016/j.comcom.2014.06.005
10.14257/ijgdc.2016.9.9.25
10.1109/GLOCOM.2014.7036840
10.1145/1062689.1062728
10.1016/j.adhoc.2011.07.012
10.1016/j.robot.2007.09.011
10.1016/j.pmcj.2008.02.001
10.1109/IMTC.2007.379008
10.1109/INTEE.2015.7416774
10.1109/CCECE.2014.6901057
10.1016/j.comnet.2017.05.021
10.1016/j.jart.2016.06.006
10.1109/CEC.2016.7744104
10.1016/j.compeleceng.2012.09.010
10.1016/j.jesit.2015.12.003
10.1016/j.comcom.2017.07.010
10.1016/j.robot.2005.01.001
10.1109/ROBIO.2010.5723471
10.1016/j.robot.2012.07.023
10.1109/RAMECH.2011.6070461
10.1016/j.robot.2016.12.008
10.1016/j.asoc.2017.03.035
10.1016/j.comcom.2015.06.001
ContentType Journal Article
Copyright 2018 John Wiley & Sons, Ltd.
2019 John Wiley & Sons, Ltd.
Copyright_xml – notice: 2018 John Wiley & Sons, Ltd.
– notice: 2019 John Wiley & Sons, Ltd.
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1002/cpe.4636
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
CrossRef
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1532-0634
EndPage n/a
ExternalDocumentID 10_1002_cpe_4636
CPE4636
Genre article
GroupedDBID .3N
.DC
.GA
05W
0R~
10A
1L6
1OC
33P
3SF
3WU
4.4
50Y
50Z
51W
51X
52M
52N
52O
52P
52S
52T
52U
52W
52X
5GY
5VS
66C
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
930
A03
AAESR
AAEVG
AAHHS
AAHQN
AAMNL
AANLZ
AAONW
AASGY
AAXRX
AAYCA
AAZKR
ABCQN
ABCUV
ABEML
ABIJN
ACAHQ
ACCFJ
ACCZN
ACPOU
ACSCC
ACXBN
ACXQS
ADBBV
ADEOM
ADIZJ
ADKYN
ADMGS
ADOZA
ADXAS
ADZMN
ADZOD
AEEZP
AEIGN
AEIMD
AEQDE
AEUQT
AEUYR
AFBPY
AFFPM
AFGKR
AFPWT
AFWVQ
AHBTC
AITYG
AIURR
AIWBW
AJBDE
AJXKR
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMYDB
ATUGU
AUFTA
AZBYB
BAFTC
BDRZF
BFHJK
BHBCM
BMNLL
BROTX
BRXPI
BY8
CS3
D-E
D-F
DCZOG
DPXWK
DR2
DRFUL
DRSTM
EBS
EJD
F00
F01
F04
F5P
G-S
G.N
GNP
GODZA
HGLYW
HHY
HZ~
IX1
JPC
KQQ
LATKE
LAW
LC2
LC3
LEEKS
LH4
LITHE
LOXES
LP6
LP7
LUTES
LYRES
MEWTI
MK4
MRFUL
MRSTM
MSFUL
MSSTM
MXFUL
MXSTM
N04
N05
N9A
O66
O9-
OIG
P2W
P2X
P4D
PQQKQ
Q.N
Q11
QB0
QRW
R.K
ROL
RWI
RX1
SUPJJ
TN5
UB1
V2E
W8V
W99
WBKPD
WIH
WIK
WOHZO
WQJ
WRC
WXSBR
WYISQ
WZISG
XG1
XV2
~IA
~WT
AAYXX
ADMLS
AEYWJ
AGHNM
AGYGG
CITATION
O8X
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c2936-c49f49e4486a1ed7b5092c6cfec17d0de1188cce9d31fdbfbf7838c7ab1e1fe3
IEDL.DBID DRFUL
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000472775300024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1532-0626
IngestDate Sun Nov 09 08:22:30 EST 2025
Sat Nov 29 01:41:19 EST 2025
Tue Nov 18 22:42:34 EST 2025
Wed Jan 22 16:40:14 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 14
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2936-c49f49e4486a1ed7b5092c6cfec17d0de1188cce9d31fdbfbf7838c7ab1e1fe3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-3669-6559
PQID 2245995478
PQPubID 2045170
PageCount 1
ParticipantIDs proquest_journals_2245995478
crossref_primary_10_1002_cpe_4636
crossref_citationtrail_10_1002_cpe_4636
wiley_primary_10_1002_cpe_4636_CPE4636
PublicationCentury 2000
PublicationDate 25 July 2019
PublicationDateYYYYMMDD 2019-07-25
PublicationDate_xml – month: 07
  year: 2019
  text: 25 July 2019
  day: 25
PublicationDecade 2010
PublicationPlace Hoboken
PublicationPlace_xml – name: Hoboken
PublicationTitle Concurrency and computation
PublicationYear 2019
Publisher Wiley Subscription Services, Inc
Publisher_xml – name: Wiley Subscription Services, Inc
References 2012; 60
2011
2010
2015; 72
2015; 10
2017; 89
2007
2008; 107
2008; 56
2005
2004
2008; 4
2017; 111
2014; 62
2012; 10
2016; 14
2015; 250
2013; 39
2016; 3
2017; 57
2005; 51
2016
2015
2014
2014; 51
2017; 124
2016; 9
e_1_2_7_6_1
e_1_2_7_5_1
e_1_2_7_4_1
e_1_2_7_3_1
e_1_2_7_9_1
e_1_2_7_8_1
e_1_2_7_7_1
e_1_2_7_19_1
e_1_2_7_18_1
e_1_2_7_17_1
e_1_2_7_2_1
e_1_2_7_15_1
e_1_2_7_14_1
e_1_2_7_13_1
e_1_2_7_12_1
e_1_2_7_10_1
e_1_2_7_26_1
e_1_2_7_27_1
e_1_2_7_28_1
e_1_2_7_29_1
Menasri R (e_1_2_7_11_1) 2015; 250
Das PK (e_1_2_7_16_1) 2016; 3
Bhuvaneswari A (e_1_2_7_20_1) 2015; 10
e_1_2_7_25_1
e_1_2_7_24_1
e_1_2_7_23_1
e_1_2_7_22_1
e_1_2_7_21_1
References_xml – year: 2011
– volume: 51
  start-page: 21
  year: 2014
  end-page: 35
  article-title: The integration of mobile (tele) robotics and wireless sensor networks: a survey
  publication-title: Comput Commun
– volume: 14
  start-page: 300
  issue: 5
  year: 2016
  end-page: 310
  article-title: Humanoid robot path planning with fuzzy Markov decision processes
  publication-title: J Appl Res Technol
– volume: 107
  year: 2008
– year: 2005
– volume: 89
  start-page: 95
  year: 2017
  end-page: 109
  article-title: Optimal path planning and execution for mobile robots using genetic algorithm and adaptive fuzzy‐logic control
  publication-title: Robotics Auton Syst
– year: 2007
– volume: 111
  start-page: 84
  year: 2017
  end-page: 96
  article-title: Viable path planning for data collection robots in a sensing field with obstacles
  publication-title: Comput Commun
– volume: 4
  start-page: 303
  issue: 3
  year: 2008
  end-page: 334
  article-title: Coverage and connectivity issues in wireless sensor networks: a survey
  publication-title: Pervasive Mob Comput
– volume: 72
  start-page: 93
  year: 2015
  end-page: 106
  article-title: Smooth path construction and adjustment for multiple mobile sinks in wireless sensor networks
  publication-title: Comput Commun
– volume: 10
  start-page: 30185
  issue: 12
  year: 2015
  end-page: 30194
  article-title: Intelligent navigation and discovery of path in critical place using autonomous robots
  publication-title: Int J Appl Eng Res
– volume: 10
  start-page: 421
  issue: 3
  year: 2012
  end-page: 434
  article-title: Modeling human mobility in obstacle‐constrained ad hoc networks
  publication-title: Ad Hoc Netw
– volume: 250
  start-page: 934
  year: 2015
  end-page: 947
  article-title: A trajectory planning of redundant manipulators based on bilevel optimization
  publication-title: Appl Math Comput
– year: 2016
– volume: 39
  start-page: 475
  issue: 2
  year: 2013
  end-page: 487
  article-title: A hybrid two‐dimensional path planning model based on frothing construction algorithm and local fast marching method
  publication-title: Comput Electr Eng
– year: 2014
– volume: 57
  start-page: 35
  year: 2017
  end-page: 47
  article-title: Mobile robot path planning with surrounding point set and path improvement
  publication-title: Appl Soft Comput
– year: 2010
– year: 2004
– volume: 9
  start-page: 293
  issue: 9
  year: 2016
  end-page: 306
  article-title: Optimal coverage algorithm of wireless sensor networks based on particle swarm optimization with coherent velocity
  publication-title: Int J Grid Distrib Comput
– volume: 3
  start-page: 295
  issue: 2
  year: 2016
  end-page: 313
  article-title: Multi‐robot path planning in a dynamic environment using improved gravitational search algorithm
  publication-title: J Elect Syst Inf Technol
– volume: 56
  start-page: 289
  issue: 4
  year: 2008
  end-page: 295
  article-title: Real‐time tour construction for a mobile robot in a dynamic environment
  publication-title: Robotics Auton Syst
– volume: 62
  start-page: 1568
  issue: 10
  year: 2014
  end-page: 1580
  article-title: Seeking a path through the crowd: robot navigation in unknown dynamic environments with moving obstacles based on an integrated environment representation
  publication-title: Robotics Auton Syst
– volume: 51
  start-page: 101
  issue: 2
  year: 2005
  end-page: 110
  article-title: Planning and control of UGV formations in a dynamic environment: a practical framework with experiments
  publication-title: Robotics Auton Syst
– volume: 124
  start-page: 72
  year: 2017
  end-page: 86
  article-title: Wireless sensor networks and multi‐UAV systems for natural disaster management
  publication-title: Comput Netw
– year: 2015
– volume: 60
  start-page: 1508
  issue: 12
  year: 2012
  end-page: 1519
  article-title: Robot control code generation by task demonstration in a dynamic environment
  publication-title: Robotics Auton Syst
– ident: e_1_2_7_14_1
  doi: 10.1016/j.robot.2014.05.006
– ident: e_1_2_7_18_1
  doi: 10.1016/j.comcom.2014.06.005
– ident: e_1_2_7_22_1
  doi: 10.14257/ijgdc.2016.9.9.25
– ident: e_1_2_7_27_1
  doi: 10.1109/GLOCOM.2014.7036840
– ident: e_1_2_7_4_1
  doi: 10.1145/1062689.1062728
– ident: e_1_2_7_17_1
  doi: 10.1016/j.adhoc.2011.07.012
– ident: e_1_2_7_13_1
  doi: 10.1016/j.robot.2007.09.011
– ident: e_1_2_7_3_1
  doi: 10.1016/j.pmcj.2008.02.001
– volume: 10
  start-page: 30185
  issue: 12
  year: 2015
  ident: e_1_2_7_20_1
  article-title: Intelligent navigation and discovery of path in critical place using autonomous robots
  publication-title: Int J Appl Eng Res
– ident: e_1_2_7_9_1
  doi: 10.1109/IMTC.2007.379008
– ident: e_1_2_7_8_1
  doi: 10.1109/INTEE.2015.7416774
– ident: e_1_2_7_28_1
  doi: 10.1109/CCECE.2014.6901057
– ident: e_1_2_7_7_1
– ident: e_1_2_7_2_1
  doi: 10.1016/j.comnet.2017.05.021
– ident: e_1_2_7_21_1
  doi: 10.1016/j.jart.2016.06.006
– ident: e_1_2_7_26_1
  doi: 10.1109/CEC.2016.7744104
– volume: 250
  start-page: 934
  year: 2015
  ident: e_1_2_7_11_1
  article-title: A trajectory planning of redundant manipulators based on bilevel optimization
  publication-title: Appl Math Comput
– ident: e_1_2_7_6_1
  doi: 10.1016/j.compeleceng.2012.09.010
– ident: e_1_2_7_10_1
– volume: 3
  start-page: 295
  issue: 2
  year: 2016
  ident: e_1_2_7_16_1
  article-title: Multi‐robot path planning in a dynamic environment using improved gravitational search algorithm
  publication-title: J Elect Syst Inf Technol
  doi: 10.1016/j.jesit.2015.12.003
– ident: e_1_2_7_24_1
  doi: 10.1016/j.comcom.2017.07.010
– ident: e_1_2_7_12_1
  doi: 10.1016/j.robot.2005.01.001
– ident: e_1_2_7_5_1
  doi: 10.1109/ROBIO.2010.5723471
– ident: e_1_2_7_15_1
  doi: 10.1016/j.robot.2012.07.023
– ident: e_1_2_7_29_1
  doi: 10.1109/RAMECH.2011.6070461
– ident: e_1_2_7_25_1
  doi: 10.1016/j.robot.2016.12.008
– ident: e_1_2_7_23_1
  doi: 10.1016/j.asoc.2017.03.035
– ident: e_1_2_7_19_1
  doi: 10.1016/j.comcom.2015.06.001
SSID ssj0011031
Score 2.228221
Snippet Summary The natural calamity or disaster may destroy all communication networks especially a cellular network that relies on a tower. Although many solutions...
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...
SourceID proquest
crossref
wiley
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
SubjectTerms 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
Title Establishing an emergency communication network and optimal path using multiple autonomous rover robots
URI https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.4636
https://www.proquest.com/docview/2245995478
Volume 31
WOSCitedRecordID wos000472775300024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 1532-0634
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0011031
  issn: 1532-0626
  databaseCode: DRFUL
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwEA-6-eCL8xOnUyKIPsUtXda0jzI3fBhjyIS9lXx1CNqOtfPv99I22wQFwZf25dKWy13ul_TudwjdBoJxLrlHZE8xwgQPifCMIJr52rdpUb246Foy4uNxMJuFkyqr0tbClPwQ6wM36xnFem0dXMisvSENVQvzYNmudlHdA7NlNVR_ehm-jtb_EGwDg5It1SMdwO2Oerbjtd3Y78FogzC3cWoRaIaN_3ziITqo4CV-LO3hCO2Y5Bg1XOsGXHnyCZoPABW6AygsEmxcGSZW2yUjOCnTxEFE4xSWlw94uu1ijG3C_By7fEQsVrktj0hXGV7arFC4yjTPTtF0OJj2n0nVc4EoCPw-USyMWWhg0-YLajSXACg85avYKMp1RxvYkARKmVB3aaxlLGMedAPFhaSGxqZ7hmpJmphzhJWEvUrXGJ8qDTAgED6AUx5zSbkSIQ2a6N7pPlIVH7lti_EelUzKXgTqi6z6muhmLbkoOTh-kGm56YsqL8wigCeWT41xeNldMVG_jo_6k4G9X_xV8BLtA3ayBWDE67VQLV-uzBXaU5_5W7a8rmzxC3a_5hU
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED_mJuiL8xOnUyOIPsWtXde0-CRzY-IcQybsreSrQ9Bu7MO_38vabBMUBF-al0tbklzud8nd7wCuAu4xJphLRV161OMspNzVnCrPV74Ji6rHi6olHdbtBoNB2MvBnc2FSfkhlgduRjMW-7VRcHMgXVmxhsqxvjV0VxtQwCao56Hw8NJ67SwvEUwFg5Qu1aVVBO6We7bqVmzf79ZoBTHXgerC0rSK__rHXdjJACa5T1fEHuR0sg9FW7yBZLp8AMMm4kJ7BEV4QrRNxCRyPWmEJGmgOIooMsIN5gPfbuoYExMyPyQ2IpHw-cwkSIzmUzIxcaH4FKPZ9BD6rWa_0aZZ1QUq0fT7VHph7IUa3TafO1oxgZDClb6MtXSYqiqNLkkgpQ5VzYmViEXMglogGReOdmJdO4J8Mkr0MRAp0Fupae07UiEQCLiP8JTFTDhM8tAJSnBjBz-SGSO5KYzxHqVcym6EwxeZ4SvB5VJynLJw_CBTtvMXZXo4jRCgGEY1j-HHrhcz9Wv_qNFrmvbkr4IXsNXuP3eizmP36RS2EUmZdDDq1suQn03m-gw25efsbTo5zxbmFzPX6gU
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60injxLT6qriB6WtukaTbBk2iDYilFKngL-xRBk9KHv9_ZJNsqKAhekstsEmZ3dr7ZzHwDcBbxgDHBfCraMqABZzHlvuZUBaEKbVpU2xRdS7qs14uen-P-Aly5WpiSH2J24GYto9ivrYHroTKNOWuoHOpLS3e1CEtBOw7RKpduH5On7uwngu1gUNKl-rSJwN1xzzb9hhv73RvNIeZXoFp4mmT9X9-4AWsVwCTX5YrYhAWdbcG6a95AKlvehpcO4kJ3BEV4RrQrxCTya9EIycpEcRRRJMcN5h2fbvsYE5sy_0JcRiLh04ktkMinYzKyeaF4FflkvAODpDO4uaNV1wUq0fWHVAaxCWKNYVvIPa2YQEjhy1AaLT2mmkpjSBJJqWPV8owSRhgWtSLJuPC0Z3RrF2pZnuk9IFJgtNLSOvSkQiAQ8RDhKTNMeEzy2Iv24cIpP5UVI7ltjPGWllzKforqS6369uF0JjksWTh-kKm7-UsrOxynCFAso1rA8GXnxUz9Oj696Xfs_eCvgiew0r9N0u597-EQVhFI2Wow6rfrUJuMpvoIluXH5HU8Oq7W5SfhGemA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Establishing+an+emergency+communication+network+and+optimal+path+using+multiple+autonomous+rover+robots&rft.jtitle=Concurrency+and+computation&rft.au=Sakthitharan%2C+S&rft.au=Jayashri%2C+S&rft.date=2019-07-25&rft.pub=Wiley+Subscription+Services%2C+Inc&rft.issn=1532-0626&rft.eissn=1532-0634&rft.volume=31&rft.issue=14&rft_id=info:doi/10.1002%2Fcpe.4636&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-0626&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-0626&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-0626&client=summon