基于机会网络的最优化动态合作树选择算法

计算机科学 ›› 2014, Vol. 41 ›› Issue (Z11): 170-173.

基于机会网络的最优化动态合作树选择算法

吴嘉,易茜,陈志刚

中南大学软件学院长沙410075“移动医疗”教育部-中国移动联合实验室长沙410083;中南大学软件学院长沙410075“移动医疗”教育部-中国移动联合实验室长沙410083;中南大学软件学院长沙410075“移动医疗”教育部-中国移动联合实验室长沙410083

出版日期:2018-11-14 发布日期:2018-11-14
基金资助:
本文受国家自然科学基金(61073186,61379057,61073186,61309001,61379110),教育部博士点基金优先发展领域课题(20120162130008),国家重点基础研究发展计划(973计划)(2014CB046305),中南大学博士生创新基金(2014zzts043)资助

Algorithm of Selecting Optimal Dynamic Cooperation Tree in Opportunistic Networks

WU Jia,YI Xi and CHEN Zhi-gang

Online:2018-11-14 Published:2018-11-14

摘要/Abstract

摘要： 结点的移动性、传递信息的随机性和无链路连接传递是机会网络的一些信息传递的重要特征,而这些特征与人类社会中人类传递信息的过程极为相似。传统的机会网络算法用于社会网络时会因为环境的变化、人类社会特有的关系属性等问题不能获得很好的效果。因此,本文将随机性、移动性、无连接性等特征作为连接机会网络与社会网络的桥梁,设计了一种选择最优化动态合作树的算法。该算法通过建立动态拓扑结构树的方式,并建立可靠性、可用性、衰减因子、权重因子等作为拓扑结构中的权值进行计算,从而得到最优合作对象和最优合作路径。仿真实验表明,与经典的机会网络算法相比,该算法取得了很好的效果。

关键词: 机会网络,算法,合作树,权值,可靠性,可用性,衰减因子

Abstract: The randomness,mobility and disconnection are the characteristic of opportunistic networks.Then there are some similarities of human transmitting messages in human social networks.The traditional algorithms,in social networks,have not acquired good result because of changing application environment.Thus,this paper designed an algorithm——optimal dynamic cooperation tree algorithm when it is in randomness,mobility and disconnection environment.According to find dynamic topology structure,and establish dependability,usability,decline factor,we could count weight of this topology structure,and then obtain the optimal objects and paths.In the light of simulation,we compared it with classical algorithms.This algorithm acquires good result.

Key words: Opportunistic network,Algorithm,Cooperation tree,Weight,Dependability,Usability,Decline factor

吴嘉,易茜,陈志刚. 基于机会网络的最优化动态合作树选择算法[J]. 计算机科学, 2014, 41(Z11): 170-173. https://doi.org/

WU Jia,YI Xi and CHEN Zhi-gang. Algorithm of Selecting Optimal Dynamic Cooperation Tree in Opportunistic Networks[J]. Computer Science, 2014, 41(Z11): 170-173. https://doi.org/

参考文献

[1] Gerla M,Kleinrock L.Vehicular networks and the future of the mobile internet[J].Computer Networks,2011,55(2):457-469
[2] Seferoglu H,Markopoulou A.Opportunistic network coding for video streaming over wireless[C]∥Packet Video 2007.IEEE,2007:191-200
[3] Del Monte A,D’Esposito M R,Giordano G,et al.Analysis of collaborative patterns in innovative networks[M]∥New perspectives in statistical modeling and data analysis.Springer Berlin Heidelberg,2011:77-84
[4] Tseng Y C,Wu F J,Lai W T.Opportunistic data collection for disconnected wireless sensor networks by mobile mules[J].Ad Hoc Networks,2013,11(3):1150-1164
[5] Martín-Campillo A,Crowcroft J,Yoneki E,et al.Evaluating op-portunistic networks in disaster scenarios[J].Journal of Network and Computer Applications,2013,36(2):870-880
[6] Pinquart M,Srensen S.Influences of socioeconomic status,social network,and competence on subjective well-being in later life:a meta-analysis[J].Psychology and aging,2000,15(2):187
[7] Spyropoulos T,Psounis K,Raghavendra C S.Efficient routing in intermittently connected mobile networks:the multiple-copy case[J].Networking,IEEE/ACM Transactions on,2008,16(1):77-90

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed