当前位置: X-MOL 学术Wirel. Commun. Mob. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy
Wireless Communications and Mobile Computing ( IF 2.146 ) Pub Date : 2021-03-03 , DOI: 10.1155/2021/6666211
Gang Xu 1, 2 , Xinyue Wang 3 , Na Zhang 1, 2 , Zhifei Wang 1, 2 , Lin Yu 1, 2 , Liqiang He 4
Affiliation  

Opportunistic networks are becoming more and more important in the Internet of Things. The opportunistic network routing algorithm is a very important algorithm, especially based on the historical encounters of the nodes. Such an algorithm can improve message delivery quality in scenarios where nodes meet regularly. At present, many kinds of opportunistic network routing algorithms based on historical message have been provided. According to the encounter information of the nodes in the last time slice, the routing algorithms predict probability that nodes will meet in the subsequent time slice. However, if opportunistic network is constructed in remote rural and pastoral areas with few nodes, there are few encounters in the network. Then, due to the inability to obtain sufficient encounter information, the existing routing algorithms cannot accurately predict whether there are encounters between nodes in subsequent time slices. For the purpose of improving the accuracy in the environment of sparse opportunistic networks, a prediction model based on nodes intimacy is proposed. And opportunistic network routing algorithm is designed. The experimental results show that the ONBTM model effectively improves the delivery quality of messages in sparse opportunistic networks and reduces network resources consumed during message delivery.

中文翻译:

基于节点亲和力的稀疏机会网络路由算法

机会网络在物联网中变得越来越重要。机会网络路由算法是非常重要的算法,尤其是基于节点的历史遭遇。这样的算法可以在节点定期会面的情况下提高消息传递质量。目前,已经提供了多种基于历史消息的机会网络路由算法。路由算法根据最后一个时间片中节点的遭遇信息,预测节点在随后的时间片中相遇的概率。但是,如果机会网络是在偏僻的农村和牧区,节点很少的情况下构建的,则网络中几乎不会遇到任何机会。然后,由于无法获得足够的遭遇信息,现有的路由算法无法准确预测后续时间片中的节点之间是否存在相遇。为了提高稀疏机会网络环境下的准确性,提出了一种基于节点亲密度的预测模型。并设计了机会网络路由算法。实验结果表明,ONBTM模型有效地提高了稀疏机会网络中邮件的传递质量,并减少了邮件传递过程中消耗的网络资源。
更新日期:2021-03-03
down
wechat
bug