{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:51:06Z","timestamp":1755600666348},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_49","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:44:46Z","timestamp":1312879486000},"page":"544-555","source":"Crossref","is-referenced-by-count":6,"title":["Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols"],"prefix":"10.1007","author":[{"given":"K.","family":"Krzywdzi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Rybarczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"16","key":"49_CR1","doi-asserted-by":"publisher","first-page":"5130","DOI":"10.1016\/j.disc.2009.03.042","volume":"309","author":"S.R. Blackburn","year":"2009","unstructured":"Blackburn, S.R., Gerke, S.: Connectivity of the uniform random intersection graph. Discrete Mathematics\u00a0309(16), 5130\u20135140 (2009)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"49_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.20256","volume":"53","author":"M. Bloznelis","year":"2009","unstructured":"Bloznelis, M., Jaworski, J., Rybarczyk, K.: Component evolution in a secure wireless sensor network. Networks\u00a053(1), 19\u201326 (2009)","journal-title":"Networks"},{"key":"49_CR3","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B.: Random Graphs. Academic Press, London (1985)"},{"key":"49_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1109\/18.52474","volume":"36","author":"B. Bollob\u00e1s","year":"1990","unstructured":"Bollob\u00e1s, B.: The diameter of random graphs. IEEE Trans. Inform. Theory\u00a036, 285\u2013288 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"49_CR5","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P. Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless network. Wireless Networks\u00a07(6), 609\u2013616 (2001)","journal-title":"Wireless Networks"},{"key":"49_CR6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/SECPRI.2003.1199337","volume-title":"SP 2003: Proceedings of the 2003 IEEE Symposium on Security and Privacy","author":"H. Chan","year":"2003","unstructured":"Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: SP 2003: Proceedings of the 2003 IEEE Symposium on Security and Privacy, Washington, DC, USA, pp. 197\u2013213. IEEE Computer Society, Los Alamitos (2003)"},{"issue":"4","key":"49_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/aama.2001.0720","volume":"26","author":"F. Chung","year":"2001","unstructured":"Chung, F., Lu, L.: The diameter of sparse random graphs. Adv. in Appl. Math.\u00a026(4), 257\u2013279 (2001)","journal-title":"Adv. in Appl. Math."},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Di Pietro, R., Mancini, L.V., Mei, A., Panconesi, A., Radhakrishnan, J.: Sensor networks that are provably resilient. In: Proc. 2nd IEEE Int Conf Security Privacy Emerging Areas Commun Networks (SecureComm 2006), Baltimore, MD (2006)","DOI":"10.1109\/SECCOMW.2006.359569"},{"issue":"4","key":"49_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S0129626400000329","volume":"10","author":"J. Diaz","year":"2000","unstructured":"Diaz, J., Petit, J., Serna, M.: Faulty random geometric networks. Parallel Processing Letters\u00a010(4), 343\u2013357 (2000)","journal-title":"Parallel Processing Letters"},{"key":"49_CR10","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. Debrecen\u00a06, 290\u2013297 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"49_CR11","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci.\u00a05, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/586110.586117","volume-title":"CCS 2002: Proceedings of the 9th ACM Conference on Computer and Communications Security","author":"L. Eschenauer","year":"2002","unstructured":"Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: CCS 2002: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41\u201347. ACM Press, New York (2002)"},{"key":"49_CR13","first-page":"67","volume-title":"Studies in Classifcation, Data Analysis and Knowledge Organization","author":"E. Godehardt","year":"2003","unstructured":"Godehardt, E., Jaworski, J.: Two models of random intersection graphs for classifcation. In: Studies in Classifcation, Data Analysis and Knowledge Organization, pp. 67\u201381. Springer, Heidelberg (2003)"},{"key":"49_CR14","first-page":"547","volume-title":"Critical Power for Asymptotic Connectivity in Wireless Networks","author":"P. Gupta","year":"1998","unstructured":"Gupta, P., Kumar, P.R.: Critical Power for Asymptotic Connectivity in Wireless Networks. In: Critical Power for Asymptotic Connectivity in Wireless Networks, pp. 547\u2013566. Birkhauser, Basel (1998)"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/1029102.1029111","volume-title":"SASN 2004: Proceedings of the 2nd ACM Workshop on Security of ad Hoc and Sensor Networks","author":"J. Hwang","year":"2004","unstructured":"Hwang, J., Kim, Y.: Revisiting random key pre-distribution schemes for wireless sensor networks. In: SASN 2004: Proceedings of the 2nd ACM Workshop on Security of ad Hoc and Sensor Networks, pp. 43\u201352. ACM, New York (2004)"},{"key":"49_CR16","volume-title":"Random Graphs","author":"S. Janson","year":"2001","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, Chichester (2001)"},{"issue":"1\u20132","key":"49_CR17","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00607-009-0036-9","volume":"85","author":"J. Jaworski","year":"2009","unstructured":"Jaworski, J., Ren, M., Rybarczyk, K.: Random key predistribution for wireless sensor networks using deployment knowledge. Computing\u00a085(1\u20132), 57\u201376 (2009)","journal-title":"Computing"},{"key":"49_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1017\/S0963548398003459","volume":"8","author":"M. Karo\u0144ski","year":"1999","unstructured":"Karo\u0144ski, M., Scheinerman, E.R., Singer-Cohen, K.B.: On random intersection graphs: The subgraph problem. Combinatorics, Probability and Computing\u00a08, 131\u2013159 (1999)","journal-title":"Combinatorics, Probability and Computing"},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp. 243\u2013254 (2000)","DOI":"10.1145\/345910.345953"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proceedings of the 4th ACM International Symposium on Mobile ad Hoc Networking & Computing, pp. 267\u2013278 (2003)","DOI":"10.1145\/778415.778447"},{"key":"49_CR21","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M. Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)"},{"key":"49_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-642-04128-0_47","volume-title":"Algorithms - ESA 2009","author":"A. Pettarin","year":"2009","unstructured":"Pettarin, A., Pietracaprina, A., Pucci, G.: On the expansion and diameter of bluetooth-like topologies. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 528\u2013539. Springer, Heidelberg (2009)"},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Rybarczyk, K.: Diameter, connectivity, and phase transition of the uniform random intersection graph. Discrete Mathematics (2011), doi:10.1016\/j.disc.2011.05.029.","DOI":"10.1016\/j.disc.2011.05.029"},{"key":"49_CR24","unstructured":"Singer-Cohen, K.B.: Random intersection graphs. PhD Thesis, Department of Mathematical Sciences, The Johns Hopkins University (1995)"},{"key":"49_CR25","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1132905.1132909","volume-title":"Proceedings of the 7th ACM International Symposium on Mobile ad Hoc Networking and Computing, MobiHoc 2006","author":"P.-J. Wan","year":"2006","unstructured":"Wan, P.-J., Yi, C.-W., Yao, F., Jia, X.: Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks. In: Proceedings of the 7th ACM International Symposium on Mobile ad Hoc Networking and Computing, MobiHoc 2006, pp. 25\u201336. ACM, New York (2006)"},{"issue":"1","key":"49_CR26","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1142\/S1793830910000516","volume":"2","author":"C.-W. Yi","year":"2010","unstructured":"Yi, C.-W., Wan, P.-J., Lin, K.-W., Huang, C.-H.: Asymptotic distribution of the number of isolated nodes in wireless ad hoc networks with unreliable nodes and links. Discrete Mathematics, Algorithms, and Applications\u00a02(1), 107\u2013124 (2010)","journal-title":"Discrete Mathematics, Algorithms, and Applications"},{"issue":"3","key":"49_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1362542.1362543","volume":"4","author":"M.Z. Zamalloa","year":"2008","unstructured":"Zamalloa, M.Z., Seada, K., Krishnamachari, B., Helmy, A.: Efficient geographic routing over lossy links in wireless sensor networks. ACM Transactions on Sensor Networks (TOSN)\u00a04(3), 1\u201333 (2008)","journal-title":"ACM Transactions on Sensor Networks (TOSN)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T12:50:09Z","timestamp":1686228609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}