{"title":"无线传感器网络中的密钥预分配与平均距离","authors":"S. Lawrence, Liao Qiaoliang, N. Mary, Fujian Bo","doi":"10.1109/ICCNT.2010.98","DOIUrl":null,"url":null,"abstract":"In this paper, we present an approach for improving key pre-distribution in wireless sensor networks by considering the average distance between the nodes. We compare and demonstrate that by incorporating a master key in the random pair-wise scheme, it is possible to reduce the average distance between the nodes and increase the network coverage. Our approach has the following characteristics: authenticity, scalability, flexibility and resistance to node capture. Experimental results showed that our approach is more scalable than its counterparts in random pair-wise scheme.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Key Pre-Distribution and the Average Distance in Wireless Sensor Networks\",\"authors\":\"S. Lawrence, Liao Qiaoliang, N. Mary, Fujian Bo\",\"doi\":\"10.1109/ICCNT.2010.98\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an approach for improving key pre-distribution in wireless sensor networks by considering the average distance between the nodes. We compare and demonstrate that by incorporating a master key in the random pair-wise scheme, it is possible to reduce the average distance between the nodes and increase the network coverage. Our approach has the following characteristics: authenticity, scalability, flexibility and resistance to node capture. Experimental results showed that our approach is more scalable than its counterparts in random pair-wise scheme.\",\"PeriodicalId\":135847,\"journal\":{\"name\":\"2010 Second International Conference on Computer and Network Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Computer and Network Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNT.2010.98\",\"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 Second International Conference on Computer and Network Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNT.2010.98","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Key Pre-Distribution and the Average Distance in Wireless Sensor Networks
In this paper, we present an approach for improving key pre-distribution in wireless sensor networks by considering the average distance between the nodes. We compare and demonstrate that by incorporating a master key in the random pair-wise scheme, it is possible to reduce the average distance between the nodes and increase the network coverage. Our approach has the following characteristics: authenticity, scalability, flexibility and resistance to node capture. Experimental results showed that our approach is more scalable than its counterparts in random pair-wise scheme.