SECUND: A protocol for SECUre neighborhooD creation in wireless ad hoc networks

T. Hayajneh, P. Krishnamurthy, D. Tipper
{"title":"SECUND: A protocol for SECUre neighborhooD creation in wireless ad hoc networks","authors":"T. Hayajneh, P. Krishnamurthy, D. Tipper","doi":"10.4108/ICST.COLLABORATECOM2009.8380","DOIUrl":null,"url":null,"abstract":"The ability to correctly determine their neighborhood is a fundamental requirement for nodes in ad hoc and sensor networks. Many applications, protocols, and system functionality rely on neighborhood discovery. Malicious nodes that taint neighborhood information using wormholes can significantly disrupt the operation of ad hoc networks. Protocols that depend only on cryptographic techniques (e.g, authentication and encryption) may not be able to detect or prevent such attacks. In this paper we propose SECUND, a protocol for creating a SECUre NeighborhooD, that makes use of discrepancies in routing hop count information to detect ¿true¿ neighbors and remove those links to nodes that appear to be neighbors, but are really not neighbors. SECUND is simple, localized and needs no special hardware, localization, or synchronization. We present approaches to improve the efficiency of the process. We evaluate SECUND using simulations and we demonstrate its effectiveness in the presence of multiple and multi-ended wormholes.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8380","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The ability to correctly determine their neighborhood is a fundamental requirement for nodes in ad hoc and sensor networks. Many applications, protocols, and system functionality rely on neighborhood discovery. Malicious nodes that taint neighborhood information using wormholes can significantly disrupt the operation of ad hoc networks. Protocols that depend only on cryptographic techniques (e.g, authentication and encryption) may not be able to detect or prevent such attacks. In this paper we propose SECUND, a protocol for creating a SECUre NeighborhooD, that makes use of discrepancies in routing hop count information to detect ¿true¿ neighbors and remove those links to nodes that appear to be neighbors, but are really not neighbors. SECUND is simple, localized and needs no special hardware, localization, or synchronization. We present approaches to improve the efficiency of the process. We evaluate SECUND using simulations and we demonstrate its effectiveness in the presence of multiple and multi-ended wormholes.
用于在无线自组织网络中创建安全邻居的协议
正确确定其邻域的能力是自组织和传感器网络中节点的基本要求。许多应用程序、协议和系统功能依赖于邻域发现。利用虫洞污染邻域信息的恶意节点会严重破坏自组织网络的运行。仅依赖于加密技术(例如,身份验证和加密)的协议可能无法检测或阻止此类攻击。在本文中,我们提出了SECUND,一个用于创建安全邻居的协议,它利用路由跳数信息中的差异来检测“真正的”邻居,并删除那些看起来是邻居但实际上不是邻居的节点的链接。second简单、本地化,不需要特殊的硬件、本地化或同步。我们提出了提高这一过程效率的方法。我们通过模拟对second进行了评估,并证明了它在多个和多端虫洞存在下的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信