Multimedia contents dissemination with gossip algorithms in distributed social networks

Authors:
Bo Yang;Guangxi Zhu;Weimin Wu
Affiliations:
Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China;Huazhong University of Science and Technology, Wuhan, China
Venue:
Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service
Year:
2013

Citing 9
Cited 0

Towards an Efficient Method for Spreading Information in Social Network

AMS '09 Proceedings of the 2009 Third Asia International Conference on Modelling & Simulation
SocioNet: A Social-Based Multimedia Access System for Unstructured P2P Networks

IEEE Transactions on Parallel and Distributed Systems
Social Multimedia Computing

Computer
Peer-to-peer based multimedia distribution service

IEEE Transactions on Multimedia
Game-Theoretic Strategies and Equilibriums in Multimedia Fingerprinting Social Networks

IEEE Transactions on Multimedia
Randomized gossip algorithms

IEEE Transactions on Information Theory
Device-to-device communication as an underlay to LTE-advanced networks

IEEE Communications Magazine
The Impact of Mobility on Gossip Algorithms

IEEE Transactions on Information Theory
Social Multimedia Signals: Sense, Process, and Put Them to Work

IEEE MultiMedia

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the dissemination of multimedia contents in distributed social networks, which are composed of a set of smart handsets. Gossip algorithms are used to spread social multimedia contents in a decentralized way with robustness and simplicity. The performance of gossip algorithms is analyzed and an upper bound on the convergence time is obtained. Simulation results show that each user requires only about 12 iterations on average to obtain 100 contents in the network and the communication cost for each user does not grow when the scale of the network becomes larger. The dynamic topology of the network due to mobility is considered as well, which is proved to be able to significantly reduce the communication cost.