期刊论文

Routing algorithm based on opportunistic network

中文

华中师范大学学报(自然科学版)

1000-1190

2019

53

6

897-901,914

10.19603/j.cnki.1000-1190.2019.06.012

国家自然科学基金项目（U1536104）；

本校为第一机构

当前机会网络路由算法在数据包较少的情况下无法准确估算节点的兴趣,导致社区划分不合理,数据包在节点之间存在无效传递,从而增大了通信开销.针对此问题提出了一种将节点接收消息的历史次数和历史消息与各类消息间的相似度相结合,量化对各类消息的兴趣程度,并根据这种兴趣程度来划分兴趣社区的路由算法ILCR(interest level community route). ILCR具体转发策略是选择在目标社区内且到目的节点概率大的节点,或者活跃且可靠程度大的节点作为中继,通过ONE平台对ILCR仿真并与Epidemic、Prophet对比,结果表明ILCR在投递率比Prophet提高了约13 %,比Epidemic提高了约113 %、网络开销比Prophet降低了约9...

The current opportunistic network routing algorithm is unable to accurately estimate the interest of nodes in the case of fewer packets,which leads to unreasonable division of communities and invalid transmission of packets between nodes,thus increasing communication overhead. To solve this problem, a routing algorithm ILCR (interest level community route) is proposed,which combines the historical number of messages received by nodes and the similarity between historical messages and various types of messages, to quantify the degree of interest in various types of messages, and divides the int...