Seed-Based Data Dissemination in Campus MSNets

被引：0
|
作者：
Wang Q.-S. [1 ,2 ]
Tang Y. [1 ]
Wang Q. [1 ,2 ]
Wang D. [1 ]
Chen L.-J. [1 ]
机构：
[1] School of Mathematics, Hefei University of Technology, Hefei
[2] Key Laboratory for Novel Software Technology, Nanjing University, Nanjing
来源：
| 1600年 / Beijing University of Posts and Telecommunications卷 / 40期
关键词：
Data dissemination; Mobile social networks; Network overhead; Student schedule;
D O I：
10.13190/j.jbupt.2017.02.016
中图分类号：
学科分类号：
摘要：
In mobile social networks (MSNets), the packet is propagated through the intermittently connectivity which is established when two human-carried wireless-enabled devices are within communication range of each other. In order to use the intermittently connectivity to disseminate the packet, a seed-based data dissemination (SDD) algorithm was proposed in campus MSNets. The main idea is to choose a seed node for each community and use the seed node in data dissemination. Simulations show that, compared with the Epidemic algorithm, the publish/subscribe system and social groups based routing, SDD algorithm could reduce network overhead significantly, and near to the maximum delivery ratio obtained by the Epidemic algorithm. © 2017, Editorial Department of Journal of Beijing University of Posts and Telecommunications. All right reserved.
引用
收藏
页码：97 / 101
页数：4
相关论文
共 11 条
  • [1] Zhu Y., Xu B., Shi X., Et al., A survey of social-based routing in delay tolerant networks: positive and negative social effects, IEEE Communications Surveys & Tutorials, 15, 1, pp. 387-401, (2013)
  • [2] Vahdat A., Becker D., Epidemic routing for partially connected ad hoc networks, (2000)
  • [3] Lindgren A., Doria A., Schelen O., Probabilistic routing in intermittently connected networks, Acm Sigmobile Mobile Computing and Communications Review, 7, 3, pp. 239-254, (2003)
  • [4] Tao H., Xu Y., Wang X., Et al., A trace-driven routing algorithm in mobile ad hoc networks, Journal of Beijing University of Posts and Telecommunications, 37, 6, pp. 125-128, (2014)
  • [5] Hui P., Crowcroft J., How small labels create big improvements, 2007 IEEE PerCom Workshop on Smart Environments, pp. 65-70, (2007)
  • [6] Abdelkader T., Naik K., Nayak A., Et al., SGBR: a routing protocol for delay tolerant networks using social grouping, IEEE Trans on Parallel and Distributed Systems, 24, 12, pp. 2472-2481, (2013)
  • [7] Gao W., Cao G.H., Porta T.L., Et al., On exploiting transient social contact patterns for data forwarding in delay-tolerant networks, IEEE Trans on Mobile Computing, 12, 1, pp. 151-165, (2013)
  • [8] Zhao Y.X., Wu J., Socially-aware publish/subscribe system for human networks, 2010 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1-6, (2010)
  • [9] Lin C.J., Chen C.W., Chou C.F., Preference-aware content dissemination in opportunistic mobile social networks, 2012 IEEE International Conference on Computer Communications (INFOCOM), pp. 1960-1968, (2012)
  • [10] Wei K., Guo S., Zeng D., Et al., Exploiting small world properties for message forwarding in delay tolerant networks, IEEE Trans on Computers, 64, 10, pp. 2809-2818, (2015)
12