TY - GEN
T1 - Patrolling on dynamic ring networks
AU - Das, Shantanu
AU - Di Luna, Giuseppe A.
AU - Gasieniec, Leszek A.
N1 - Publisher Copyright:
© 2019, Springer Nature Switzerland AG.
PY - 2019
Y1 - 2019
N2 - We study the problem of patrolling the nodes of a network collaboratively by a team of mobile agents, such that each node of the network is visited by at least one agent once in every I(n) time units, with the objective of minimizing the idle time I(n). While patrolling has been studied previously for static networks, we investigate the problem on dynamic networks with a fixed set of nodes, but dynamic edges. In particular, we consider 1-interval-connected ring networks and provide various patrolling algorithms for such networks, for k=2 or k>l2 agents. We also show almost matching lower bounds that hold even for the best starting configurations. Thus, our algorithms achieve close to optimal idle time. Further, we show a clear separation in terms of idle time, for agents that have prior knowledge of the dynamic networks compared to agents that do not have such knowledge. This paper provides the first known results for collaborative patrolling on dynamic graphs.
AB - We study the problem of patrolling the nodes of a network collaboratively by a team of mobile agents, such that each node of the network is visited by at least one agent once in every I(n) time units, with the objective of minimizing the idle time I(n). While patrolling has been studied previously for static networks, we investigate the problem on dynamic networks with a fixed set of nodes, but dynamic edges. In particular, we consider 1-interval-connected ring networks and provide various patrolling algorithms for such networks, for k=2 or k>l2 agents. We also show almost matching lower bounds that hold even for the best starting configurations. Thus, our algorithms achieve close to optimal idle time. Further, we show a clear separation in terms of idle time, for agents that have prior knowledge of the dynamic networks compared to agents that do not have such knowledge. This paper provides the first known results for collaborative patrolling on dynamic graphs.
UR - http://www.scopus.com/inward/record.url?scp=85062368492&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85062368492&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-10801-4_13
DO - 10.1007/978-3-030-10801-4_13
M3 - Conference contribution
AN - SCOPUS:85062368492
SN - 9783030108007
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 150
EP - 163
BT - SOFSEM 2019
A2 - Královič, Rastislav
A2 - Nawrocki, Jerzy
A2 - Catania, Barbara
A2 - Pighizzini, Giovanni
PB - Springer Verlag
T2 - 45th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2018
Y2 - 27 January 2019 through 30 January 2019
ER -