S. Bayhan, E. Hyytiä, J. Kangasharju and J. Ott, Analysis of Hop Limit in Opportunistic Networks by Static and Time-Aggregated Graphs, in IEEE International Conference on Communications (ICC'15), 2015, London, UK.
Abstract: We examine how the paths between any two nodes in a mobile opportunistic network change with increasing number of hops a message can follow. At the core of our analysis is the all hops optimal path (AHOP) problem. We represent the total delay of a route from a source node to a destination node as additive weight and use the number of encounters as a representation of bottleneck weight. First, we construct a static (contact) graph from the meetings recorded in a human contact trace and then analyze the change in these two weights with increasing number of hops. As an alternative approach, we aggregate all the contact events in a time interval and construct several time-aggregated graphs over which we calculate the capacity metrics. Although, we observe differences in the properties of the static and the time-aggregated graphs (e.g., higher connectivity and average degree in static graph), our analysis shows that second hop brings most of the benefits of multi-hop routing for the studied networks. However, the optimal paths --path that provides the most desirable bottleneck/additive weight-- are achieved at further hops, e.g, hop count about 4. Our finding, which is also verified by simulations, is paramount as it puts an upper bound on the hop count for the hop-restricted routing schemes by discovering the optimal hop count for both additive and bottleneck weights.
Links:
BibTeX entry:
@inproceedings{bayhan-icc-2015,
title = {Analysis of Hop Limit in Opportunistic Networks by Static and Time-Aggregated Graphs},
author = {Suzan Bayhan and Esa Hyyti{\"a} and Jussi Kangasharju and J{\"o}rg Ott},
booktitle = {{IEEE} International Conference on Communications {(ICC'15)}},
month = {Jun.},
year = {2015},
address = {London, UK},
doiopt = {10.1109/ICC.2015.7248831},
}