Information dissemination in mobile social networks with gossip algorithms
by Bo Yang; Demin Liu; Wenfeng Zhang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 21, No. 4, 2016

Abstract: This paper studies the information dissemination problem in the mobile social network, which comprises a set of smart phones and works in a distributed manner. Gossip algorithms are used to spread information over the mobile social network with simplicity and robustness. Two typical scenarios of information dissemination are analysed. The corresponding upper bounds on the convergence time are derived, which show the relationship between mobility of users and convergence rate of gossip algorithms. The performances of gossip algorithms are examined in both scenarios. Simulation results indicate that the growth of communication cost is almost linear when the scale of mobile social networks becomes larger, which is a quite encouraging result for application.

Online publication date: Thu, 05-May-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com