基于ICN网络架构的社区感知型MSN路由机制
作者:
作者简介:

石峻岭(1989-),女,辽宁沈阳人,博士生, CCF专业会员,主要研究领域为移动社交,网络路由;王兴伟(1968-),男,博士,教授,博士生导师,CCF高级会员,主要研究领域为未来互联网,云计算,网络空间安全;黄敏(1968-),女,博士,教授,博士生导师,主要研究领域为智能算法设计与优化,调度理论与方法.

通讯作者:

王兴伟,E-mail:wangxw@mail.neu.edu.cn

中图分类号:

TP393

基金项目:

国家杰出青年科学基金(71325002);国家自然科学基金(61572123)


Community Aware MSN Routing Scheme Based on ICN Architecture
Author:
Fund Project:

National Science Foundation for Distinguished Young Scholars of China (71325002); National Natural Science Foundation of China (61572123)

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [23]
  • |
  • 相似文献 [20]
  • | | |
  • 文章评论
    摘要:

    移动社交网络(mobile social network,简称MSN)利用移动用户之间的社交关系,通过节点间的协作式转发实现消息交付.然而,随着大数据时代的到来,MSN需要满足移动用户日益增长的对内容(如视频)的需求.由于信息中心网络(information-centric networking,简称ICN)对移动性的支持,基于ICN架构,提出了一种MSN中基于社区划分的路由机制.在兴趣决策中,利用节点请求中的内容名字获取用户的兴趣偏好,进而计算用户间的兴趣差异度量;根据兴趣差异将节点划分为兴趣社区,依据这些兴趣社区进行兴趣包路由.在数据决策中,根据节点历史相遇信息计算用户间的相遇规律度量,根据相遇规律将节点划分为社交社区,依据这些社交社区进行数据包路由.同时,根据兴趣社区和社交社区信息优化节点的内容缓存,以快速满足未来的内容请求.进行了仿真实验,通过与现有机制在包交付率、平均延迟、平均跳数和网络开销方面的性能对比,表明所提出的机制是可行且有效的.

    Abstract:

    MSN (mobile social network) realizes message delivery by leveraging social relationships of mobile users via cooperation forwarding of nodes. However, with the coming of the big data era, MSN should satisfy the daily increasing content (e.g., video) requests of the mobile users. Considering that ICN (information-centric networking) supports mobility natively, in this study, a community aware routing scheme in MSN is proposed, which is based on ICN architecture. In interest decision, the proposed interest distance metrics among users are calculated based on the interest preferences of users, which are obtained from the content name of the requests of nodes. Then, nodes are detected into interest communities based on the interest distances, and interest packets are routed based on these detected interest communities. In data decision, the proposed encounter regularity metrics are calculated according to the history encounter information of nodes. Then, based on the encounter regularities, nodes are detected into social communities, and data packets are routed based on these detected social communities. Meanwhile, the proposed routing scheme optimizes content caching of nodes based on the detected interest communities and social communities, in order to satisfy the future content requests rapidly. By comparing with the existed schemes on packet delivery, average hops, average delay and network overhead, simulation experiments show that the proposed scheme is feasible and effective.

    参考文献
    [1] Hu X, Chu THS, Victor CML, Edith CHN, Philippe K, Henry CBC. A survey on mobile social networks: Applications, platforms, system architectures, and future research directions. IEEE Communications Surveys & Tutorials, 2015,17(3):1557-1581.
    [2] Eyuphan B, Boleslaw KS. Exploiting friendship relations for efficient routing in mobile social networks. IEEE Trans. on Parallel and Distributed Systems, 2012,23(12):2254-2265.
    [3] Feng Z, Nan Z, Li W. Effective social relationship measurement and cluster based routing in mobile opportunistic networks. Sensors, 2017,17(5):1109.
    [4] Xiao M, Wu J, Huang H, Huang L, Yang W. Deadline-Sensitive opportunistic utility-based routing in cyclic mobile social networks. In: Proc. of the Int'l Conf. on Sensing, Communication, and Networking. Seattle: IEEE, 2015. 301-309.
    [5] Li F, Jiang H, Li H, Wang M, Abdeldjalil T. SEBAR: Social energy based routing for mobile social delay tolerant networks. IEEE Trans. on Vehicular Technology, 2017,66(8):7195-7206.
    [6] Yan H, Jing Qi, Zhen L, Tao J. APPOW: An advanced routing protocol based on parameters optimization in the weighted mobile social network. China Communications, 2016,13(S1):107-115.
    [7] Wang X, Lin Y, Zhang S, Cai Z. A social activity and physical contact-based routing algorithm in mobile opportunistic networks for emergency response to sudden disasters. Enterprise Information Systems, 2015,3(2):1-30.
    [8] Xiao M, Wu J, Huang L. Community-Aware opportunistic routing in mobile social networks. IEEE Trans. on Computers, 2014, 63(7):1682-1695.
    [9] Zheng H, Wu J. Up-and-Down routing through nested core-periphery hierarchy in mobile opportunistic social networks. IEEE Trans. on Vehicular Technology, 2017,99:1-15.
    [10] Wu YF, Zhu YQ, Yang Z. Routing algorithm based on ant colony optimization for mobile social network. In: Proc. of the IEEE/ACIS Int'l Conf. on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computting. Kanazawa: IEEE, 2017. 297-302.
    [11] Girolami M, Chessa S, Caruso A. On service discovery in mobile social networks: Survey and perspectives. Computer Networks, 2015,88:51-71.
    [12] Burgess J, Gallagher B, Jensen D, Levine BN. MaxProp: Routing for vehicle-based disruption-tolerant networks. In: Proc. of the IEEE Infocom. Barcelona: IEEE, 2007. 1-11.
    [13] Ahlgren B, Dannewitz C, Imbrenda C, Kutscher D, Ohlman B. A survey of information-centric networking. Communications Magazine IEEE, 2011,50(7):26-36.
    [14] Xylomenos G, Ververidis CN, Siris VA, Fotiou N, Tsilopoulos C, Vasilakos X, Katsaros KV, Polyzos GC. A survey of information-centric networking research. IEEE Communications Surveys & Tutorials, 2014,16(2):1024-1049.
    [15] Xiao M, Wu J, Huang L. Community-Aware opportunistic routing in mobile social networks. IEEE Trans. on Computers, 2014, 63(7):1682-1695.
    [16] Hui P, Crowcroft J, Yoneki E. Bubble rap: Social-based forwarding in delay tolerant networks. IEEE Trans. on Mobile Computing, 2010,10(11):1576-1589.
    [17] Xu ZJ, Su Z, Xu QH, Qi QF, Yang TT, Li JT, Fang DF, Han B. Delivering mobile social content with selective agent and relay nodes in content centric networks. Peer-to-Peer Networking and Applications, 2017,10(2):296-304.
    [18] Lu Y, Gerla M, Le T, Rabsatt V, Kalantarian H. Community aware content retrieval in disruption-tolerant networks. In: Proc. of the Ad Hoc Networking Workshop. Piran: IEEE, 2014. 172-179.
    [19] Pu L, Chen X, Xu J, Fu X. sNDN: A social-aware named data framework for cooperative content retrieval via D2D communications. In: Proc. of the Int'l Workshop on Mobility in the Evolving Internet Architecture. Paris: ACM, 2015. 14-19.
    [20] Newman ME, Girvan M. Finding and evaluating community structure in networks. Physical Review E Statistical Nonlinear & Soft Matter Physics, 2004,69(026113):1-16.
    [21] Jain S, Fall K, Patra R. Routing in a delay tolerant network. ACM Sigcom Computer Communication Review, 2004,34(4):145-158.
    [22] http://www.haggleproject.org
    [23] Keranen A, Ott J, Karkkainen T. The ONE simulator for DTN protocol evaluation. In: Proc. of the 2nd Int'l Conf. on Simulation Tools and Techniques. Rome: ACM, 2009. 1-10.
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

石峻岭,王兴伟,黄敏.基于ICN网络架构的社区感知型MSN路由机制.软件学报,2020,31(6):1786-1801

复制
分享
文章指标
  • 点击次数:1652
  • 下载次数: 3572
  • HTML阅读次数: 2006
  • 引用次数: 0
历史
  • 收稿日期:2017-10-25
  • 最后修改日期:2018-09-13
  • 在线发布日期: 2020-06-04
  • 出版日期: 2020-06-06
文章二维码
您是第19791963位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号