Social-based routing in pocket switched networks

被引：1
|
作者：
Cao, Jiu-Xin [1 ]
Chen, Gao-Jun [1 ]
Yang, Jing [1 ]
Zhu, Zi-Qing [1 ]
Liu, Bo [1 ]
机构：
[1] College of Computer Science and Engineering, Southeast University, Nanjing
来源：
Tongxin Xuebao/Journal on Communications | 2015年 / 36卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Centrality; Community; DTN; PSN; Routing algorithm;
D O I：
10.11959/j.issn.1000-436x.2015105
中图分类号：
学科分类号：
摘要：
In pocket switched network, how to make effective balance between the message delivery ratio and transmission delay is a problem to be solved. A community-based PSN routing algorithm, named BridgingCom, is proposed. It uses local community detection method with aging mechanism and introduces the bridging centrality as the basis of forwarding decisions. The algorithm combines the analysis of node centrality with the structure of social mobile network, makes full use of the community relationship and activeness of nodes in PSN. Simulation results show that BridgingCom routing algorithm has better performance in the message delivery ratio and message average delay compared to a number of previously proposed algorithms. ©, 2015, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页数：10
相关论文
共 27 条
  • [1] Hui P., Chaintreau A., Et al., Pocket switched networks and human mobility in conference environments, Proc of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, pp. 244-251, (2005)
  • [2] Daly E., Haahr M., Social network analysis for routing in disconnected delay-tolerant manets, Proc of ACM MobiHoc, pp. 32-40, (2007)
  • [3] Hui P., Crowcroft J., Yoneki E., Bubble rap: social-based forwarding in delay-tolerant networks, Mobile Computing, IEEE Transactions, 10, 11, pp. 1576-1589, (2011)
  • [4] 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, (2012)
  • [5] Eagle N., Pentland A., Reality mining: sensing complex social systems, Personal and Ubiquitous Computing, 10, 4, pp. 255-268, (2006)
  • [6] Diot C., Et al., Haggle project, (2004)
  • [7] Su J.S., Hu Q.L., Zhao B.K., Peng W., Routing techniques on delay/disruption tolerant networks, Journal of Software, 21, 1, pp. 119-132, (2010)
  • [8] Vahdat A., Becker D., Epidemic Routing for Partially Connected ad Hoc Networks, (2000)
  • [9] Anders L., Avri D., Olov S., Probabilistic routing in intermittently connected networks, ACM SIGMOBILE Mobile Computing and Communications Review, 7, 3, pp. 19-20, (2003)
  • [10] Milgram S., The small world problem, Psychology Today, 2, pp. 60-67, (1967)
123