ONSIDE: Socially-aware and interest-based dissemination in opportunistic networks

Radu Ioan Ciobanu, Radu Corneliu Marin, Ciprian Dobre, Valentin Cristea, Constandinos X. Mavromoustakis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

42 Citations (Scopus)

Abstract

Data dissemination in opportunistic networks poses a series of challenges, since there is no central entity aware of all the nodes' subscriptions. Each individual node is only aware of its own interests and those of a node that it is contact with, if any. Thus, dissemination is generally performed using epidemic algorithms that flood the network, but they have the disadvantage that the network overhead and congestion are very high. In this paper, we propose ONSIDE, an algorithm that leverages a node's online social connections (i.e. friends on social networks such as Facebook or Google+), its interests and the history of contacts, in order to decrease congestion and required bandwidth, while not affecting the overall network's hit rate and the delivery latency. We present the results of testing our algorithm using an opportunistic network emulator and three mobility traces taken in different environments.

Original languageEnglish
Title of host publicationIEEE/IFIP NOMS 2014 - IEEE/IFIP Network Operations and Management Symposium
Subtitle of host publicationManagement in a Software Defined World
PublisherIEEE Computer Society
ISBN (Print)9781479909131
DOIs
Publication statusPublished - 2014
EventIEEE/IFIP Network Operations and Management Symposium: Management in a Software Defined World, NOMS 2014 - Krakow, Poland
Duration: 5 May 20149 May 2014

Other

OtherIEEE/IFIP Network Operations and Management Symposium: Management in a Software Defined World, NOMS 2014
Country/TerritoryPoland
CityKrakow
Period5/05/149/05/14

Fingerprint

Dive into the research topics of 'ONSIDE: Socially-aware and interest-based dissemination in opportunistic networks'. Together they form a unique fingerprint.

Cite this