Adaptive key management for wireless sensor networks

Tony Cheneau, M. Ranganathan
{"title":"Adaptive key management for wireless sensor networks","authors":"Tony Cheneau, M. Ranganathan","doi":"10.1109/GLOCOM.2013.6831103","DOIUrl":null,"url":null,"abstract":"Network security protocols for wireless sensor networks (WSN) require each node to store context information, such as cryptographic keys, for each active security association that it maintains with its peers. While the storage requirements for such context information is generally small enough to be overlooked in regular networks, it becomes an important issue in memory-constrained WSN. Under such constraints, a WSN node may become memory saturated and thereby become unable to accommodate new nodes dynamically. What can be done to keep expanding the network with newly joining nodes under such memory constraints? How many security associations are `enough' and how does the choice of the number of associations affect performance and coverage? To address these issues, we introduce a novel authentication and key management mechanism called Adaptive Key Management (AKM) that is robust and scalable under limited memory constraints and works along with the RPL routing protocol to provide strong security guarantees. We present a simulation study of AKM to demonstrate its scalability and to provide insight on how to allocate a node's memory to store a sufficient number of security associations.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2013.6831103","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Network security protocols for wireless sensor networks (WSN) require each node to store context information, such as cryptographic keys, for each active security association that it maintains with its peers. While the storage requirements for such context information is generally small enough to be overlooked in regular networks, it becomes an important issue in memory-constrained WSN. Under such constraints, a WSN node may become memory saturated and thereby become unable to accommodate new nodes dynamically. What can be done to keep expanding the network with newly joining nodes under such memory constraints? How many security associations are `enough' and how does the choice of the number of associations affect performance and coverage? To address these issues, we introduce a novel authentication and key management mechanism called Adaptive Key Management (AKM) that is robust and scalable under limited memory constraints and works along with the RPL routing protocol to provide strong security guarantees. We present a simulation study of AKM to demonstrate its scalability and to provide insight on how to allocate a node's memory to store a sufficient number of security associations.
无线传感器网络的自适应密钥管理
无线传感器网络(WSN)的网络安全协议要求每个节点存储上下文信息,例如它与其对等节点维护的每个活动安全关联的加密密钥。虽然这些上下文信息的存储需求通常很小,在常规网络中可以忽略,但在内存受限的WSN中,这成为一个重要问题。在这种约束下,WSN节点可能会内存饱和,从而无法动态容纳新节点。在这样的内存限制下,如何用新加入的节点继续扩展网络?多少个安全关联是“足够的”?选择多少个安全关联会如何影响性能和覆盖率?为了解决这些问题,我们引入了一种新的身份验证和密钥管理机制,称为自适应密钥管理(AKM),它在有限的内存约束下具有鲁棒性和可伸缩性,并与RPL路由协议一起工作,以提供强大的安全保证。我们提出了AKM的模拟研究,以展示其可伸缩性,并提供关于如何分配节点内存以存储足够数量的安全关联的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信