An Incentive-Compatible Routing Protocol for Two-Hop Delay-Tolerant Networks
An Incentive-Compatible Routing Protocol for Two-Hop Delay-Tolerant Networks
复制标题
DOI：
10.1109/tvt.2015.2454291
复制
发表时间：
2016
影响因子：
6.8
通讯作者：
Ying Cai;Yanfang Fan;Ding Wen
中科院分区：
文献类型：
--
作者：
Ying Cai;Yanfang Fan;Ding Wen
延迟容忍网络（DTN）依赖于节点及其联系人的移动性来弥补连续连接的缺乏，从而以“存储-携带-转发”的方式实现从源到目的地的消息传递。由于消息递送消耗诸如存储和功率的资源，一些节点可以选择不转发或携带其他节点的消息，而依赖于其他节点来递送它们本地生成的消息。这些自私的行为可能会阻碍DTN上的有效通信。本文基于算法博弈理论，提出了一种有效的激励兼容（IC）路由协议（ICRP）。该算法综合考虑了节点的相遇概率和传输代价来处理自私节点的错误行为。此外，我们采用最佳顺序停止规则和Vickrey-Clarke-格罗夫斯（VCG）拍卖作为一种策略来选择最佳中继节点，以确保诚实地报告他们的相遇概率和传输成本的节点可以最大化他们的回报。我们尝试基于实际概率模型自适应地寻找最优的停止时间阈值，并提出了一种计算阈值的算法。基于此阈值，我们提出了一种新的方法来选择多副本传输的中继节点。为了保证被选中的中继节点能够安全地接收到他们的奖励，我们开发了一个基于双线性映射的签名方案，以防止恶意节点的篡改。仿真结果表明，ICRP能有效地激励节点转发/携带消息，以较低的传输代价获得较高的分组投递率。
Delay-tolerant networks (DTNs) rely on the mobility of nodes and their contacts to make up with the lack of continuous connectivity and, thus, enable message delivery from source to destination in a “store-carry-forward” fashion. Since message delivery consumes resource such as storage and power, some nodes may choose not to forward or carry others' messages while relying on others to deliver their locally generated messages. These kinds of selfish behaviors may hinder effective communications over DTNs. In this paper, we present an efficient incentive-compatible (IC) routing protocol (ICRP) with multiple copies for two-hop DTNs based on the algorithmic game theory. It takes both the encounter probability and transmission cost into consideration to deal with the misbehaviors of selfish nodes. Moreover, we employ the optimal sequential stopping rule and Vickrey-Clarke-Groves (VCG) auction as a strategy to select optimal relay nodes to ensure that nodes that honestly report their encounter probability and transmission cost can maximize their rewards. We attempt to find the optimal stopping time threshold adaptively based on realistic probability model and propose an algorithm to calculate the threshold. Based on this threshold, we propose a new method to select relay nodes for multicopy transmissions. To ensure that the selected relay nodes can receive their rewards securely, we develop a signature scheme based on a bilinear map to prevent the malicious nodes from tampering. Through simulations, we demonstrate that ICRP can effectively stimulate nodes to forward/carry messages and achieve higher packet delivery ratio with lower transmission cost.