...
首页> 外文期刊>Computer networks >An efficient probabilistic routing scheme based on game theory in opportunistic networks
【24h】

An efficient probabilistic routing scheme based on game theory in opportunistic networks

机译:机会网络中基于博弈论的高效概率路由方案

获取原文
获取原文并翻译 | 示例
           

摘要

Routing is one of the most challenging problems in opportunistic networks (OppNets) because of the intermittence of the network connection. To address the issue, many routing schemes have been proposed, however, most of them assume that nodes are willing to forward messages for others. In fact, due to limited resources and poor social relations, nodes in OppNets may be selfish and not reluctant to participate in message forwarding. To tackle this issue, in this paper, we propose a Probabilistic Routing scheme based on Game Theory (PRGT) to stimulate cooperation among selfish nodes. Firstly, we introduce virtual money to buy the message for gaining more profits. Then, according to the historical meeting records among different nodes, we establish a Markov-based probability prediction model, in which the message carrier selects a node with higher probability of encountering the destination node as the relay node. Finally, a game theory approach is employed to simulate trading price for message forwarding. The simulation results demonstrate that our proposed routing scheme can effectively improve the delivery rate of messages and reduce network latency. (C) 2018 The Authors. Published by Elsevier B.V.
机译:由于网络连接的间歇性,路由是机会网络(OppNets)中最具挑战性的问题之一。为了解决该问题,已经提出了许多路由方案,但是,大多数路由方案都假定节点愿意为其他节点转发消息。实际上,由于资源有限和社会关系差,OppNets中的节点可能是自私的,并且不愿意参与消息转发。为了解决这个问题,在本文中,我们提出了一种基于博弈论(PRGT)的概率路由方案,以刺激自私节点之间的合作。首先,我们引入虚拟货币来购买消息以获取更多利润。然后,根据不同节点之间的历史会议记录,建立基于马尔可夫的概率预测模型,消息载体选择一个遇到目标节点的概率较高的节点作为中继节点。最后,采用博弈论方法来模拟交易价格以进行消息转发。仿真结果表明,本文提出的路由方案可以有效提高消息的传递速度,减少网络等待时间。 (C)2018作者。由Elsevier B.V.发布

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号