| 机会网络中基于节点相似率的概率路由算法 |
| |
| 引用本文： | 崔建群,吴淑庆,常亚楠,黄东升. 机会网络中基于节点相似率的概率路由算法[J]. 小型微型计算机系统, 2021, 0(3): 609-614 |
| |
| 作者姓名： | 崔建群 吴淑庆 常亚楠 黄东升 |
| |
| 作者单位： | 华中师范大学计算机学院 |
| |
| 基金项目： | 国家自然科学基金面上项目(61672257)资助;国家自然科学基金青年项目(61702210)资助。 |
| |
| 摘 要： | 机会网络中的通信设备大多是随着时间的流逝而进行移动的,然而节点之间的移动路径又具有一定的重复性.因此,可以记录节点移动时与之相遇的节点之间的信息,利用该信息对路由算法做出更合理的决策.本文根据节点之间的相遇历史信息,提出了一种基于节点相似率的概率路由算法(Probabilistic routing algorithm ...
|
| 关 键 词： | 机会网络 路由算法 节点相似率 ACK确认机制 |
Probabilistic Routing Algorithm Based on Node Similarity Rate in Opportunity Network |
| |
| CUI Jian-qun,WU Shu-qing,CHANG Ya-nan,HUANG Dong-sheng. Probabilistic Routing Algorithm Based on Node Similarity Rate in Opportunity Network[J]. Mini-micro Systems, 2021, 0(3): 609-614 |
| |
| Authors: | CUI Jian-qun WU Shu-qing CHANG Ya-nan HUANG Dong-sheng |
| |
| Affiliation: | (School of Computer,Central China Normal University,Wuhan 430079,China) |
| |
| Abstract: | The communication devices in the opportunity network are mostly moved with the passage of time,but the moving paths between nodes are somewhat repetitive.Therefore,it is possible to record the information between the nodes that the node encounters when the node moves,and use this information to make a more reasonable decision on routing algorithm.In this article,according to the historical information of node encounters,a Probabilistic routing algorithm based on node Similarity rate(S-Prophet) is proposed to improve the predicted node transmission probability stage of traditional Prophet algorithm.Firstly,the meeting set of nodes and other nodes in the network is counted,the similarity rate of nodes is defined,a new formula of node delivery probability is designed,and the probability attenuation formula of the Prophet routing algorithm is changed according to the duration of node meeting.Finally, the effectiveness of s-prophet is verified through simulation experiments. |
| |
| Keywords: | Key woras:opportunity network routing algorithm node simllarity rate ACK mechanism |
| 本文献已被 维普 等数据库收录！ |
|
