An Information Propagation Model for Instant Messaging with Group

Abstract:

In this article, an information propagation model for instant messaging with group is constructed to research the group influence on information propagation in instant messaging network. The feature of group is if a group member propagates a message in a group, the other members in the same group will have a chance to receive this message. There are 4 kinds of nodes in instant messaging network: 1, N₀, hasn’t received the message; 2, N₁, has received the message, but hasn’t opened it yet; 3, N₂, has opened the message, but hasn’t retransmitted it yet; 4,N₃, has already opened the message and has retransmitted the message. When a message is propagated into the network, the group influence on information propagation in instant messaging network is revealed by changing the size of each group and the number of groups. The conclusion: the information propagation efficiency of instant messaging network with group is much higher than normal instant messaging network. When the size of each group is very small and the number of groups is very little, the influence of them on information propagation is not very obvious. With the growth of the size of each group and the number of groups, the information propagation is more and more widely and quickly.

• Periodical: Applied Mechanics and Materials (Volumes 556-562)
• Pages: 5436-5441
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.556-562.5436
• Online since: May 2014
• Authors: Feng Ding*, Zhi Han Yu, Cui Cui Hao, Zhi Jun Li
• Keywords: Group, Information Propagation, Instant Messaging, MATLAB, Small-Word Networks

References

[1] C. -S. Tsai and B. -F. Shen, Online reverse auctions via wireless instant message networks, inITS Telecommunications Proceedings, 2006 6th International Conference on. IEEE, 2006, p.131–135.

DOI: 10.1109/itst.2006.288797

[2] J. D. Herbsleb, D. L. Atkins, D. G. Boyer, M. Handel, and T. A. Finholt, Introducing instant messaging and chat in the workplace, in Proceedings of the SIGCHI conference on Human factors in computing systems. ACM, 2002, p.171–178.

DOI: 10.1145/503376.503408

[3] M. Gu, L. Shen, R. Gu, and B. Xu, Collaboration using instant messaging tool: A chat log analysis, in Information and Communication Technologies (WICT), 2012 World Congress on. IEEE, 2012, p.1025–1030.

DOI: 10.1109/wict.2012.6409225

[4] M. dos Santos Galli, D. Rosenberg, et al., System and method for seamlessly bringing external services into instant messaging session, Jan. 11 2011, uS Patent 7, 870, 199.

[5] J. Leskovec, M. McGlohon, C. Faloutsos, N. Glance, and M. Hurst, Information propagation and network evolution on the web, DA Project, Machine Learning Dept. Carnegie Mellon University, (2009).

[6] I. Schoen and M. Boberski, Secure instant messaging system using instant messaging group policy certificates, Jan. 22 2008, uS Patent 7, 321, 969.

[7] S. Milgram, The small world problem, Psychology today, vol. 2, no. 1, p.60–67, (1967).

[8] D. J. Watts and S. H. Strogatz, Collective dynamics ofsmall-worldnetworks, nature, vol. 393, no. 6684, p.440–442, (1998).

DOI: 10.1038/30918

[9] M. E. Newman and D. J. Watts, Renormalization group analysis of the small-world network model, Physics Letters A, vol. 263, no. 4, p.341–346, (1999).

DOI: 10.1016/s0375-9601(99)00757-4

[10] A. -L. Barab´asi, R. Albert, and H. Jeong, Mean-field theory for scale-free random networks, Physica A: Statistical Mechanics and its Applications, vol. 272, no. 1, p.173–187, (1999).

DOI: 10.1016/s0378-4371(99)00291-5

[11] R. L. Urquhart, D. J. Schell, and V. M. Urquhart, Confirmation system and method for instant messaging, May 12012, uS Patent 8, 171, 416.