R. D. Pietro, L. Mancini, A. Mei, A. Panconesi, J. Radhakrishnan
{"title":"安全无线传感器网络的连接特性","authors":"R. D. Pietro, L. Mancini, A. Mei, A. Panconesi, J. Radhakrishnan","doi":"10.1145/1029102.1029112","DOIUrl":null,"url":null,"abstract":"We address the problem of connectivity in Secure Wireless Sensor Networks (SWSN) using random pre-distribution of keys. We propose a geometric random model for SWSNs. Under this new and realistic model, we describe how to design secure and connected networks using a small constant number of keys per sensor. Extensive simulations support the above stated result and demonstrate how connectivity can be guaranteed for a wide interval of practical network sizes and sensor communication ranges.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"44 9","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"87","resultStr":"{\"title\":\"Connectivity properties of secure wireless sensor networks\",\"authors\":\"R. D. Pietro, L. Mancini, A. Mei, A. Panconesi, J. Radhakrishnan\",\"doi\":\"10.1145/1029102.1029112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address the problem of connectivity in Secure Wireless Sensor Networks (SWSN) using random pre-distribution of keys. We propose a geometric random model for SWSNs. Under this new and realistic model, we describe how to design secure and connected networks using a small constant number of keys per sensor. Extensive simulations support the above stated result and demonstrate how connectivity can be guaranteed for a wide interval of practical network sizes and sensor communication ranges.\",\"PeriodicalId\":380051,\"journal\":{\"name\":\"ACM Workshop on Security of ad hoc and Sensor Networks\",\"volume\":\"44 9\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"87\",\"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/1029102.1029112\",\"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/1029102.1029112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Connectivity properties of secure wireless sensor networks
We address the problem of connectivity in Secure Wireless Sensor Networks (SWSN) using random pre-distribution of keys. We propose a geometric random model for SWSNs. Under this new and realistic model, we describe how to design secure and connected networks using a small constant number of keys per sensor. Extensive simulations support the above stated result and demonstrate how connectivity can be guaranteed for a wide interval of practical network sizes and sensor communication ranges.