Time-varying graphs and dynamic networks

International Journal of Parallel, Emergent and Distributed Systems

Volumn 27, Issue 5, 2012, Pages 387-408

  Casteigts, Arnaud ^a   Flocchini, Paola ^a   Quattrociocchi, Walter ^b   Santoro, Nicola ^c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITY OF SIENA   (Italy)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

delay tolerant networks; distributed computing; dynamic graphs; opportunistic networks; social networks; time varying graphs

Indexed keywords

DELAY TOLERANT NETWORKS; DYNAMIC GRAPH; OPPORTUNISTIC NETWORKS; SOCIAL NETWORKS; TIME VARYING;

DISTRIBUTED COMPUTER SYSTEMS; SOCIAL NETWORKING (ONLINE);

TIME VARYING NETWORKS;

EID: 84867347697     PISSN: 17445760     EISSN: 17445779     Source Type: Journal    
DOI: 10.1080/17445760.2012.668546     Document Type: Conference Paper

References (73)

1. J.I. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, and A. Vespignani, K-core decomposition of internet graphs: Hierarchies, self-similarity and measurement biases, Netw. Heterog. Media 3(2) (2008), pp. 371-393.
2. D. Angluin, J. Aspnes, Z. Diamadi, M. Fischer, and R. Peralta, Computation in networks of passively mobile finite-state sensors, Distrib. Comput. 18(4) (2006), pp. 235-253.
3. D. Angluin, J. Aspnes, D. Eisenstat, and E. Ruppert, The computational power of population protocols, Distrib. Comput. 20(4) (2007), pp. 279-304. (Pubitemid 350005918)
4. C. Avin, M. Koucky, and Z. Lotker, How to Explore a Fast-Changing World, Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP), Springer, Reykjavik, Iceland, 2008, pp. 121-132.
5. B. Awerbuch and S. Even, Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network, Proceedings of 3rd ACM symposium on Principles of Distributed Computing (PODC'84), ACM, Vancouver, Canada, 1984, pp. 278-281.
6. L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, Group Formation in Large Social Networks: Membership, Growth, and Evolution, Proceedings of 12th ACM International Conference on Knowledge Discovery and Data Mining, 2006, pp. 44-54. (Pubitemid 44535502)
7. A. Balasubramanian, Y. Zhou, B. Croft, B.N. Levine, and A. Venkataramani, Web Search from a Bus, Proceedings of 2nd ACM Workshop on Challenged Networks (CHANTS), ACM, Montreal, Canada, 2007, pp. 59-66. (Pubitemid 351203615)
8. M. Bastian, S. Heymann, and M. Jacomy, Gephi: An Open Source Software for Exploring and Manipulating Networks, Proceedings of 3rd International AAAI Conference on Weblogs and Social Media, AAAI Press, San Jose, USA, 2009.
9. H. Baumann, P. Crescenzi, and P. Fraigniaud, Parsimonious Flooding in Dynamic Graphs, Proceedings of 28th ACM Symposium on Principles of Distributed Computing, ACM, Calgary, Canada, 2009, pp. 260-269.
10. K.A. Berman, Vulnerability of scheduled networks and a generalization of Menger's theorem, Networks 28(3) (1996), pp. 125-134.
11. S. Bhadra and A. Ferreira, Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks, Proceedings of 2nd International Conference on Ad Hoc, Mobile and Wireless Networks (AdHoc-Now), Springer, Montreal, Canada, 2003, pp. 259-270.
12. V.D. Blondel, J.L. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, J. Statist. Mech. Theory Exp. 2008 (2008), p. P10008.
13. C. Boldrini and A. Passarella, HCMM: Modelling spatial and temporal properties of human mobility driven by users' social relationships, Comput. Commun. 33(9) (2010), pp. 1056-1074.
14. K. Borne, S. Sanyal, and A. Vespignani, Network science, Annu. Rev. Inf. Sci. Technol. 41 (2007), pp. 537-607.
15. B. Bui-Xuan, A. Ferreira, and A. Jarry, Computing shortest, fastest, and foremost journeys in dynamic networks, Int. J. Found. Comput. Sci. 14(2) (2003), pp. 267-285.
16. J. Burgess, B. Gallagher, D. Jensen, and B.N. Levine, Maxprop: Routing for Vehicle-Based Disruption-Tolerant Networks, Proceedings of 25th IEEE Conference on Computer Communications (INFOCOM), IEEE, Barcelona, Spain, 2006, pp. 1-11.
17. T. Camp, J. Boleng, and V. Davies, Diameter of the world-wide web, Wireless Commun. Mobile Comput. 2(5) (2002), pp. 483A -502A .
18. I. Cardei, C. Liu, and J. Wu, Routing in Wireless Networks with Intermittent Connectivity, Encyclopedia of Wireless and Mobile Communications, CRC Press, Boca Raton, USA, 2007, pp. 1-23.
19. A. Casteigts, S. Chaumette, and A. Ferreira, Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks, Proceedings of 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Springer, Piran, Slovenia, 2009, pp. 126-140, (Full version in arXiv:1102.5529).
20. A. Casteigts, P. Flocchini, B. Mans, and N. Santoro, Deterministic Computations in Time- Varying Graphs: Broadcasting Under Unstructured Mobility, Proceedings of 5th IFIP Conference on Theoretical Computer Science (TCS), Springer, Brisbane, Australia, 2010, pp. 111-124.
21. A. Casteigts, P. Flocchini, B. Mans, and N. Santoro, Measuring Temporal Lags in Delay- Tolerant Networks, Proceedings of 25th IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, Anchorage, USA, 2011, pp. 209-218.
22. A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott, Impact of human mobility on opportunistic forwarding algorithms, IEEE Transact. Mobile Comput. 6(6) (2007), pp. 606-620. (Pubitemid 46685740)
23. A. Chaintreau, A. Mtibaa, L. Massoulie, and C. Diot, The diameter of opportunistic mobile networks, Commun. Surveys Tutor. 10(3) (2008), pp. 74-88.
24. A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri, Flooding Time in Edge- Markovian Dynamic Graphs, Proceedings of 27th ACM Symposium on Principles of Distributed Computing (PODC), ACM, Toronto, Canada, 2008, pp. 213-222.
25. A. Clementi and F. Pasquale, Information spreading in dynamic networks: An analytical approach, in Theoretical Aspects of Distributed Computing in Sensor Networks, S. Nikoletseas and J. Rolim, eds., Springer, New York, USA, 2010, pp. 591-619.
26. A. Dutot, F. Guinand, D. Olivier, and Y. Pigné, Graphstream: A Tool for Bridging the Gap Between Complex Systems and Dynamic Graphs., Proceedings of Emergent Properties in Natural and Artificial Complex Systems. (EPNACS), Springer, Dresden, Germany, 2007, pp. 63-72.
27. N. Eagle and A. (Sandy) Pentland, Reality mining: Sensing complex social systems, Pers. Ubiquitous Comput. 10(4) (2006), pp. 255-268.
28. J. Eriksson, H. Balakrishnan, and S. Madden, Cabernet: Vehicular Content Delivery Using WiFi, Proceedings of 14th ACM/IEEE International Conference on Mobile Computing and Networking, ACM, San Francisco, USA, 2008, pp. 199-210.
29. A. Ferreira, Building a reference combinatorial model for MANETs, IEEE Netw. 18(5) (2004), pp. 24-29.
30. P. Flocchini, M. Kellett, P. Mason, and N. Santoro, Searching for black holes in subways, Theory Comput. Syst. 50(1) (2012), pp. 158-184.
31. P. Flocchini, B. Mans, and N. Santoro, Exploration of Periodically Varying Graphs, Proceedings of 20th International Symposium on Algorithms and Computation (ISAAC), 2009, pp. 534-543.
32. A. Friggeri, G. Chelius, and E. Fleury, Ego-munities, exploring socially cohesive person-based communities, Technical Report 7535, INRIA, Reading, United Kingdom, 2011.
33. F. Greve, L. Arantes, and P. Sens, What Model and What Conditions to Implement Unreliable Failure Detectors in Dynamic Networks?, 3rd Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), Springer, Rome, Italy, 2011.
34. P. Grindrod and M. Parsons, Social networks: Evolving graphs with memory dependent edges, Technical Report, MPS-2010-02, University of Reading, Rocquencourt, France, 2010.
35. M. Grossglauser and M. Vetterli, Locating Nodes with EASE: Last Encounter Routing in Ad Hoc Networks Through Mobility Diffusion, Vol. 3, Proceedings of 22nd Conference on Computer Communications (INFOCOM), IEEE, San Francisco, USA, 2003, pp. 1954-1964.
36. S. Guo and S. Keshav, Fair and Efficient Scheduling in Data Ferrying Networks, Proceedings of ACM Conference on Emerging Network Experiment and Technology, ACM, New York, USA, 2007, pp. 1-13.
37. F. Harary and G. Gupta, Dynamic graph models, Math. Comput. Model. 25(7) (1997), pp. 79-88.
38. P. Holme, Network reachability of real-world contact sequences, Phys. Rev. E 71(4) (2005), p. 46119.
39. W. Hsu, T. Spyropoulos, K. Psounis, and A. Helmy, Modeling Time-Variant User Mobility in Wireless Mobile Networks, Proceedings of 26th IEEE Conference on Computer Communications (INFOCOM), IEEE, Anchorage, USA, 2007, pp. 758-766. (Pubitemid 47334294)
40. D. Ilcinkas and A.M. Wade, On the Power of Waiting When Exploring Public Transportation Systems., Proceedings of 15th International Conference on Principles of Distributed Systems (OPODIS), Springer, Toulouse, France, 2011, pp. 451-464.
41. P. Jacquet, B. Mans, and G. Rodolakis, Information propagation speed in mobile and delay tolerant networks, IEEE Transact. Inf. Theory 56(10) (2009), pp. 5001-5015.
42. S. Jain, K. Fall, and R. Patra, Routing in a Delay Tolerant Network, Proceedings of Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2004, pp. 145-158.
43. E.P.C. Jones, L. Li, J.K. Schmidtke, and P.A.S. Ward, Practical routing in delay-tolerant networks, IEEE Transact. Mobile Comput. 6(8) (2007), pp. 943-959. (Pubitemid 46993992)
44. H. Kakugawa and M. Yamashita, A dynamic reconfiguration tolerant self-stabilizing token circulation algorithm in ad-hoc networks, Princ. Distrib. Syst. OPODIS (2005), pp. 256-266. (Pubitemid 41422939)
45. D. Kempe and J. Kleinberg, Protocols and Impossibility Results for Gossip-Based Communication Mechanisms, Proceedings of 43rd Symposium on Foundations of Computer Science (FOCS), IEEE, Vancouver, Canada, 2002, pp. 471-480.
46. D. Kempe, J. Kleinberg, and A. Kumar, Connectivity and Inference Problems for Temporal Networks, Proceedings of 32nd ACM Symposium on Theory of Computing (STOC), ACM, Portland, USA, 2000, pp. 504-513.
47. D. Kempe, J. Kleinberg, and E. Tardos, Maximizing the Spread of Influence Through a Social Network, Proceedings of 9th ACM International Conference on Knowledge Discovery and Data Mining (KDD), ACM, Washington, USA, 2003, pp. 137-146.
48. A. Keränen and J. Ott, DTN Over Aerial Carriers, Proceedings of 4th ACM Workshop on Challenged Networks, ACM, Beijing, China, 2009, pp. 67-76.
49. G. Kossinets, J. Kleinberg, and D. Watts, The Structure of Information Pathways in a Social Communication Network, Proceedings of 14th ACM International Conference on Knowledge Discovery and Data Mining (KDD), ACM, Las Vegas, USA, 2008, pp. 435-443.
50. V. Kostakos, Temporal graphs, Phys. A 388(6) (2009), pp. 1007-1023.
51. F. Kuhn, N. Lynch, and R. Oshman, Distributed Computation in Dynamic Networks, Proceedings of 42nd ACM Symposium on Theory of Computing (STOC), ACM, Cambridge, USA, 2010, pp. 513-522.
52. F. Kuhn, Y. Moses, and R. Oshman, Coordinated Consensus in Dynamic Networks, 30th ACM symposium on Principles of Distributed Computing (PODC), ACM, San Jose, USA, 2011, pp. 1-10.
53. J. Leskovec, D. Chakrabarti, J.M. Kleinberg, C. Faloutsos, and Z. Ghahramani, Kronecker graphs: An approach to modeling networks, J. Mach. Learn. Res. 11 (2010), pp. 985-1042.
54. J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Transact. Knowl. Discov. Data 1(1) (2007).
55. A. Lindgren, A. Doria, and O. Schelén, Probabilistic routing in intermittently connected networks, Mobile Comput. Commun. Rev. 7(3) (2003), pp. 19-20.
56. I. Litovsky, Y. Métivier, and E. Sopena, Graph relabelling systems and distributed algorithms, in Handbook of Graph Grammars and Computing by Graph Transformation, H. Ehrig, H.J. Kreowski, U. Montanari, and G. Rozenberg, eds., World Scientific Publishing, London, England, 1999, pp. 1-53.
57. C. Liu and J. Wu, Scalable routing in cyclic mobile networks, IEEE Transact. Parallel Distrib. Syst. 20(9) (2009), pp. 1325-1338.
58. Y. Mahéo, R. Said, and F. Guidec, Middleware Support for Delay-Tolerant Service Provision in Disconnected Mobile Ad Hoc Networks, Proceedings of 22nd IEEE Parallel and Distributed Processing Symposium (IPDPS), IEEE, Miami, USA, 2008, pp. 1-6.
59. R. O'Dell and R. Wattenhofer, Information Dissemination in Highly Dynamic Graphs, Proceedings of Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), ACM, Cologne, Germany, 2005, pp. 104-110. (Pubitemid 44030737)
60. M. Papadopouli and H. Schulzrinne, Seven Degrees of Separation in Mobile Ad Hoc Networks, Vol. 3, Proceedings of IEEE Global Communication Conference (GLOBECOM), IEEE, San Francisco, USA, 2000, pp. 1707-1711. (Pubitemid 32137350)
61. R. Ramanathan, P. Basu, and R. Krishnan, Towards a Formalism for Routing in Challenged Networks, Proceedings of 2nd ACM Workshop on Challenged Networks (CHANTS), ACM, Montreal, Canada, 2007, pp. 3-10. (Pubitemid 351203608)
62. F.J. Ros, P.M. Ruiz, and I. Stojmenovic, Acknowledgment-based broadcast protocol for reliable and efficient data dissemination in vehicular ad-hoc networks, IEEE Transact. Mobile Comput. 11(1) (2012), pp. 33-46.
63. P. Ruiz, B. Dorronsoro, P. Bouvry, and L. Tardón, Information Dissemination in VANETs Based upon a Tree Topology, Ad Hoc Netw. 10(1) (2012), pp. 111-127.
64. N. Santoro, W. Quattrociocchi, P. Flocchini, A. Casteigts, and F. Amblard, Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics, 3rd AISB Social Networks and Multiagent Systems Symposium (SNAMAS), York, England, 2011, pp. 32-38.
65. A. Scherrer, P. Borgnat, E. Fleury, J.L. Guillaume, and C. Robardet, Description and simulation of dynamic mobility networks, Comput. Netw. 52(15) (2008), pp. 2842-2858.
66. T. Spyropoulos, K. Psounis, and C.S. Raghavendra, Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks, Proceedings of ACM Workshop on Delay-Tolerant Networking, ACM, Philadelphia, USA, 2005, pp. 252-259. (Pubitemid 41832984)
67. J. Tang, M. Musolesi, C. Mascolo, and V. Latora, Characterising temporal distance and reachability in mobile and online social networks, ACM Comput. Commun. Rev. 40(1) (2010), pp. 118-124.
68. J. Tang, M. Musolesi, C. Mascolo, V. Latora, and V. Nicosia, Analysing Information Flows and Key Mediators Through Temporal Centrality Metrics, Proceedings of the 3rd Workshop on Social Network Systems, ACM, New York, USA, 2010, pp. 1-6.
69. J. Tang, S. Scellato, M. Musolesi, C. Mascolo, and V. Latora, Small-world behavior in time-varying graphs, Phys. Rev. E 81(5) (2010), p. 55101.
70. S. Wang, J.L. Torgerson, J. Schoolcraft, and Y. Brenman, The Deep Impact Network Experiment Operations Center Monitor and Control System, Proceedings of 3rd IEEE international Conference on Space Mission Challenges For information Technology, IEEE, Pasadena, USA, 2009, pp. 34-40.
71. M. Yamashita and T. Kameda, Computing on anonymous networks: Parts I and II, IEEE Transact. Parallel Distrib. Syst. 7(1) (1996), pp. 69-96.
72. X. Zhang, J. Kurose, B.N. Levine, D. Towsley, and H. Zhang, Study of a Bus-Based Disruption- Tolerant Network: Mobility Modeling and Impact on Routing, Proceedings of 13th ACM International Conference on Mobile Computing and Networking, ACM, Montreal, Canada, 2007, pp. 195-206.
73. Z. Zhang, Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges, IEEE Commun Surveys Tutor. 8(1) (2006), pp. 24-37.