Connectivity in time-graphs

Dynamic networks are characterized by topologies that vary with time and are represented by time-graphs. The notion of connectivity in time-graphs is fundamentally different from that in static graphs. End-to-end connectivity is achieved opportunistically by the store-carry-forward paradigm if the network is so sparse that source-destination pairs are usually not connected by complete paths. In static graphs, it is well known that the network connectivity is tied to the spectral gap of the underlying adjacency matrix of the topology: if the gap is large, the network is well connected. In this paper, a similar metric is investigated for time-graphs. To this end, a time-graph is represented by a 3-mode reachability tensor which indicates whether a node is reachable from another node in t steps. To evaluate connectivity, we consider the expected hitting time of a random walk, and the time it takes for epidemic routing to infect all vertices. Observations from an extensive set of simulations show that the correlation between the second singular value of the matrix obtained by unfolding the reachability tensor and these indicators is very significant.

[1]  Céline Robardet,et al.  Communities detection and analysis of their dynamics in collaborative networks , 2007, 2007 2nd International Conference on Digital Information Management.

[2]  Afonso Ferreira,et al.  Building a reference combinatorial model for MANETs , 2004, IEEE Network.

[3]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[4]  N. Limnios,et al.  Hitting time in a finite non-homogeneous Markov chain with applications , 1998 .

[5]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[6]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[7]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[8]  Alhussein A. Abouzeid,et al.  Optimizing random walk search algorithms in P2P networks , 2007, Comput. Networks.

[9]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[10]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[11]  Alhussein A. Abouzeid,et al.  Random walks in time-graphs , 2010, MobiOpp '10.

[12]  A. Barabasi,et al.  Quantifying social group evolution , 2007, Nature.

[13]  Gene H. Golub,et al.  Rank-One Approximation to High Order Tensors , 2001, SIAM J. Matrix Anal. Appl..

[14]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[15]  Petros Drineas,et al.  Tensor-CUR decompositions for tensor-based data , 2006, KDD '06.

[16]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[17]  Scott Shenker,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[18]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[19]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[20]  Tamara G. Kolda,et al.  Orthogonal Tensor Decompositions , 2000, SIAM J. Matrix Anal. Appl..

[21]  Céline Robardet,et al.  Description and simulation of dynamic mobility networks , 2008, Comput. Networks.

[22]  D. Leibovici,et al.  A singular value decomposition of a k-way array for a principal component analysis of multiway data, PTA-k , 1998 .

[23]  Ravi Kumar,et al.  On the Bursty Evolution of Blogspace , 2003, WWW '03.

[24]  Alhussein A. Abouzeid,et al.  Weak State Routing for Large-Scale Dynamic Networks , 2007, IEEE/ACM Transactions on Networking.

[25]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[26]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.