État académique
Thèse soutenue le 2012-04-12
Sujet: Capacité des Réseaux Opportunistes: Caractérisation et Impact sur la Dissémination de Larges Contenus
Direction de thèse:
Ellipse bleue: doctorant, ellipse jaune: docteur, rectangle vert: permanent, rectangle jaune: HDR. Trait vert: encadrant de thèse, trait bleu: directeur de thèse, pointillé: jury d'évaluation à mi-parcours ou jury de thèse.
Productions scientifiques
PACS: Chopping and Shuffling Large Contents for Faster Opportunistic Dissemination
Proceedings of IFIP/IEEE WONS (WONS), Bardonecchia, Italy 2011
Contact surround in opportunistic networks
Proceedings of the IEEE 21st International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2010, 26-29 September 2010, Istanbul, Turkey 2010
Intégration d'un indicateur de proximité dans les mesures de contact
cfip, Strasbourg, France 2009
PePiT: Opportunistic Dissemination of Large Contents on Android Mobile Devices
We demonstrate the design and implementation of PePit, an Android application to disseminate large media contents among mobile users. \pepit is an instantiation of the Prevalence-Aware Content Spreading (PACS) protocol, which enables a more efficient use of the communication opportunities between devices by slicing large contents into small chunks that better fit into shorter contacts.
ACM MobiOpp workshop Demo Sessionproceeding, seminar, workshop without peer review 2012-03-15
PACS: Chopping and shuffling large contents for faster opportunistic dissemination
A common assumption in intermittently-connected (or opportunistic) mobile networks is that any contact has enough capacity to transfer the required amount of data. Although such an assumption is reasonable for analytical purposes and when contents are small, it does not hold anymore when nodes produce contents that are larger than the capacity of a contact. In such a case, nodes must slice data and send fragments separately, which allows better use of short contacts and progressive dissemination of large contents data pieces. The question here is to design the best strategy for deciding which piece(s) to transmit whenever nodes meet. In this paper, we present the design and evaluation of PACS (Prevalence-Aware Content Spreading), a completely distributed algorithm that selects pieces to transfer based on their popularity. We evaluate the performance of PACS using both synthetic and real traces from intermittently-connected networks. When compared with sequential and randomized solutions, we show that PACS significantly outperforms these approaches both in terms of latency to achieve full dissemination and ratio of effective contacts. Moreover, PACS achieves performance levels that are extremely close to a centralized version based on an oracle.
2011 Eighth International Conference on Wireless On-Demand Network Systems and Services (WONS 2011) 2011 Eighth International Conference on Wireless On-Demand Network Systems and Services (WONS 2011)proceeding with peer review 2011
Contact Surround in Opportunistic Networks
Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant results concerning contact and inter-contact distributions. Nevertheless, only the temporal dimension does not give a complete overview of contact characterization. In this paper, we propose the surround indicator as a metric to exhibit the contact's surrounding environment in opportunistic networks. We evaluate the surround indicator on two existing datasets and show that contacts have too heterogeneous and too unstable surrounds to be considered only in terms of duration. Besides a large variability of the surrounding environment within the duration of a single contact, it is frequent to observe contacts of identical duration that exhibit differences in their surrounds of more than a hundred times.
IEEE PIMRC 2010 Mobile and Wireless Networks (PIMRC 2010 Track 3) IEEE PIMRC 2010 Mobile and Wireless Networks (PIMRC 2010 Track 3)proceeding with peer review 2010
Thèse: Capacité des Réseaux Opportunistes: Caractérisation et Impact sur la Dissémination de Contenus Volumineux
Soutenance: 2012-04-12
Rapporteurs: Thierry TURLETTI    André-Luc BEYLOT