In this paper, the problem of broadcasting multiple
messages from one user to many users. Each user can
communicate with all other users by exchanging message, video,
audio, images or any other file with it. In this paper we
communicate overhead of gossip-based information. We
communicate in a large n-user wireless network in which k user
wish to share information with all other user. Gossiping has been
widely regarded as simple and efficient method to improve
quality of service in large scale wireless network. Gossip is a
power paradigm in distributed computing. Gossip algorithm
spread messages obliviously without centralized control or
management with remarkable speed and with inherent fault
tolerance. We investigate the dissemination of information or
data in large wireless network where user contacts with each
other in a random uncoordinated manner. While transferring data
from one user to another user, we apply encryption and
decryption over the data.
Sanjiwani Gugale : Department of Computer Engineering, Savitribai Phule Pune University, Pune
Pune, Maharashtra, India
Rupali Dhone : Department of Computer Engineering, Savitribai Phule Pune University, Pune
Pune, Maharashtra, India
Datta Khedakar : Department of Computer Engineering, Savitribai Phule Pune University, Pune
Pune, Maharashtra, India
Gossip Algorithms
Information Dissemination
Probabilistic Broadcasting
Wireless Random Network
Mobility
Here, we design a simple distributed gossip style protocol
that achieves near optimal spreading rate for multiple
message dissemination using the mobility. And even with
the limited degree of velocity in mobile networks. We can
transfer messages i.e. text as well as files, images, audio
and videos. And here we apply encryption and decryption
while sending and receiving messages, files etc to one user
to multiple users. We design a simple distributed gossip
style protocol, in which we transfer the messages or
information from one user to multiple users through
wireless network i.e. wifi and with the assistance of
mobility.
[1] IEEE transactions on information theory vol:59 no:6
year 2013, “On The Role of Mobility for multimessage
Gossip”, Yuxin Chen, Sanjay Shakkottai and
Jeffrey G. Andrews.
[2] IEEE INFOCOM 2011 “Sharing Multiple Messages
over Mobile Networks”, Yuxin Chen, Sanjay
Shakkottai and Jeffrey G. Andrews.
[3] the 41st Annual Symposium on Foundations of
Computer Science, pp. 565–574, 2000.“Randomized
rumor spreading,” R. Karp, S. Shenker, C.
Schindelhauer, and B. Vocking.
[4] J. Tsitsiklis, Problems in decentralized decision making
and computation, MIT, PhD dissertation, LIDS,
Cambridge, 1984. [5] IEEE Transactions on Information Theory, vol. 56, no.
1, pp. 634 –647, January 2010.K. Jung, J. Shin, and D.
Shah, “Distributed averaging via lifted chains”.
[6] ACM SIGMETRICS, pp. 27–38, 2006. E.Modiano, G.
Zussman, and D. Shah, “Maximizing throughput in
wireless networks via gossiping”.
[7] ACM/IEEE Transactions on Networking, vol. 18, no.
2, pp. 638–51, Apr. 2010. A. Eryilmaz, E. Modiano, D.
Shah, and A. Ozdaglar, “Distributed cross layer
algorithms for the optimal control of multihop wireless
networks”.
[8] IEEE Transactions vol. 3, no. 1, pp. 1–125, April 2009.
D. Shah, “Gossip algorithms,” Trends and Foundations
in Networking”.
[9] IEEE Transactions on Information Theory, vol. 53, no.
12,pp. 4640–4654, Dec. 2007. S. Sanghavi, B. Hajek,
and L. Massoulie, “Multiple messages with
Gossiping”.
[10] Revised 21 October 2013; Accepted 22 October 2013
Gang Wang, 1 Zun Lin,1 Wenyang Guan,2 and
FengWang "The Performance of Multimessage
Algebraic Gossip in a Random Geometric Graph”.
[11] IEEE transactions, vol. 52, no. 6, June 2006 S. Boyd,
Fellow, IEEE, A. Ghosh, Student Member, IEEE, B.
Prabhakar, Member, IEEE, and D. Shah “Randomized
Gossip Algorithms”.
[12] IEEE transactions on information theory, vol. 53, no.
12, December 2007. S. Sanghavi, Member, IEEE, B.
Hajek, Fellow, IEEE, and L. Massoulie,” Gossiping
With Multiple Messages”.
[13] IEEE Transactions, Supratim Deb and Muriel M´edard
Laboratory for Information & Decision Systems
Massachusetts Institute of Technology Cambridge,”
Algebraic Gossip.
