Zahid Mahmood, Huansheng Ning, A. Ghafoor, R. Mehmood, R. Bie
{"title":"基于多项式子集的轻量级设备网络高效密钥管理","authors":"Zahid Mahmood, Huansheng Ning, A. Ghafoor, R. Mehmood, R. Bie","doi":"10.1109/IIKI.2016.30","DOIUrl":null,"url":null,"abstract":"Wireless Sensor Networks (WSNs) is highly vulnerable to security attacks because of resource-constrained wireless devices. Complex and resource intensive security schemes are infeasible and reduce the network lifetime. We have explored polynomial distribution based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied, and it becomes more costly when these polynomials are regenerated dynamically after each node join or leave operations. To reduce the computation overhead on a cluster head, we have proposed XOR based key management scheme. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs. Proposed XOR based calculation reduces 65% computing cost. The reduction of memory overheads is from p-bits to m-bits where m","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Polynomial Subset Based Efficient Key Management for Lightweight Devices Networks\",\"authors\":\"Zahid Mahmood, Huansheng Ning, A. Ghafoor, R. Mehmood, R. Bie\",\"doi\":\"10.1109/IIKI.2016.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless Sensor Networks (WSNs) is highly vulnerable to security attacks because of resource-constrained wireless devices. Complex and resource intensive security schemes are infeasible and reduce the network lifetime. We have explored polynomial distribution based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied, and it becomes more costly when these polynomials are regenerated dynamically after each node join or leave operations. To reduce the computation overhead on a cluster head, we have proposed XOR based key management scheme. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs. Proposed XOR based calculation reduces 65% computing cost. The reduction of memory overheads is from p-bits to m-bits where m\",\"PeriodicalId\":371106,\"journal\":{\"name\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"volume\":\"228 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIKI.2016.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIKI.2016.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Polynomial Subset Based Efficient Key Management for Lightweight Devices Networks
Wireless Sensor Networks (WSNs) is highly vulnerable to security attacks because of resource-constrained wireless devices. Complex and resource intensive security schemes are infeasible and reduce the network lifetime. We have explored polynomial distribution based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied, and it becomes more costly when these polynomials are regenerated dynamically after each node join or leave operations. To reduce the computation overhead on a cluster head, we have proposed XOR based key management scheme. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs. Proposed XOR based calculation reduces 65% computing cost. The reduction of memory overheads is from p-bits to m-bits where m