Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
The diameter of opportunistic mobile networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
IEEE Transactions on Mobile Computing
Know thy neighbor: towards optimal mapping of contacts to social graphs for DTN routing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Efficient social-aware content placement in opportunistic networks
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks
IEEE Transactions on Mobile Computing
| Hi-index | 0.00 |
The exploitation of social context for routing data in opportunistic networks is a relatively recent trend. Node centrality metrics, such as the betweenness centrality, quantify the relaying utility of network nodes and inform routing decisions, resulting in better performance than more naive routing approaches. Nevertheless,centrality-based routing is far from optimal for three main reasons: a) routing decisions are greedy and message destination-agnostic; b) its performance is highly sensitive to the contact graph over which the node centrality values are computed; c) the global network centrality values have for practical reasons to be approximated by their egocentric counterparts. Our paper experimentally assesses the impact of these three factors on the efficacy of centrality-based routing. Five centrality-based routing variants are compared with each other and against two schemes representing extreme instances of DTN routing complexity: the simple probabilistic forwarding protocol and an ideal scheme with perfect knowledge of future contacts that computes optimal message space-time paths over a novel graph construct with contacts as vertices and time-weighted edges. The results of this comparison are not always inline with intuition and indicate inherent weaknesses of centrality-based routing.