期刊文献+

社交网络中基于节点影响力和累积效应的数据转发算法

Data Forwarding Algorithm Based on Node Influence and Accumulative Effect in Social Networks
下载PDF
导出
摘要 目的社交网络是DTNs网络的一种,该网络是一种特殊的无线自组织网络,缺乏端到端的持续连接,具有较高的丢包率和传输延迟。研究目的是克服上述缺点,实现数据的高效转发。方法针对社交网络中节点与社区以及节点与目的节点的关系进行研究分析,提出一种基于节点影响力和累积效应的数据转发算法:DFNS算法。结合C++软件进行实验模拟,与DTNs网络中的Epidemic算法和Label算法进行对比分析。结果随着网络中发包数目的增加,DFNS算法的传递率略低于Epidemic算法,高于Label算法,其平均延迟却高于其他2种算法。拷贝数目方面,DFNS算法比Epidemic算法最高减少44.38%,相比于Label算法最高减少39.47%。随着网络中数据包的存在时间的改变,3种算法的传递率先迅速增长,之后基本不发生改变,且3种算法平均延迟的变化趋势基本相同。在拷贝数目方面,DFNS算法比Epidemic算法平均少了45.16%,比Label算法平均少了40.25%。结论 DFNS算法在传递率方面优于Label算法,略低于Epidemic算法,相比其它2种算法能明显降低网络中数据包的拷贝数目,减少资源的能量消耗。在提高网络性能,降低网络成本方面优于其它两种算法。 Objective Social network is a kind of DTNs network,which is a special wireless ad hoc network.It lacks of end-to-end continous connection,and has high packet loss rate and transmission delay.However,the social network is one of DTNs.To overcome these shortcomings,efficient forwarding of data was achieved.Methods The relationship between nodes and communities,and nodes and destination nodes in social networks were studied and analyzed,and a data forwarding algorithm based on node influence and cumulative effect was proposed.The experiment was simulated with C++software,and the algorithm was compared with Epidemic algorithm and Label algorithm in DTNs network.Results With the increase of the number of contracts in the network,the transmission rate of DFNs algorithm in this paper was slightly lower than that of the Epidemic algorithm,and higher than the Label algorithm,But the average delay was higher than those of the other two algorithms.In terms of copy number,the DFNS algorithm reduced the maximun by44.38%compared with the Epidemic algorithm,and by39.47%compared with the Label algorithm.With the changes of packet existence in the network,the transmission of the three algorithms took the lead in rapid growth,and then basically unchanged.And the average delay trend of the three algorithms was basically the same.In terms of copy number.the DFNS algorithm in this paper was45.16%less than the Epidemic algorithm,and compared with the Label algorithm,the average was less than40.25%.Conclusion The DFNS algorthm in the transfer rate is better than that of Label algorithm,and slightly lower than that of the Epidemic algorithm;and compared with other two algorithms it can significantly reduce the number of copies of the packets in the network and the energy consumption of resources、Therefore,this algorithm plays a certain role in improving network performance and reducing network cost.
作者 任丽丽 张旭 REN Li-li;ZHANG Xu(School of Public Foundation,Bengbu Medical College,Bengbu,Anhui 233030,China;School of Mathematics and Computation Science,Anqing Normal University,Anqing,Anhui 246133,China)
出处 《河北北方学院学报(自然科学版)》 2018年第3期36-39,50,共5页 Journal of Hebei North University:Natural Science Edition
基金 蚌埠医学院自然科学基金资助项目(BYKY1661) 国家自然科学基金资助项目(61603003)
关键词 社交网络 社区 影响力 集合 累积效应 social networks community influence set accumulative effect
  • 相关文献

参考文献2

二级参考文献118

  • 1Hull B, Bychkovsky V, Zhang Y, Chen K, Goraczko M, Miu A, Shih E, Balakrishnan H, Madden S. CarTel: A distributed mobile sensor computing system. In: Proc. of the 4th Int'l Conf. on Embedded Networked Sensor Systems. Boulder: ACM, 2006. 125-138.
  • 2Pan H, Chaintreau A, Scott J, Gass R, Crowcroft J, Diot C. Pocket switched networks and human mobility in conference environments. In: Proc. of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking. Philadelphia: ACM. 2005. 244-251.
  • 3Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D. Energy-Efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In: Proc. of the 10th Int'l Conf. on Architectural Support for Programming Languages and Operating Systems. New York: ACM, 2002.96-107. DO1=http://doi.acm.org/10.1145/605397.605408
  • 4Pelusi L, Passarella A, Conti M. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Communications Magazine, 2006,44(11): 134-141.
  • 5Conti M, Giordano S. Multihop ad hoe networking: The reality. Communications Magazine, 2007,45(4):88-95.
  • 6Fall K. A delay-tolerant network architecture for challenged Internets. In: Proc. of the 2003 Conf. on Applications, Technologies, Architectures, and Protocols for Computer Communications. Karlsruhe: ACM, 2003.27-34.
  • 7Akyildiz IF, Akan B, Chert C, Fang J, Su W. InterPlaNetary Intemet: State-of-the-Art and research challenges. Computer Networks, 2003,43(2):75-112.
  • 8Gupta P, Kumar P. The capacity of wireless networks. IEEE Trans. on Information Theory, 2000,46(2):388-404.
  • 9Grossglauser M, Tse DNC. Mobility increases the capacity of ad hoc wireless networks. IEEE/ACM Trans. on Networking, 2002, 10(4):477-486.
  • 10Small T, Haas ZJ. The shared wireless infostation model: A new ad hoc networking paradigm (or where there is a whale, there is a way). In: Proc. of the 4th ACM Int'l Symp. on Mobile Ad Hoc Networking. Annapolis: ACM, 2003. 233-244.

共引文献326

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部