Article ID Journal Published Year Pages File Type
450061 Computer Communications 2013 23 Pages PDF
Abstract

This paper deals with the problem of identifying and managing overlay topologies in opportunistic networks. To make this possible, we define the concept of “link” in an opportunistic network, which cannot be represented as a simple communication connection between two nodes at a given instant (as in classic MANETs). Rather, links represent contacts among nodes arising during a (non-instantaneous) time interval. With this definition in view, opportunistic networks can be seen as evolving graphs. The interesting thing is that it becomes possible to control the way nodes manage contacts and build overlays based on some desired overlay topology. This is an important result, since the statistical characteristics of the topology allow estimating the ability of the opportunistic network to spread contents. An experimental assessment based on a trace-driven simulation employing different types of datasets (ranging from urban dense networks to very sparse ones) confirms the viability of the proposed approach.

► Opportunistic networks are modeled evolving graphs where links correspond to active contacts during a time interval. ► A simple scheme is presented to shape the opportunistic network, based on some desired topology. ► We experiment with three real data-traces representing different opportunistic networks.

Related Topics
Physical Sciences and Engineering Computer Science Computer Networks and Communications
Authors
,