首页 | 本学科首页   官方微博 | 高级检索  
     

移动社会网络中基于多维上下文匹配的数据转发算法
引用本文:徐方,邓敏,熊曾刚,叶从欢,徐宁. 移动社会网络中基于多维上下文匹配的数据转发算法[J]. 计算机科学, 2019, 46(2): 81-87
作者姓名:徐方  邓敏  熊曾刚  叶从欢  徐宁
作者单位:湖北工程学院计算机与信息科学学院 湖北孝感432000;武汉大学计算机学院 武汉430072;湖北工程学院计算机与信息科学学院 湖北孝感432000;武汉大学计算机学院 武汉430072
基金项目:本文受教育部人文社会科学研究青年基金项目(17YJCZH203),湖北省教育厅科研计划重点项目(D20182702)资助
摘    要:通过研究移动社会网络中的多种上下文信息对节点移动模式的影响,提出了基于多维上下文认知的数据转发算法MCMF。该算法综合考虑物理邻接性、社会相似性以及社会交互性3个维度的上下文信息来进行动态数据转发决策。首先消息携带者节点通过物理邻接匹配获得邻居节点集合;然后通过社会相似性匹配在邻居节点集合中选出候选节点子集,并基于社会网络的社群特征,采用马尔可夫预测方法在候选节点子集中选出最优中继节点;最后设计高效的数据转发算法。仿真实验表明,相比于其他3种著名算法,该算法在交付比率和开销比率方面具有较好的性能。

关 键 词:移动社会网络  多维  上下文匹配  预测模型  转发算法
收稿时间:2018-01-07
修稿时间:2018-03-30

Data Forwarding Algorithm Based on Multidimensional Context Matching in Mobile Social Networks
XU Fang,DENG Min,XIONG Zeng-gang,YE Cong-huan and XU Ning. Data Forwarding Algorithm Based on Multidimensional Context Matching in Mobile Social Networks[J]. Computer Science, 2019, 46(2): 81-87
Authors:XU Fang  DENG Min  XIONG Zeng-gang  YE Cong-huan  XU Ning
Affiliation:School of Computer and Information Science,Hubei Engineering University,Xiaogan,Hubei 432000,China;School of Computer Science,Wuhan University,Wuhan 430072,China,School of Computer and Information Science,Hubei Engineering University,Xiaogan,Hubei 432000,China,School of Computer and Information Science,Hubei Engineering University,Xiaogan,Hubei 432000,China,School of Computer and Information Science,Hubei Engineering University,Xiaogan,Hubei 432000,China and School of Computer Science,Wuhan University,Wuhan 430072,China
Abstract:Through studying the effect of a variety of context information on the mobility patterns in mobile social networks,this paper proposed a multidimensional context matching forwarding (MCMF) algorithm.In this novel algorithm,three dimension contexts,which are physical adjacency,social similarity and social interactivity,are used to make routing decisions dynamically.Firstly,message carrier obtains its neighbor node sets by using physical adjacency matching at the present moment.Then social similarity matching is used to search relay candidate subset of neighbor node sets,and the discrete-time semi-Markov prediction model is used to determine the best relay node.At last,the efficient data forwarding algorithm is designed.Simulation experiments based on real traces show that the proposed MCMF algorithm is more efficient in terms of maximizing the delivery ratio and minimizing the overhead ratio than other three state-of-the-art algorithms.
Keywords:Mobile social networks  Multi dimensional  Context matching  Prediction model  Forwarding algorithm
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号