移动自组网中防止合谋的信任管理

M. Seredynski, P. Bouvry
{"title":"移动自组网中防止合谋的信任管理","authors":"M. Seredynski, P. Bouvry","doi":"10.1109/GLOCOMW.2010.5700372","DOIUrl":null,"url":null,"abstract":"Reciprocity-based cooperation on packet relaying in mobile ad hoc networks discourages nodes from behaving selfishly. Before passing on a packet to the next hop a node verifies whether the sender of the packet is trustworthy (cooperative) or not. The quality of the evaluation of the trustworthiness relies on types of data used for description of the behaviour of the sender. In the literature a distinction was made between first-hand observations and observations obtained from third parties. This paper demonstrates that further distinction of such data into personal and general can help to create better protection against clique building among nodes. The former takes into account the status of packets originated by a node itself, while in the latter the status of packets originated by other nodes is considered. Computational experiments demonstrate that in the presence of a large number of selfish and colluding nodes prioritising the personal data improves the performance of cooperative nodes and creates a better defence against colluding free-riders.","PeriodicalId":232205,"journal":{"name":"2010 IEEE Globecom Workshops","volume":"141 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Trust management for collusion prevention in mobile ad hoc networks\",\"authors\":\"M. Seredynski, P. Bouvry\",\"doi\":\"10.1109/GLOCOMW.2010.5700372\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reciprocity-based cooperation on packet relaying in mobile ad hoc networks discourages nodes from behaving selfishly. Before passing on a packet to the next hop a node verifies whether the sender of the packet is trustworthy (cooperative) or not. The quality of the evaluation of the trustworthiness relies on types of data used for description of the behaviour of the sender. In the literature a distinction was made between first-hand observations and observations obtained from third parties. This paper demonstrates that further distinction of such data into personal and general can help to create better protection against clique building among nodes. The former takes into account the status of packets originated by a node itself, while in the latter the status of packets originated by other nodes is considered. Computational experiments demonstrate that in the presence of a large number of selfish and colluding nodes prioritising the personal data improves the performance of cooperative nodes and creates a better defence against colluding free-riders.\",\"PeriodicalId\":232205,\"journal\":{\"name\":\"2010 IEEE Globecom Workshops\",\"volume\":\"141 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Globecom Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOMW.2010.5700372\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Globecom Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2010.5700372","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

移动自组织网络中基于互惠的分组中继合作抑制了节点的自私行为。在将数据包传递到下一跳之前,节点验证数据包的发送方是否可信(合作)。可信度评估的质量依赖于用于描述发送方行为的数据类型。在文献中,对第一手观察结果和从第三方获得的观察结果进行了区分。本文表明,进一步将此类数据区分为个人数据和一般数据,可以帮助更好地防止节点之间的小圈子建设。前者考虑节点自身发起的数据包状态,后者考虑其他节点发起的数据包状态。计算实验表明,在存在大量自私和串通的节点时,优先处理个人数据可以提高合作节点的性能,并可以更好地防御串通的搭便车者。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Trust management for collusion prevention in mobile ad hoc networks
Reciprocity-based cooperation on packet relaying in mobile ad hoc networks discourages nodes from behaving selfishly. Before passing on a packet to the next hop a node verifies whether the sender of the packet is trustworthy (cooperative) or not. The quality of the evaluation of the trustworthiness relies on types of data used for description of the behaviour of the sender. In the literature a distinction was made between first-hand observations and observations obtained from third parties. This paper demonstrates that further distinction of such data into personal and general can help to create better protection against clique building among nodes. The former takes into account the status of packets originated by a node itself, while in the latter the status of packets originated by other nodes is considered. Computational experiments demonstrate that in the presence of a large number of selfish and colluding nodes prioritising the personal data improves the performance of cooperative nodes and creates a better defence against colluding free-riders.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Mobile radio channels' estimation for SC-FDMA systems by means of adequate noise and inter-carrier interference filtering in a transformed domain Performance enhancement in limited feedback precoded spatial multiplexing MIMO-OFDM systems by using multi-block channel prediction Techniques for embracing intra-cell unbalanced bit error characteristics in MLC NAND flash memory 4K digital cinema home theater over high throughput wireless transmission system Outage analysis for WCDMA femtocell with uplink attenuation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1