Takashi Ito, H. Ohta, Nori Matsuda, Takeshi Yoneda
{"title":"基于节点部署概率密度函数的安全传感器网络密钥预分配方案","authors":"Takashi Ito, H. Ohta, Nori Matsuda, Takeshi Yoneda","doi":"10.1145/1102219.1102233","DOIUrl":null,"url":null,"abstract":"Pairwise key establishment is a fundamental service provided in secure sensor networks. However, due to resource constraints, establishing pairwise keys is not a trivial task. Recently, a random key pre-distribution scheme and its improvements have been proposed. The scheme proposed by Du et al. uses deployment knowledge to improve the performance and security of sensor networks. However, this scheme assumes group-based deployment in which groups of nodes are deployed from horizontal grid points. This assumption limits applications of the scheme. Therefore, in this paper, we propose an advanced key pre-distribution scheme in which different keys are logically mapped to two-dimensional positions, and the keys that are distributed to a node are determined by positions estimated using a node probability density function. The scheme can be applied to any deployment model provided the node probability density function has already been determined. Furthermore, simulation results show that our scheme achieves higher connectivity than Du et al.'s scheme.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"62","resultStr":"{\"title\":\"A key pre-distribution scheme for secure sensor networks using probability density function of node deployment\",\"authors\":\"Takashi Ito, H. Ohta, Nori Matsuda, Takeshi Yoneda\",\"doi\":\"10.1145/1102219.1102233\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Pairwise key establishment is a fundamental service provided in secure sensor networks. However, due to resource constraints, establishing pairwise keys is not a trivial task. Recently, a random key pre-distribution scheme and its improvements have been proposed. The scheme proposed by Du et al. uses deployment knowledge to improve the performance and security of sensor networks. However, this scheme assumes group-based deployment in which groups of nodes are deployed from horizontal grid points. This assumption limits applications of the scheme. Therefore, in this paper, we propose an advanced key pre-distribution scheme in which different keys are logically mapped to two-dimensional positions, and the keys that are distributed to a node are determined by positions estimated using a node probability density function. The scheme can be applied to any deployment model provided the node probability density function has already been determined. Furthermore, simulation results show that our scheme achieves higher connectivity than Du et al.'s scheme.\",\"PeriodicalId\":380051,\"journal\":{\"name\":\"ACM Workshop on Security of ad hoc and Sensor Networks\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"62\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Workshop on Security of ad hoc and Sensor Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1102219.1102233\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Workshop on Security of ad hoc and Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1102219.1102233","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A key pre-distribution scheme for secure sensor networks using probability density function of node deployment
Pairwise key establishment is a fundamental service provided in secure sensor networks. However, due to resource constraints, establishing pairwise keys is not a trivial task. Recently, a random key pre-distribution scheme and its improvements have been proposed. The scheme proposed by Du et al. uses deployment knowledge to improve the performance and security of sensor networks. However, this scheme assumes group-based deployment in which groups of nodes are deployed from horizontal grid points. This assumption limits applications of the scheme. Therefore, in this paper, we propose an advanced key pre-distribution scheme in which different keys are logically mapped to two-dimensional positions, and the keys that are distributed to a node are determined by positions estimated using a node probability density function. The scheme can be applied to any deployment model provided the node probability density function has already been determined. Furthermore, simulation results show that our scheme achieves higher connectivity than Du et al.'s scheme.