一种基于声誉的机制,用于在自组织网络中隔离自私节点

M. Refaei, Vivek Srivastava, L. Dasilva, M. Eltoweissy
{"title":"一种基于声誉的机制,用于在自组织网络中隔离自私节点","authors":"M. Refaei, Vivek Srivastava, L. Dasilva, M. Eltoweissy","doi":"10.1109/MOBIQUITOUS.2005.7","DOIUrl":null,"url":null,"abstract":"For ad hoc networks to realize their potential in commercial deployments, it is important that they incorporate adequate security measures. Selfish behavior of autonomous network nodes could greatly disrupt network operation. Such behavior should be discouraged, detected, and isolated. In this paper, we propose a reputation-based mechanism to detect and isolate selfish nodes in an ad hoc network. The proposed mechanism allows a node to autonomously evaluate the \"reputation\" of its neighbors based on the completion of the requested service. The underlying principle is that when a node forwards a packet through one of its neighbors, it holds that neighbor responsible for the correct delivery of the packet to the destination. Our mechanism is efficient and immune to node collusion since, unlike most contemporary mechanisms for reputation-based trust, it does not depend on exchanging reputation information among nodes. We also explore various reputation functions and report on their effectiveness in isolating selfish nodes and reducing false positives. Our simulation results demonstrate that the choice of the reputation function greatly impacts performance and that the proposed mechanism, with a carefully selected function, is successful in isolating selfish nodes while maintaining false positives at a reasonably low level.","PeriodicalId":129488,"journal":{"name":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"149","resultStr":"{\"title\":\"A reputation-based mechanism for isolating selfish nodes in ad hoc networks\",\"authors\":\"M. Refaei, Vivek Srivastava, L. Dasilva, M. Eltoweissy\",\"doi\":\"10.1109/MOBIQUITOUS.2005.7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For ad hoc networks to realize their potential in commercial deployments, it is important that they incorporate adequate security measures. Selfish behavior of autonomous network nodes could greatly disrupt network operation. Such behavior should be discouraged, detected, and isolated. In this paper, we propose a reputation-based mechanism to detect and isolate selfish nodes in an ad hoc network. The proposed mechanism allows a node to autonomously evaluate the \\\"reputation\\\" of its neighbors based on the completion of the requested service. The underlying principle is that when a node forwards a packet through one of its neighbors, it holds that neighbor responsible for the correct delivery of the packet to the destination. Our mechanism is efficient and immune to node collusion since, unlike most contemporary mechanisms for reputation-based trust, it does not depend on exchanging reputation information among nodes. We also explore various reputation functions and report on their effectiveness in isolating selfish nodes and reducing false positives. Our simulation results demonstrate that the choice of the reputation function greatly impacts performance and that the proposed mechanism, with a carefully selected function, is successful in isolating selfish nodes while maintaining false positives at a reasonably low level.\",\"PeriodicalId\":129488,\"journal\":{\"name\":\"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"149\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MOBIQUITOUS.2005.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MOBIQUITOUS.2005.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 149

摘要

为了使自组织网络在商业部署中发挥其潜力,将适当的安全措施纳入其中是很重要的。自治网络节点的自私自利行为会极大地扰乱网络的正常运行。这种行为应该被阻止、发现和隔离。在本文中,我们提出了一种基于声誉的机制来检测和隔离自组织网络中的自利节点。提出的机制允许节点根据请求服务的完成情况自主评估其邻居的“信誉”。基本原理是,当一个节点通过它的一个邻居转发一个数据包时,它让这个邻居负责将数据包正确地传递到目的地。我们的机制高效且不受节点合谋的影响,因为与大多数基于声誉的信任机制不同,它不依赖于节点之间交换声誉信息。我们还探讨了各种声誉函数,并报告了它们在隔离自私节点和减少误报方面的有效性。我们的模拟结果表明,声誉函数的选择极大地影响了性能,并且通过精心选择函数,所提出的机制成功地隔离了自私节点,同时将误报保持在合理的低水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A reputation-based mechanism for isolating selfish nodes in ad hoc networks
For ad hoc networks to realize their potential in commercial deployments, it is important that they incorporate adequate security measures. Selfish behavior of autonomous network nodes could greatly disrupt network operation. Such behavior should be discouraged, detected, and isolated. In this paper, we propose a reputation-based mechanism to detect and isolate selfish nodes in an ad hoc network. The proposed mechanism allows a node to autonomously evaluate the "reputation" of its neighbors based on the completion of the requested service. The underlying principle is that when a node forwards a packet through one of its neighbors, it holds that neighbor responsible for the correct delivery of the packet to the destination. Our mechanism is efficient and immune to node collusion since, unlike most contemporary mechanisms for reputation-based trust, it does not depend on exchanging reputation information among nodes. We also explore various reputation functions and report on their effectiveness in isolating selfish nodes and reducing false positives. Our simulation results demonstrate that the choice of the reputation function greatly impacts performance and that the proposed mechanism, with a carefully selected function, is successful in isolating selfish nodes while maintaining false positives at a reasonably low level.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信