{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:45:30Z","timestamp":1648640730894},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,1,29]],"date-time":"2015-01-29T00:00:00Z","timestamp":1422489600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s11276-015-0900-9","type":"journal-article","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T16:09:04Z","timestamp":1422461344000},"page":"2055-2068","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Snapshot: a forwarding strategy based on analyzing network topology in opportunistic networks"],"prefix":"10.1007","volume":"21","author":[{"given":"Junyeop","family":"Lee","sequence":"first","affiliation":[]},{"given":"Sun-Kyum","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Ji-Hyeun","family":"Yoon","sequence":"additional","affiliation":[]},{"given":"Sung-Bong","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,29]]},"reference":[{"key":"900_CR1","doi-asserted-by":"crossref","unstructured":"Boldrini, C., Conti, M., Jacopini, J., & Passarella, A. (2007). Hibop: A history based routing protocol for opportunistic networks. In Proceedings of WoWMoM 2007 (pp. 1\u201312).","DOI":"10.1109\/WOWMOM.2007.4351716"},{"issue":"9","key":"900_CR2","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1016\/j.comcom.2010.01.013","volume":"33","author":"C Boldrini","year":"2010","unstructured":"Boldrini, C., & Passarella, A. (2010). HCMM: Modelling spatial and temporal properties of human mobility driven by users\u2019 social relationships. Computer Communications, 33(9), 1056\u20131074.","journal-title":"Computer Communications"},{"key":"900_CR3","volume-title":"Analyzing social networks","author":"SP Borgatti","year":"2013","unstructured":"Borgatti, S. P., Everett, M. G., & Johnson, J. C. (2013). Analyzing social networks. Washington, DC: SAGE Publications Limited."},{"issue":"4","key":"900_CR4","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.adhoc.2007.05.002","volume":"6","author":"B Burns","year":"2008","unstructured":"Burns, B., Brock, O., & Levine, B. N. (2008). MORA routing and capacity building in disruption-tolerant networks. Ad Hoc Networks, 6(4), 600\u2013620.","journal-title":"Ad Hoc Networks"},{"key":"900_CR5","unstructured":"Chung, F. R. (1997). Spectral graph theory (Vol. 92). Washington, DC: American Mathematical Society."},{"issue":"9","key":"900_CR6","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/MCOM.2010.5560597","volume":"48","author":"M Conti","year":"2010","unstructured":"Conti, M., Giordano, S., May, M., & Passarella, A. (2010). From opportunistic networks to opportunistic computing. IEEE Communications Magazine, 48(9), 126\u2013139.","journal-title":"IEEE Communications Magazine"},{"issue":"1","key":"900_CR7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/MC.2010.19","volume":"43","author":"M Conti","year":"2010","unstructured":"Conti, M., & Kumar, M. (2010). Opportunities in opportunistic computing. IEEE Computer, 43(1), 42\u201350.","journal-title":"IEEE Computer"},{"issue":"5","key":"900_CR8","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/TMC.2008.161","volume":"8","author":"EM Daly","year":"2009","unstructured":"Daly, E. M., & Haahr, M. (2009). Social network analysis for information flow in disconnected delay-tolerant MANETs. IEEE Transactions on Mobile Computing, 8(5), 606\u2013621.","journal-title":"IEEE Transactions on Mobile Computing"},{"issue":"6","key":"900_CR9","doi-asserted-by":"crossref","first-page":"1874","DOI":"10.1109\/TWC.2010.06.081216","volume":"9","author":"H Dang","year":"2010","unstructured":"Dang, H., & Wu, H. (2010). Clustering and cluster-based routing protocol for delay-tolerant mobile networks. IEEE Transactions on Wireless Communications, 9(6), 1874\u20131881.","journal-title":"IEEE Transactions on Wireless Communications"},{"issue":"2","key":"900_CR10","first-page":"3","volume":"1","author":"A Doria","year":"2009","unstructured":"Doria, A., Uden, M., & Pandey, D. (2009). Providing connectivity to the saami nomadic community. Generations, 1(2), 3.","journal-title":"Generations"},{"issue":"3","key":"900_CR11","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/s11276-008-0158-6","volume":"16","author":"A Ferreira","year":"2010","unstructured":"Ferreira, A., Goldman, A., & Monteiro, J. (2010). Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, 16(3), 627\u2013640.","journal-title":"Wireless Networks"},{"key":"900_CR12","volume-title":"Variational methods for eigenvalue problems: An introduction to the methods of Rayleigh, Ritz, Weinstein, and Aronszajn","author":"SH Gould","year":"1995","unstructured":"Gould, S. H. (1995). Variational methods for eigenvalue problems: An introduction to the methods of Rayleigh, Ritz, Weinstein, and Aronszajn. Mineola: Courier Dover."},{"issue":"1","key":"900_CR13","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.peva.2005.07.018","volume":"62","author":"R Groenevelt","year":"2005","unstructured":"Groenevelt, R., Nain, P., & Koole, G. (2005). The message delay in mobile ad hoc networks. Performance Evaluation, 62(1), 210\u2013228.","journal-title":"Performance Evaluation"},{"key":"900_CR14","doi-asserted-by":"crossref","unstructured":"Grossglauser, M., & Tse, D. (2001). Mobility increases the capacity of ad-hoc wireless networks. In Proceedings of IEEE INFOCOM (pp. 1360\u20131369).","DOI":"10.1109\/INFCOM.2001.916631"},{"issue":"5","key":"900_CR15","first-page":"1826","volume":"95","author":"L Guangchun","year":"2012","unstructured":"Guangchun, L., Zhang, J., Ke, Q., & Haifeng, S. (2012). Location-aware social routing in delay tolerant networks. IEICE Transactions on Communications, 95(5), 1826\u20131829.","journal-title":"IEICE Transactions on Communications"},{"key":"900_CR16","doi-asserted-by":"crossref","unstructured":"Hossmann, T., Spyropoulos, T., & Legendre, F. (2010). Know thy neighbor: Towards optimal mapping of contacts to social graphs for DTN routing. In Proceedings of IEEE INFOCOM (pp. 1\u20139).","DOI":"10.1109\/INFCOM.2010.5462135"},{"issue":"11","key":"900_CR17","doi-asserted-by":"crossref","first-page":"1576","DOI":"10.1109\/TMC.2010.246","volume":"10","author":"P Hui","year":"2011","unstructured":"Hui, P., Crowcroft, J., & Yoneki, E. (2011). Bubble rap: Social-based forwarding in delay-tolerant networks. Mobile Computing, IEEE Transactions on, 10(11), 1576\u20131589.","journal-title":"Mobile Computing, IEEE Transactions on"},{"key":"900_CR18","volume-title":"Introduction to network simulator NS2","author":"T Issariyakul","year":"2011","unstructured":"Issariyakul, T., & Hossain, E. (2011). Introduction to network simulator NS2. New York: Springer."},{"key":"900_CR19","doi-asserted-by":"crossref","unstructured":"Jamakovic, A., & Van Mieghem, P. (2008). On the robustness of complex networks by using the algebraic connectivity. In Proceedings of NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet (pp. 183\u2013194).","DOI":"10.1007\/978-3-540-79549-0_16"},{"issue":"10","key":"900_CR20","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1145\/605432.605408","volume":"37","author":"P Juang","year":"2002","unstructured":"Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. (2002). Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. ACM Sigplan Notices, 37(10), 96\u2013107.","journal-title":"ACM Sigplan Notices"},{"issue":"11","key":"900_CR21","doi-asserted-by":"crossref","first-page":"3037","DOI":"10.1587\/transcom.E94.B.3037","volume":"94","author":"J Lee","year":"2011","unstructured":"Lee, J., & Kim, S. (2011). FSRS routing method for energy efficiency through the new concept of flooding restriction in wireless ad-hoc networks. IEICE Transactions on Communications, 94(11), 3037\u20133048.","journal-title":"IEICE Transactions on Communications"},{"key":"900_CR22","doi-asserted-by":"crossref","unstructured":"Leguay, J., Friedman, T., & Conan, V. (2005). DTN routing in a mobility pattern space. In Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking (pp. 276\u2013283).","DOI":"10.1145\/1080139.1080146"},{"issue":"3","key":"900_CR23","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A Lindgren","year":"2003","unstructured":"Lindgren, A., Doria, A., & Schel\u00e9n, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19\u201320.","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"key":"900_CR24","doi-asserted-by":"crossref","unstructured":"Musolesi, M., Hailes, S., & Mascolo, C. (2005). Adaptive routing for intermittently connected mobile ad hoc networks. In Proceedings of IEEE WoWMoM 2005 (pp. 183\u2013189).","DOI":"10.1109\/WOWMOM.2005.17"},{"key":"900_CR25","unstructured":"Network Simulator-2. (2014). http:\/\/www.isi.edu\/nsnam\/ns\/ . Accessed May 22, 2014."},{"key":"900_CR26","unstructured":"Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. In Proceedings of Advances in Neural Information Processing Systems. Cambridge, MA: MIT Press."},{"issue":"11","key":"900_CR27","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/MCOM.2006.248176","volume":"44","author":"L Pelusi","year":"2006","unstructured":"Pelusi, L., Passarella, A., & Conti, M. (2006). Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks. IEEE Communications Magazine, 44(11), 134\u2013141.","journal-title":"IEEE Communications Magazine"},{"issue":"1","key":"900_CR28","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/MC.2004.1260729","volume":"37","author":"A Pentland","year":"2004","unstructured":"Pentland, A., Fletcher, R., & Hasson, A. (2004). Daknet: Rethinking connectivity in developing nations. Computer, 37(1), 78\u201383.","journal-title":"Computer"},{"key":"900_CR29","doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R., & Krishnan, R. (2007). Prioritized epidemic routing for opportunistic networks. In Proceedings of MobiSys (pp. 62\u201366).","DOI":"10.1145\/1247694.1247707"},{"issue":"3","key":"900_CR30","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s11276-006-9955-y","volume":"14","author":"TF Shih","year":"2008","unstructured":"Shih, T. F., & Yen, H. C. (2008). Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks. Wireless Networks, 14(3), 321\u2013333.","journal-title":"Wireless Networks"},{"key":"900_CR31","unstructured":"Spielman, D. (2009). Spectral graph theory. Lecture Notes, Yale University."},{"key":"900_CR32","volume-title":"Introduction to percolation theory","author":"D Stauffer","year":"1991","unstructured":"Stauffer, D., & Aharony, A. (1991). Introduction to percolation theory. New York: Taylor and Francis."},{"key":"900_CR33","unstructured":"Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University."},{"issue":"4","key":"900_CR34","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg Von","year":"2007","unstructured":"Von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4), 395\u2013416.","journal-title":"Statistics and Computing"},{"key":"900_CR35","doi-asserted-by":"crossref","unstructured":"Widmer, J., & Le Boudec, J. Y. (2005). Network coding for efficient communication in extreme networks. In Proceedings of ACM SIGCOMM (pp. 284\u2013291).","DOI":"10.1145\/1080139.1080147"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-0900-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-015-0900-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-0900-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:04:07Z","timestamp":1559394247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-015-0900-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,29]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["900"],"URL":"https:\/\/doi.org\/10.1007\/s11276-015-0900-9","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,29]]}}}