Path sampling : a robust alternative to gossiping for opportunistic network routing - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Path sampling : a robust alternative to gossiping for opportunistic network routing

Résumé

Opportunistic Networks have been designed for transmitting data in difficult environments, characterized by high mobility, sporadic connectivity, and constrained resources. To sustain these networks, the literature describes methods such as Epidemic and Spra & Wait, which do not learn from the network behaviour, and Gossiping-based algorithms that collect historical network data to improve efficiency. In this paper, we show that Gossiping-based solutions suffer from pathological behaviour in some simple network scenarios. Under certain conditions almost all the data transmitted by some nodes may get lost in the network, not reaching its destination. To address this problem we have proposed an algorithm that responds in a more robust manner while staying relatively simple. In this work, we show that our algorithm achieves delivery rates comparable to gossiping-based algorithms, while being more robust and providing better fairness. To illustrate this result, we test native implementations of our solution, Path Sampling, and related algorithms on a network simulator

Mots clés

Fichier non déposé

Dates et versions

hal-01433849 , version 1 (13-01-2017)

Identifiants

Citer

Jorge Visca, Javier Ernesto Baliosian, Raul Armando Fuentes Samaniego, Ana Rosa Cavalli. Path sampling : a robust alternative to gossiping for opportunistic network routing. WIMOB 2016 : 12th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, Oct 2016, New York, United States. pp.1 - 8, ⟨10.1109/WiMOB.2016.7763244⟩. ⟨hal-01433849⟩
87 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More