{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T21:21:12Z","timestamp":1768512072674,"version":"3.49.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["DAAD19-02- 1-0389"],"award-info":[{"award-number":["DAAD19-02- 1-0389"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014036","name":"MURI","doi-asserted-by":"crossref","award":["W 911 NF 0710287"],"award-info":[{"award-number":["W 911 NF 0710287"]}],"id":[{"id":"10.13039\/100014036","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Department of Electrical and Computer Engineering, Carnegie Mellon University"},{"name":"CyLab"},{"name":"National Science Foundation through the Berkeley TRUST STC","award":["CCF-0424422"],"award-info":[{"award-number":["CCF-0424422"]}]},{"name":"National Science Foundation through the Berkeley TRUST STC","award":["CNS-0831440"],"award-info":[{"award-number":["CNS-0831440"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1109\/tit.2015.2471295","type":"journal-article","created":{"date-parts":[[2015,8,21]],"date-time":"2015-08-21T15:00:33Z","timestamp":1440169233000},"page":"6251-6271","source":"Crossref","is-referenced-by-count":23,"title":["Toward <inline-formula> <tex-math notation=\"LaTeX\">$k$ <\/tex-math><\/inline-formula>-Connectivity of the Random Graph Induced by a Pairwise Key Predistribution Scheme With Unreliable Links"],"prefix":"10.1109","volume":"61","author":[{"given":"Faruk","family":"Yavuz","sequence":"first","affiliation":[]},{"given":"Jun","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Osman","family":"Yagan","sequence":"additional","affiliation":[]},{"given":"Virgil","family":"Gligor","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2425395"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620654"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.52474"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"36p","DOI":"10.37236\/523","article-title":"Sharp threshold functions for random intersection graphs via a coupling method","volume":"18","author":"rybarczyk","year":"2011","journal-title":"Electron J Combinat"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2006.315852"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"2314","DOI":"10.1016\/j.comcom.2007.04.009","article-title":"A survey of key management schemes in wireless sensor networks","volume":"30","author":"xiao","year":"2007","journal-title":"Comput Commun"},{"key":"ref16","article-title":"Random graph modeling of key distribution schemes in wireless sensor networks","author":"ya?an","year":"2011"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"3821","DOI":"10.1109\/TIT.2012.2189353","article-title":"Performance of the Eschenauer–Gligor key distribution scheme under an ON\/OFF channel","volume":"58","author":"ya?an","year":"2012","journal-title":"IEEE Trans Inf Theory"},{"key":"ref18","first-page":"1","article-title":"Designing securely connected wireless sensor networks in the presence of unreliable links","author":"ya?an","year":"2011","journal-title":"Proc IEEE Int Conf Commun (ICC)"},{"key":"ref19","first-page":"257","article-title":"On the gradual deployment of random pairwise key distribution schemes","author":"ya?an","year":"2011","journal-title":"Proc Int Symp WiOpT"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1341731.1341734"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875009"},{"key":"ref3","first-page":"197","article-title":"Random key predistribution schemes for sensor networks","author":"chan","year":"2003","journal-title":"Proc IEEE S&P"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620734"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/586115.586117"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","article-title":"On the strength of connectedness of a random graph","volume":"12","author":"erd?s","year":"1961","journal-title":"Acta Math Acad Sci Hungarica"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2015.7151072"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579431"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346079"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(01)00302-4"},{"key":"ref20","first-page":"1797","article-title":"Connectivity results for sensor networks under a random pairwise key predistribution scheme","author":"ya?an","year":"2012","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"5754","DOI":"10.1109\/TIT.2013.2265694","article-title":"On the connectivity of sensor networks under random pairwise key predistribution","volume":"59","author":"ya?an","year":"2013","journal-title":"IEEE Trans Inf Theory"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1109\/TIT.2012.2219578","article-title":"Modeling the pairwise key predistribution scheme in the presence of unreliable links","volume":"59","author":"ya?an","year":"2013","journal-title":"IEEE Trans Inf Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875260"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.peva.2013.03.001","article-title":"On the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes","volume":"70","author":"ya?an","year":"2013","journal-title":"Perform Eval"},{"key":"ref26","author":"yavuz","year":"2015","journal-title":"A Zero-One Law for k-Connectivity in Random K-Out Graphs Intersecting Erd?s–Rényi Graphs"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7249324"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7299738\/07217823.pdf?arnumber=7217823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:45:42Z","timestamp":1641987942000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7217823\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11]]},"references-count":30,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2471295","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11]]}}}