摘要
文章从节点共同形成的社会属性角度出发,提出了一种基于节点相似度和活跃度的数据转发算法(data forwarding algorithm based on the similarity and activity of nodes,DASA)及节点的相似度和活跃度的概念;在设计数据转发算法时,通过节点的相似度和活跃度来决定是否选择网络节点作为数据转发节点。研究结果表明,与Epidemic算法、Label算法以及Greedy Total算法相比,文中所提算法可降低网络资源的开销,且其传递率优于Label算法的传递率。
In view of social characteristics made by the nodes ,a data forwarding algorithm based on the similarity and activity of nodes(DASA) is proposed .Firstly ,the two dynamic features including the similarity and activity of nodes are put forward .Then ,whether or not a node is chosen as a relay node is determined by the similarity and activity of the encounter nodes .Finally ,the experimental results show that compared with Epidemic algorithm ,Label algorithm and Greedy Total algorithm ,the pro‐posed algorithm can obviously reduce the overhead of the network resources ,and the delivery rate of it is better than that of the Label algorithm .
出处
《合肥工业大学学报(自然科学版)》
CAS
CSCD
北大核心
2015年第9期1205-1209,共5页
Journal of Hefei University of Technology:Natural Science
基金
国家自然科学基金资助项目(61401144)
安徽省自然科学基金资助项目(1308085MF87)
教育部留学回国科研基金资助项目(2013JYLH0280)
高等学校博士学科点专项科研基金资助项目(2013111120018)
中央高校基本科研业务费专项基金资助项目(2013HGXJ0233
J2014HGXJ0074)