{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:14:03Z","timestamp":1648581243432},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T00:00:00Z","timestamp":1576195200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T00:00:00Z","timestamp":1576195200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["CCF Trans. Netw."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s42045-019-00027-5","type":"journal-article","created":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T11:03:54Z","timestamp":1576235034000},"page":"81-92","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resilient and secure wireless sensor network under non-full visibility"],"prefix":"10.1007","volume":"3","author":[{"given":"Bhupendra","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyoti","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,13]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.2307\/1428076","volume":"29","author":"MJB Appel","year":"1997","unstructured":"Appel, M.J.B., Russo, R.P.: The maximum vertex degree of a graph on the uniform points in $$[0, 1]^d$$. Adv. Appl. Prob. 29, 567\u2013581 (1997a)","journal-title":"Adv. Appl. Prob."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"582","DOI":"10.2307\/1428077","volume":"29","author":"MJB Appel","year":"1997","unstructured":"Appel, M.J.B., Russo, R.P.: The minimum vertex degree of a graph on the uniform points in $$[0, 1]^d$$. Adv. Appl. Prob. 29, 582\u2013594 (1997b)","journal-title":"Adv. Appl. Prob."},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0167-7152(02)00233-X","volume":"60","author":"MJB Appel","year":"2002","unstructured":"Appel, M.J.B., Russo, R.P.: The connectivity of a graph on uniform points in $$[0, 1]^d$$. Stat. Prob. Lett. 60, 351\u2013357 (2002)","journal-title":"Stat. Prob. Lett."},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1049\/iet-wss.2011.0085","volume":"2","author":"M Ashouri","year":"2012","unstructured":"Ashouri, M., Zali, Z., Mousavi, S.R., Hashemi, M.R.: New optimal solution to disjoint set K-coverage for lifetime extension in wireless sensor networks. IET Wireless Sens. Syst. 2(1), 31\u201339 (2012)","journal-title":"IET Wireless Sens. Syst."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"5130","DOI":"10.1016\/j.disc.2009.03.042","volume":"309","author":"SR Blackburn","year":"2009","unstructured":"Blackburn, S.R., Gerke, S.: Connectivity of the uniform random intersection graph. Discr. Math. 309, 5130\u20135140 (2009)","journal-title":"Discr. Math."},{"key":"27_CR6","unstructured":"Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Security and Privacy (2003)"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.2307\/3214317","volume":"26","author":"H Dette","year":"1989","unstructured":"Dette, H., Henze, N.: The limit distribution of the largest nearest neighbor link in the unit D-cube. J. Appl. Prob. 26, 67\u201380 (1989)","journal-title":"J. Appl. Prob."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Di Pietro, R., Mancini, L.V., Mei, A., Panconesi, A., Radhakrishnan, J.: Connectivity properties of secure wireless sensor networks, SASN 04, USA (2004)","DOI":"10.1145\/1029102.1029112"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Di Pietro, R., Mancini, L.V., Mei, A., Panconesi, A., Radhakrishnan, J.: Redoubtable sensor networks. ACM Transaction on Information System Security, TISSEC11, pp. 1\u201322 (2008)","DOI":"10.1145\/1341731.1341734"},{"key":"27_CR10","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos, P., Renyi, A.: On the evalution of random graph. Publ. Math. Inst. Hunger. Acad. Sci. 5, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hunger. Acad. Sci."},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Eschenauer, L., Gligor, Virgil D.: A key-management scheme for distributed sensor networks. In: 9th ACM conference on computer and communication security (2002)","DOI":"10.1145\/586110.586117"},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/0109045","volume":"9","author":"EN Gilbert","year":"1961","unstructured":"Gilbert, E.N.: Random plane networks. J. Soc. Ind. Appl. Math. 9, 533\u2013553 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"19","key":"27_CR13","doi-asserted-by":"publisher","first-page":"2020","DOI":"10.1016\/j.spl.2009.06.011","volume":"79","author":"B Gupta","year":"2009","unstructured":"Gupta, B.: Vertex degree of random geometric graph on exponentially distributed points. Stat. Probab. Lett. 79(19), 2020\u20132027 (2009)","journal-title":"Stat. Probab. Lett."},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1239\/aap\/1282924057","volume":"42","author":"B Gupta","year":"2010","unstructured":"Gupta, B., Iyer, S.K.: Criticality of the exponential rate of decay for the largest nearest neighbor link in random geometric graphs. Adv. Appl. Prob. 42(3), 631\u2013658 (2010)","journal-title":"Adv. Appl. Prob."},{"issue":"3","key":"27_CR15","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1007\/s11277-015-2845-9","volume":"85","author":"B Gupta","year":"2015","unstructured":"Gupta, B., Pandey, J.: Non-existence of Isolated nodes in secure wireless sensor network. Wireless Pers. Commun. 85(3), 1367\u20131380 (2015)","journal-title":"Wireless Pers. Commun."},{"issue":"2","key":"27_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/rsa.20174","volume":"32","author":"B Gupta","year":"2008","unstructured":"Gupta, B., Iyer, S.K., Manjunath, D.: On the topological properties of one dimensional exponential random geometric graph. Random Struct. Algorithm 32(2), 181\u2013204 (2008)","journal-title":"Random Struct. Algorithm"},{"key":"27_CR17","unstructured":"Internet Engineering Task Force. Diffie-hellman Key Agreement Method. http:\/\/tools.ietf.org\/html\/rfc2631"},{"issue":"3","key":"27_CR18","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1049\/iet-wss.2011.0064","volume":"2","author":"SH Jokhio","year":"2012","unstructured":"Jokhio, S.H., Jokhio, I.A., Kemp, A.H.: Node capture attack detection and defence in wireless sensor networks. IET Wireless Sens. Syst. 2(3), 161\u2013169 (2012)","journal-title":"IET Wireless Sens. Syst."},{"issue":"9","key":"27_CR20","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/35.312841","volume":"32","author":"BC Neuman","year":"1994","unstructured":"Neuman, B.C., Ts\u2019o, T.: Kerberos: an authentication service for computer networks. IEEE Commun. Mag. 32(9), 33\u201338 (1994)","journal-title":"IEEE Commun. Mag."},{"key":"27_CR21","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1239\/aap\/1035228120","volume":"30","author":"MD Penrose","year":"1998","unstructured":"Penrose, M.D.: Extremes for the minimal spanning tree on the normally distributed points. Adv. Appl. Prob. 30, 628\u2013639 (1998)","journal-title":"Adv. Appl. Prob."},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1002\/(SICI)1098-2418(199909)15:2<145::AID-RSA2>3.0.CO;2-G","volume":"15","author":"MD Penrose","year":"1999","unstructured":"Penrose, M.D.: On $$k$$-connectivity for a random geometric graph. Random Struct. Algorithms 15, 145\u2013164 (1999)","journal-title":"Random Struct. Algorithms"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1112\/S0024610799008157","volume":"60","author":"MD Penrose","year":"1999","unstructured":"Penrose, M.D.: A strong law for the largest nearest neighbor link between random points. J. Lond. Math. Soc. 60, 951\u2013960 (1999)","journal-title":"J. Lond. Math. Soc."},{"key":"27_CR24","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"MD Penrose","year":"2003","unstructured":"Penrose, M.D.: Random Geometric Graphs, 2nd edn. Oxford University Press, Oxford (2003)","edition":"2"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Yagan, O., Makowski, A.M.: Connectivity in random graphs induced by a key predistribution scheme: small key pools. In: 44th Annual Conference on Information Science System, pp. 1\u20136 (2010)","DOI":"10.1109\/CISS.2010.5464934"},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Yagan, O., Makowski, A.M.: Connectivity results for random key graphs. In: IEEE international symposium information theory, pp. 2403\u20132407 (2009)","DOI":"10.1109\/ISIT.2009.5206014"},{"key":"27_CR28","unstructured":"Yagan, O., Makowski, A.M.: Key ring sizes in the random pairwise key distribution scheme. In: 23rd IEEE international symposium on personal, indoor and mobile radio communications (PIMRC 2011) (2011)"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Yagan, O., Makowski, A.M.: On the random graph induced by a random key predistribution scheme under full visibility (extended version). In: Proceeding of IEEE International Symposium on Information Theory (ISIT 2008), pp. 544\u2013548 (2008)","DOI":"10.1109\/ISIT.2008.4595045"}],"container-title":["CCF Transactions on Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42045-019-00027-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s42045-019-00027-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s42045-019-00027-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T00:54:24Z","timestamp":1607734464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s42045-019-00027-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,13]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["27"],"URL":"https:\/\/doi.org\/10.1007\/s42045-019-00027-5","relation":{},"ISSN":["2520-8462","2520-8470"],"issn-type":[{"value":"2520-8462","type":"print"},{"value":"2520-8470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,13]]},"assertion":[{"value":"10 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}