使节点合作:ddn中消息转发的安全激励机制

Honglong Chen, W. Lou
{"title":"使节点合作:ddn中消息转发的安全激励机制","authors":"Honglong Chen, W. Lou","doi":"10.1109/ICCCN.2013.6614150","DOIUrl":null,"url":null,"abstract":"In traditional Delay Tolerant Networks (DTNs), the nodes can take advantage of intermittent contact opportunities to forward messages. However, in noncooperative DTNs, the nodes may be selfish and reluctant to cooperate with each other in message forwarding. Therefore, it is necessary to motivate the nodes to cooperate with each other in such DTNs. The previously proposed incentive mechanisms have obvious limitations such as the security vulnerability. To resolve such kind of drawbacks, in this paper we propose two credit-based rewarding schemes, called earliest path singular rewarding scheme and earliest path cumulative rewarding scheme respectively, to ensure the nodes truthfully forward the messages. The proposed rewarding schemes are incentive compatible. They also ensure that the payment for each delivered message is upper bounded. Furthermore, the proposed rewarding schemes can prevent selfish nodes from having malicious behaviors. Simulations based on the real trace are conducted to illustrate the effectiveness of the proposed rewarding schemes.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Making Nodes Cooperative: A Secure Incentive Mechanism for Message Forwarding in DTNs\",\"authors\":\"Honglong Chen, W. Lou\",\"doi\":\"10.1109/ICCCN.2013.6614150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In traditional Delay Tolerant Networks (DTNs), the nodes can take advantage of intermittent contact opportunities to forward messages. However, in noncooperative DTNs, the nodes may be selfish and reluctant to cooperate with each other in message forwarding. Therefore, it is necessary to motivate the nodes to cooperate with each other in such DTNs. The previously proposed incentive mechanisms have obvious limitations such as the security vulnerability. To resolve such kind of drawbacks, in this paper we propose two credit-based rewarding schemes, called earliest path singular rewarding scheme and earliest path cumulative rewarding scheme respectively, to ensure the nodes truthfully forward the messages. The proposed rewarding schemes are incentive compatible. They also ensure that the payment for each delivered message is upper bounded. Furthermore, the proposed rewarding schemes can prevent selfish nodes from having malicious behaviors. Simulations based on the real trace are conducted to illustrate the effectiveness of the proposed rewarding schemes.\",\"PeriodicalId\":207337,\"journal\":{\"name\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2013.6614150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2013.6614150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在传统的容忍延迟网络(DTNs)中,节点可以利用间歇接触机会来转发消息。然而,在非合作的ddn中,节点可能是自私的,不愿意在消息转发中相互合作。因此,在这种ddn中,有必要激励节点相互合作。以往提出的激励机制存在安全漏洞等明显的局限性。为了解决这一问题,本文提出了两种基于信用的奖励方案,分别称为最早路径奇异奖励方案和最早路径累积奖励方案,以保证节点真实转发消息。提议的奖励方案是激励相容的。它们还确保每个交付消息的支付是有上限的。此外,所提出的奖励方案可以防止自私节点产生恶意行为。基于真实轨迹的仿真验证了所提奖励方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Making Nodes Cooperative: A Secure Incentive Mechanism for Message Forwarding in DTNs
In traditional Delay Tolerant Networks (DTNs), the nodes can take advantage of intermittent contact opportunities to forward messages. However, in noncooperative DTNs, the nodes may be selfish and reluctant to cooperate with each other in message forwarding. Therefore, it is necessary to motivate the nodes to cooperate with each other in such DTNs. The previously proposed incentive mechanisms have obvious limitations such as the security vulnerability. To resolve such kind of drawbacks, in this paper we propose two credit-based rewarding schemes, called earliest path singular rewarding scheme and earliest path cumulative rewarding scheme respectively, to ensure the nodes truthfully forward the messages. The proposed rewarding schemes are incentive compatible. They also ensure that the payment for each delivered message is upper bounded. Furthermore, the proposed rewarding schemes can prevent selfish nodes from having malicious behaviors. Simulations based on the real trace are conducted to illustrate the effectiveness of the proposed rewarding schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信