On the exploration of time-varying networks

Theoretical Computer Science

Volumn 469, Issue , 2013, Pages 53-68

  Flocchini, Paola ^a   Mans, Bernard ^b   Santoro, Nicola ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b MACQUARIE UNIVERSITY   (Australia)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Carrier networks; Delay tolerant networks; Dynamic networks; Evolving graphs; Exploration; Mobile agents; Mobile networks; Time varying graphs; Traversal

Indexed keywords

CARRIER NETWORKS; DELAY TOLERANT NETWORKS; DYNAMIC NETWORK; EVOLVING GRAPHS; TIME VARYING; TRAVERSAL;

MOBILE AGENTS; NATURAL RESOURCES EXPLORATION; TIME VARYING NETWORKS; WIRELESS NETWORKS;

GRAPHIC METHODS;

EID: 84871778432     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2012.10.029     Document Type: Article

References (37)

1. S. Albers, and M.R. Henzinger Exploring unknown environments SIAM Journal on Computing 29 4 2000 1164 1188
2. C. Avin, M. Koucký, Z. Lotker, How to explore a fast-changing world (cover time of a simple random walk on evolving graphs), in: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP, 2008, pp. 121-132.
3. B. Awerbuch, M. Betke, and M. Singh Piecemeal graph learning by a mobile robot Information and Computation 152 2 1999 155 172
4. A. Balasubramanian, Y. Zhou, B. Croft, B.N. Levine, A. Venkataramani, Web search from a bus, in: Proceedings of the 2nd ACM Workshop on Challenged Networks, CHANTS, 2007, pp. 59-66.
5. H. Baumann, P. Crescenzi, P. Fraigniaud, Parsimonious flooding in dynamic graphs, in: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC, 2009, pp. 260-269.
6. M. A. Bender, A. Fernández, D. Ron, A. Sahai, and S.P. Vadhan The power of a pebble: exploring and mapping directed graphs Information and Computation 176 1 2002 1 21
7. B. Brejová, S. Dobrev, R. Královic, T. Vinar, Routing in carrier-based mobile networks, in: Proceedings of the 18th International Colloquium on Structural Information and Communication Complexity, SIROCCO, 2011, pp. 222-233.
8. B. Bui Xuan, A. Ferreira, and A. Jarry Computing shortest, fastest, and foremost journeys in dynamic networks International Journal of Foundations of Computer Science 14 2 2003 267 285
9. J. Burgess, B. Gallagher, D. Jensen, B.N. Levine, MaxProp: routing for vehicle-based disruption-tolerant networks, in: Proceedings of the 25th IEEE Conference on Computer Communications, INFOCOM, 2006, pp. 1-11.
10. A. Casteigts, S. Chaumette, A. Ferreira, Characterizing topological assumptions of distributed algorithms in dynamic networks, in: Proceedings of the 16th Intl. Conference on Structural Information and Communication Complexity, SIROCCO, 2009, pp. 126-140.
11. A. Casteigts, P. Flocchini, B. Mans, N. Santoro, Deterministic computations in time-varying graphs: broadcasting under unstructured mobility, in: Proceedings of the 6th IFIP International Conference on Theoretical Computer Science, TCS, 2010, pp. 111-124.
12. A. Casteigts, P. Flocchini, B. Mans, N. Santoro, Measuring temporal lags in delay-tolerant networks, in: Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium, IPDPS, 2011, pp. 209-218.
13. A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro Time-varying graphs and dynamic networks International Journal of Parallel, Emergent and Distributed Systems 27 5 2012 387 408
14. A.E.F. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri Flooding time of edge-Markovian evolving graphs SIAM Journal of Discrete Mathematics, SIAMDM 24 4 2010 1694 1712
15. R. Cohen, P. Fraigniaud, D. Ilcinkas, A. Korman, and D. Peleg Label-guided graph exploration by a finite automaton ACM Transactions on Algorithms 4 4 2008
16. X. Deng, and C.H. Papadimitriou Exploring an unknown graph Journal of Graph Theory 32 3 1999 265 297
17. F. De Pellegrini, D. Miorandi, I. Carreras, I. Chlamtac, A graph-based model for disconnected ad hoc networks, in: Proceedings of the 26th IEEE Conference on Computer Communications, INFOCOM, 2007, pp. 373-381.
18. A. Dessmark, and A. Pelc Optimal graph exploration without good maps Theoretical Computer Science 326 1-3 2004 343 362
19. A. Ferreira Building a reference combinatorial model for MANETs IEEE Network 18 5 2004 24 29
20. P. Flocchini, M. Kellett, P. Mason, and N. Santoro Searching for black holes in subways Theory of Computing Systems 50 1 2012 158 184
21. P. Flocchini, B. Mans, N. Santoro, Exploration of periodically varying graphs, in: 20th International Symposium on Algorithms and Computation, ISAAC, 2009, pp. 534-543.
22. S. Guo, S. Keshav, Fair and efficient scheduling in data ferrying networks, in: Proceedings of the 3rd ACM International Conference on Emerging Networking Experiments and Technologies, CoNext, 2007, pp. 1-12.
23. D. Ilcinkas, A.M. Wade, On the power of waiting when exploring public transportation systems, in: Proceedings of the 15th International Conference On Principles Of Distributed Systems, OPODIS, 2011, pp. 451-464.
24. P. Jacquet, B. Mans, and G. Rodolakis Information propagation speed in mobile and delay tolerant networks IEEE Transactions on Information Theory 56 10 2010 5001 5015
25. S. Jain, K. Fall, R. Patra, Routing in a delay tolerant network, in: Proceedings of the 2004 ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, SIGCOMM, 2004, pp. 145-158.
26. D. Kempe, J. Kleinberg, and A. Kumar Connectivity and inference problems for temporal networks Journal of Computer and System Sciences 64 4 2002 820 842
27. A. Keränen, J. Ott, DTN over areal carriers, in: Proceedings of the 4th ACM Workshop on Challenged Networks, CHANTS, 2009, pp. 67-76.
28. V. Kostakos Temporal graphs Physica A 388 6 2009 1007 1023
29. A. Lindgren, A. Doria, O. Schelen, Probabilistic routing in intermittently connected networks, in: Proceedings of the 1st International Workshop on Service Assurance with Partial and Intermittent Resources, SAPIR, 2004, pp. 239-254.
30. C. Liu, and J. Wu Scalable routing in cyclic mobile networks IEEE Transactions on Parallel and Distributed Systems 20 9 2009 1325 1338
31. R. O'Dell, R. Wattenhofer, Information dissemination in highly dynamic graphs, in: Proceedings of the 3rd ACM Workshop on Foundations of Mobile Computing, DIALM-POMC, 2005, pp. 104-110.
32. CL.E. Shannon, Presentation of a maze-solving machine, in: Proc. 8th Conf. of the Josiah Macy Jr. Found. (Cybernetics), 1951, pp. 173-180.
33. T. Spyropoulos, K. Psounis, C.S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks, in: Proceedings of the ACM SIGCOMM Workshop on Delay-Tolerant Networking, 2005, pp. 252-259.
34. J. Tang, S. Scellato, M. Musolesi, C. Mascolo, and V. Latora Small-world behavior in time-varying graphs Physical Review E 81 5 2010 055101(R)
35. S. Wang, J.L. Torgerson, J. Schoolcraft, Y. Brenman, The deep impact network experiment operations center monitor and control system, in: Proceedings of the 3rd IEEE international Conference on Space Mission Challenges for information Technology, 2009, pp. 34-40.
36. X. Zhang, J. Kurose, B.N. Levine, D. Towsley, H. Zhang, Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing, in: Proceedings of the 13th annual ACM International Conference on Mobile Computing and Networking, MOBICOM, 2007, pp. 195-206.
37. Z. Zhang Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges IEEE Communication Surveys & Tutorials 8 1 2006 24 36