Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Connectivity and inference problems for temporal networks
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
A community based mobility model for ad hoc network research
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Impact of Human Mobility on Opportunistic Forwarding Algorithms
IEEE Transactions on Mobile Computing
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Characterizing pairwise inter-contact patterns in delay tolerant networks
Proceedings of the 1st international conference on Autonomic computing and communication systems
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
IEEE Transactions on Mobile Computing
Characterising temporal distance and reachability in mobile and online social networks
ACM SIGCOMM Computer Communication Review
Characterising aggregate inter-contact times in heterogeneous opportunistic networks
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part II
Time-varying graphs and dynamic networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Density-Aware Routing in Highly Dynamic DTNs: The RollerNet Case
IEEE Transactions on Mobile Computing
Mobile Data Offloading through Opportunistic Communications and Social Participation
IEEE Transactions on Mobile Computing
Mathematical and Computer Modelling: An International Journal
Algorithms for channel assignment in mobile wireless networks using temporal coloring
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
| Hi-index | 0.00 |
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvious counterpart in time-varying ones. In this paper, we introduce the notion of temporal reachability graphs. A (tau,delta)-reachability graph is a time-varying directed graph derived from an existing connectivity graph. An edge exists from one node to another in the reachability graph at time t if there exists a journey (i.e., a spatiotemporal path) in the connectivity graph from the first node to the second, leaving after t, with a positive edge traversal time tau, and arriving within a maximum delay delta. We make three contributions. First, we develop the theoretical framework around temporal reachability graphs. Second, we harness our theoretical findings to propose an algorithm for their efficient computation. Finally, we demonstrate the analytic power of the temporal reachability graph concept by applying it to synthetic and real-life datasets. On top of defining clear upper bounds on communication capabilities, reachability graphs highlight asymmetric communication opportunities and offloading potential.