Distributed Online Social Networks (DOSNs) do not rely on a central repository for storing social data so that the users can keep control of their private data and do not depend on the social network provider. The ego network, i.e. the network made up of an individual, the ego, along with all the social ties she has with other people, the alters, may be exploited to define distributed social overlays and dissemination protocols. In this paper we propose a new epidemic protocol able to spread social updates in Dunbar-based DOSN overlays where the links between nodes are defined by considering the social interactions between users. Our approach is based on the notion of Weighted Ego Betweenness Centrality (WEBC) which is an egocentric social measure approximating the Betweenness Centrality. The computation of the WEBC exploits a weighted graph where the weights correspond to the tie strengths between the users so that nodes having a higher number of interactions are characterized by a higher value of the WEBC. A set of experimental results proving the effectiveness of our approach is presented.

Epidemic Diffusion of Social Updates in Dunbar Based DOSN

De Salve, Andrea;Guidi, Barbara;Ricci, Laura
2014-01-01

Abstract

Distributed Online Social Networks (DOSNs) do not rely on a central repository for storing social data so that the users can keep control of their private data and do not depend on the social network provider. The ego network, i.e. the network made up of an individual, the ego, along with all the social ties she has with other people, the alters, may be exploited to define distributed social overlays and dissemination protocols. In this paper we propose a new epidemic protocol able to spread social updates in Dunbar-based DOSN overlays where the links between nodes are defined by considering the social interactions between users. Our approach is based on the notion of Weighted Ego Betweenness Centrality (WEBC) which is an egocentric social measure approximating the Betweenness Centrality. The computation of the WEBC exploits a weighted graph where the weights correspond to the tie strengths between the users so that nodes having a higher number of interactions are characterized by a higher value of the WEBC. A set of experimental results proving the effectiveness of our approach is presented.
2014
978-3-319-14324-8
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/585670
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 10
social impact