期刊论文

Probabilistic Routing Algorithm Based on Node Similarity Rate in Opportunity Network

中文

小型微型计算机系统

1000-1220

2021

42

03

609-614

10.3969/j.issn.1000-1220.2021.03.028

国家自然科学基金面上项目（61672257）资助;国家自然科学基金青年项目（61702210）资助；

本校为第一机构

机会网络中的通信设备大多是随着时间的流逝而进行移动的,然而节点之间的移动路径又具有一定的重复性.因此,可以记录节点移动时与之相遇的节点之间的信息,利用该信息对路由算法做出更合理的决策.本文根据节点之间的相遇历史信息,提出了一种基于节点相似率的概率路由算法（Probabilistic routing algorithm based on node similarity rate,S-Prophet）,对传统的Prophet算法的预估节点传输概率阶段进行改进.首先统计网络中节点与其他节点的相遇集合,定义节点相似率,设计一个新的节点投递概率公式,并根据节点相遇持续时间对Prophet路由算法的概率衰减公式进行改变,最后,通过仿真实验验证SProphet的...

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 alg...