Team : NPA
Departure date : 01/31/2014
Supervision : Marcelo DIAS DE AMORIM
Properties and impact of vicinity in mobile opportunistic networks
The market of mobile devices, such as smartphones, tablets, game stations, or laptops has exponentially grown over the latest years. When people carry such equipments along their daily commuting, they become mobile information vectors. They are able to carry, send, or receive information whenever they meet each other. The networking paradigm using such information vectors is known as disruption-tolerant networks (DTN) or opportunistic networks. Even if some of their properties are quite well known today, the relationship between a given node and its vicinity has not been thoroughly studied yet. In this thesis, we show how this closeness notion is a key ingredient to improve opportunistic network forwarding. We begin by identifying and investigating the binary assertion issue in opportunistic networks. We notice how most DTNs mainly analyze nodes that are in contact (at a topological 1-hop distance). This vision implies that all nodes that are not in contact, are in intercontact. Nevertheless, when two nodes are not in contact, this does not mean that they are topologically far away from one another. For instance, a 2- or 3-hop path may link them. Following this chain of thoughts, we propose a formal definition of vicinities in DTNs called "k-vicinity" and study the new resulting "contact/intercontact" temporal characterization. We show how extended temporal distributions differ from previous binary distributions. Then, we examine the internal organization of vicinities using the asynchronous vicinity motion (AVM) framework. We highlight movement types such as birth, death, and sequential moves. We analyze a number of their characteristics and extract vicinity usage directions for mobile networks. Based on the vicinity motion outputs and extracted directions, we build TiGeR (a synthetic TImeline GEneratoR) that simulates how pairs of nodes interact within their vicinities. Vicinity motion and TiGeR are able to take into account various types of networks to generate synthetic vicinity behaviors following similar patterns.
Finally, we inquire about the possibilities of vicinity distance prediction. We expose a vicinity motion-based heuristic for pairwise shortest distance forecasting. We find that our heuristics perform quite well with performances up to 99% for the synchronous vicinity motion-based scheme and around 40% for the asynchronous one. We must note that these measures are enhanced by the fact that our heuristic often predicts infinite pairwise distances (i.e., pure intercontact) and most of the datasets we observe are mainly disconnected. Still, they are interesting indicators of whether two nodes are likely to be close in the future.
Defence : 01/23/2014 - 14h00 - Site Jussieu 25-26/105 Jury members : André-Luc BEYLOT, IRIT/ENSEEIHT [Rapporteur]
Emmanuel LOCHIN, ISAE [Rapporteur]
Aline CARNEIRO VIANA, INRIA
Vania CONAN, Thales Communications & Security
Anne FLADENMULLER, UPMC Sorbonne Universités
Vincent GAUTHIER, Telecom Sud Paris
Marcelo DIAS DE AMORIM, CNRS & UPMC Sorbonne Universités
T. Phe‑Neau, M. Dias de Amorim, Miguel Elias M. Campista, V. Conan : “Examining Vicinity Dynamics in Opportunistic Networks”, ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems (ACM MSWiM), Barcelone, Spain, pp. 153-160, (ACM) (2013)
T. Phe‑Neau, M. Dias de Amorim, V. Conan : “Vicinity-based DTN Characterization”, The Third International Workshop on Mobile Opportunistic Networks (MobiOpp '12), Zurich, Switzerland, pp. 37-44, (ACM) (2012)