{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:31:33Z","timestamp":1729632693928,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1109\/isit.2014.6874832","type":"proceedings-article","created":{"date-parts":[[2014,8,19]],"date-time":"2014-08-19T21:50:30Z","timestamp":1408485030000},"page":"246-250","source":"Crossref","is-referenced-by-count":12,"title":["Minimum node degree and k-connectivity in wireless networks with unreliable links"],"prefix":"10.1109","author":[{"given":"Jun","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs, I","volume":"6","author":"erdos","year":"1959","journal-title":"Publicationes Mathematicae (Debrecen)"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.11"},{"journal-title":"K-connectivity in Secure Wireless Sensor Networks with Physical Link Constraints - The On\/off Channel Model","year":"2012","author":"zhao","key":"18"},{"key":"15","doi-asserted-by":"crossref","DOI":"10.1007\/11523468_55","article-title":"On the cover time of random geometric graphs","author":"avin","year":"2005","journal-title":"Automata Languages and Programming"},{"key":"16","first-page":"989","article-title":"The bin-covering technique for thresholding random geometric graph properties","author":"muthukrishnan","year":"2005","journal-title":"Proc of ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"journal-title":"Towards K-connectivity in Wireless Networks with Unreliable Links","year":"2014","author":"zhao","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/2030613.2030651"},{"key":"11","doi-asserted-by":"crossref","first-page":"2535","DOI":"10.1109\/TSP.2007.914343","article-title":"On the impact of node failures and unreliable communications in dense sensor networks","volume":"56","author":"tay","year":"2008","journal-title":"IEEE Transactions on Signal Processing"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2011.5762818"},{"key":"21","first-page":"261","article-title":"On the strength of connectedness of random graphs","author":"erdos","year":"1961","journal-title":"Acta Math Acad Sci Hungar"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ISCCSP.2012.6217860"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706098"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875009"},{"key":"24","article-title":"Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with unreliable nodes and links","author":"yi","year":"2006","journal-title":"Proc of IEEE Globecom"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718"},{"key":"3","first-page":"547","article-title":"Critical power for asymptotic connectivity in wireless networks","author":"gupta","year":"1998","journal-title":"Proc of IEEE CDC"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7039959"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354532"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/778415.778431"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620734"},{"journal-title":"Connectivity of Soft Random Geometric Graphs","year":"2013","author":"penrose","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199909)15:2<145::AID-RSA2>3.0.CO;2-G"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875260"},{"key":"9","article-title":"Brief encounters with a random key graph","volume":"7028","author":"gligor","year":"2013","journal-title":"Proc of Security Protocols Workshop (SPW) 2009"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/989459.989461"}],"event":{"name":"2014 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2014,6,29]]},"location":"Honolulu, HI, USA","end":{"date-parts":[[2014,7,4]]}},"container-title":["2014 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6867217\/6874773\/06874832.pdf?arnumber=6874832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T04:09:07Z","timestamp":1689480547000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6874832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit.2014.6874832","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]}}}