Authors: Bo Yang; Demin Liu; Wenfeng Zhang
Addresses: Nanjing Research Institute of Electronics Engineering (NRIEE), Nanjing 210007, China ' Nanjing Research Institute of Electronics Engineering (NRIEE), Nanjing 210007, China ' Nanjing Research Institute of Electronics Engineering (NRIEE), Nanjing 210007, China
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.
Keywords: information dissemination; mobile networks; social networks; gossip algorithms; random walk; smartphones; distributed systems; simulation.
International Journal of Ad Hoc and Ubiquitous Computing, 2016 Vol.21 No.4, pp.259 - 265
Available online: 05 May 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article