{"title":"开关通信信道下的Eschenauer-Gligor密钥预分发方案:无孤立节点","authors":"A. Makowski, Osman Yağan","doi":"10.1109/ALLERTON.2015.7447186","DOIUrl":null,"url":null,"abstract":"We consider the Eschenauer-Gligor key predistribution scheme under the condition of partial visibility with i.i.d. on-off links between pairs of nodes. This situation is modeled as the intersection of two random graphs, namely a random key graph and an Erdös-Rényi (ER) graph. For this class of composite random graphs we give various improvements on a recent result by Yağan [17] concerning zero-one laws for the absence of isolated nodes.","PeriodicalId":112948,"journal":{"name":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes\",\"authors\":\"A. Makowski, Osman Yağan\",\"doi\":\"10.1109/ALLERTON.2015.7447186\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the Eschenauer-Gligor key predistribution scheme under the condition of partial visibility with i.i.d. on-off links between pairs of nodes. This situation is modeled as the intersection of two random graphs, namely a random key graph and an Erdös-Rényi (ER) graph. For this class of composite random graphs we give various improvements on a recent result by Yağan [17] concerning zero-one laws for the absence of isolated nodes.\",\"PeriodicalId\":112948,\"journal\":{\"name\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ALLERTON.2015.7447186\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2015.7447186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes
We consider the Eschenauer-Gligor key predistribution scheme under the condition of partial visibility with i.i.d. on-off links between pairs of nodes. This situation is modeled as the intersection of two random graphs, namely a random key graph and an Erdös-Rényi (ER) graph. For this class of composite random graphs we give various improvements on a recent result by Yağan [17] concerning zero-one laws for the absence of isolated nodes.