{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:48:25Z","timestamp":1772196505344,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,3,31]],"date-time":"2008-03-31T00:00:00Z","timestamp":1206921600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,3,31]]},"DOI":"10.1145\/1352533.1352552","type":"proceedings-article","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T16:11:28Z","timestamp":1207066288000},"page":"119-124","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimum node degree and \u03ba-connectivity for key predistribution schemes and distributed sensor networks"],"prefix":"10.1145","author":[{"given":"Jiang","family":"Wu","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,3,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/513800.513811"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","year":"2001","unstructured":"B. Bollob\u00e1s . Random Graphs . Cambridge University Press , second edition, 2001 . B. Bollob\u00e1s. Random Graphs. Cambridge University Press, second edition, 2001."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.892879"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-006-0085-4"},{"key":"e_1_3_2_1_5_1","first-page":"197","volume-title":"SP '03: Proceedings of the 2003 IEEE Symposium on Security and Privacy","author":"Chan H.","year":"2003","unstructured":"H. Chan , A. Perrig , and D. Song . Random key predistribution schemes for sensor setworks . In SP '03: Proceedings of the 2003 IEEE Symposium on Security and Privacy , page 197 , Washington, DC, USA , 2003 . IEEE Computer Society. H. Chan, A. Perrig, and D. Song. Random key predistribution schemes for sensor setworks. In SP '03: Proceedings of the 2003 IEEE Symposium on Security and Privacy, page 197, Washington, DC, USA, 2003. IEEE Computer Society."},{"key":"e_1_3_2_1_6_1","volume-title":"Order Statistics","author":"David H.","year":"1981","unstructured":"H. David . Order Statistics . John Wiley & amp; Sons, Inc., second edition, 1981 . H. David. Order Statistics. John Wiley & Sons, Inc., second edition, 1981."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029102.1029112"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of SecureComm 2006, the 2nd IEEE\/CreateNet International Conference on Security and Privacy in Communication Networks","author":"Di Pietro R.","year":"2006","unstructured":"R. Di Pietro , L. Mancini , A. Mei , A. Panconesi , and J. Radhakrishnan . How to design connected censor networks that are provably secure . In Proceedings of SecureComm 2006, the 2nd IEEE\/CreateNet International Conference on Security and Privacy in Communication Networks , 2006 . R. Di Pietro, L. Mancini, A. Mei, A. Panconesi, and J. Radhakrishnan. How to design connected censor networks that are provably secure. In Proceedings of SecureComm 2006, the 2nd IEEE\/CreateNet International Conference on Security and Privacy in Communication Networks, 2006."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065545.1065548"},{"key":"e_1_3_2_1_10_1","first-page":"17","volume-title":"Publ. Math. Inst. Hungar. Acad. Sci.","author":"Erd\u0151s P.","unstructured":"P. Erd\u0151s and A. R\u00e9nyi . On the evolution of random graphs . In Publ. Math. Inst. Hungar. Acad. Sci. , volume 3 , pages 17 -- 61 . P. Erd\u0151s and A. R\u00e9nyi. On the evolution of random graphs. In Publ. Math. Inst. Hungar. Acad. Sci., volume 3, pages 17--61."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586117"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(200003)16:2%3C156::AID-RSA3%3E3.0.CO;2-H"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70981-7_8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01389350"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1029102.1029111"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1330332.1330333"},{"key":"e_1_3_2_1_17_1","first-page":"1200","volume-title":"IEEE Wireless Communications and Networking Conference","volume":"2","author":"Lee J.","year":"2005","unstructured":"J. Lee and D. Stinson . A combinatorial approach to key predistribution for distributed sensor networks . In IEEE Wireless Communications and Networking Conference , volume 2 , pages 1200 -- 1205 , Mar. 2005 . J. Lee and D. Stinson. A combinatorial approach to key predistribution for distributed sensor networks. In IEEE Wireless Communications and Networking Conference, volume 2, pages 1200--1205, Mar. 2005."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1053283.1053287"},{"key":"e_1_3_2_1_19_1","unstructured":"E. Palmer. Graphical Evolution. John Wiley & Sons Inc. 1985.  E. Palmer. Graphical Evolution. John Wiley & Sons Inc. 1985."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"Penrose M.","year":"2003","unstructured":"M. Penrose . Random Geometric Graphs . Oxford University Press , 2003 . M. Penrose. Random Geometric Graphs. Oxford University Press, 2003."},{"key":"e_1_3_2_1_22_1","unstructured":"D. Stinson. Combinatorial Designs. Springer-Velag 2003.   D. Stinson. Combinatorial Designs. Springer-Velag 2003."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281492.1281494"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30564-4_20"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.2307\/2371086"}],"event":{"name":"WISEC '08: First ACM Conference on Wireless Network Security","location":"Alexandria VA USA","acronym":"WISEC '08","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the first ACM conference on Wireless network security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1352533.1352552","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1352533.1352552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:20Z","timestamp":1750253960000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1352533.1352552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,31]]},"references-count":24,"alternative-id":["10.1145\/1352533.1352552","10.1145\/1352533"],"URL":"https:\/\/doi.org\/10.1145\/1352533.1352552","relation":{},"subject":[],"published":{"date-parts":[[2008,3,31]]},"assertion":[{"value":"2008-03-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}