{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T18:30:06Z","timestamp":1718649006506},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T00:00:00Z","timestamp":1446768000000},"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":[[2016,11]]},"DOI":"10.1007\/s11276-015-1113-y","type":"journal-article","created":{"date-parts":[[2015,11,6]],"date-time":"2015-11-06T07:32:18Z","timestamp":1446795138000},"page":"2511-2521","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A forwarding scheme based on swarm intelligence and percolation centrality in opportunistic networks"],"prefix":"10.1007","volume":"22","author":[{"given":"Jiho","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyeop","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun-Kyum","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiyoung","family":"Jang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung-Bong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,6]]},"reference":[{"issue":"9","key":"1113_CR1","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":"5","key":"1113_CR2","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":"1113_CR3","doi-asserted-by":"crossref","unstructured":"Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007). Trading structure for randomness in wireless opportunistic routing. In Proceedings of the IEEE international conference SIGCOMM (pp. 169\u2013180).","DOI":"10.1145\/1282380.1282400"},{"key":"1113_CR4","doi-asserted-by":"crossref","unstructured":"Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J. & Diot, C. (2005). Pocket switched networks and human mobility in conference environments. In Proceedings of WDTN (pp. 65\u201370).","DOI":"10.1145\/1080139.1080142"},{"issue":"1","key":"1113_CR5","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":"10","key":"1113_CR6","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/COMST.2006.323440","volume":"8","author":"Z Zhang","year":"2006","unstructured":"Zhang, Z. (2006). Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challengers. IEEE Communication Surveys Tutorials, 8(10), 24\u201337.","journal-title":"IEEE Communication Surveys Tutorials"},{"issue":"6","key":"1113_CR7","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":"8","key":"1113_CR8","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1007\/s11276-010-0276-9","volume":"16","author":"T Spyropoulos","year":"2010","unstructured":"Spyropoulos, T., Rais, R. N., Turletti, T., Obraczka, K., & Vasilakos, A. (2010). Routing for disruption tolerant networks: Taxonomy and design. Wireless Networks, 16(8), 2349\u20132370.","journal-title":"Wireless Networks"},{"key":"1113_CR9","volume-title":"Delay tolerant networks: Protocols and applications","author":"TS Athanasios","year":"2011","unstructured":"Athanasios, T. S., Vasilakos, V., & Zhang, Y. (2011). Delay tolerant networks: Protocols and applications. Boca Raton: CRC Press."},{"key":"1113_CR10","volume-title":"Routing in opportunistic networks","year":"2013","unstructured":"Zhang, I., Dhurandher, S. K., Anpalagan, A., & Vasilakos, A. V. (Eds.). (2013). Routing in opportunistic networks. New York: Springer."},{"issue":"4","key":"1113_CR11","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TMC.2014.2331966","volume":"14","author":"XM Zhang","year":"2015","unstructured":"Zhang, X. M., Zhang, Y., Yan, F., & Vasilakos, A. V. (2015). Interference-based topology control algorithm for delay-constrained mobile ad hoc networks. IEEE Transactions on Mobile Computing, 14(4), 742\u2013754.","journal-title":"IEEE Transactions on Mobile Computing"},{"issue":"1","key":"1113_CR12","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/SURV.2013.082713.00184","volume":"16","author":"M Youssef","year":"2014","unstructured":"Youssef, M., Ibrahim, M., Abdelatif, M., Chen, L., & Vasilakos, A. V. (2014). Routing metrics of cognitive radio networks: A survey. IEEE Communications Surveys & Tutorials, 16(1), 92\u2013109.","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"11","key":"1113_CR13","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"},{"issue":"5","key":"1113_CR14","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1007\/s11276-014-0876-x","volume":"21","author":"SK Kim","year":"2015","unstructured":"Kim, S. K., Choi, J. H., & Yang, S. B. (2015). Hotspot: Location-based forwarding scheme in an opportunistic network. Adhoc & Sensor Wireless Networks, 21(5), 1699\u20131711.","journal-title":"Adhoc & Sensor Wireless Networks"},{"key":"1113_CR15","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 (pp. 183\u2013189).","DOI":"10.1109\/WOWMOM.2005.17"},{"issue":"11","key":"1113_CR16","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"},{"key":"1113_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jnca.2015.02.001","volume":"52","author":"AV Vasilakos","year":"2015","unstructured":"Vasilakos, A. V., Li, Z., Simon, G., & You, W. (2015). Information centric network: Research challenges and opportunities. Journal of Network and Computer Applications, 52, 1\u201310.","journal-title":"Journal of Network and Computer Applications"},{"key":"1113_CR18","doi-asserted-by":"crossref","unstructured":"Quan, W., Xu, C., Vasilakos, A. V., Guan, J., Zhang, H., & Grieco, L. A. (2014). TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in content-centric networking. In Networking conference, 2014 IFIP (pp. 1\u20139). IEEE.","DOI":"10.1109\/IFIPNetworking.2014.6857122"},{"issue":"2","key":"1113_CR19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11276-012-0457-9","volume":"19","author":"Y Zeng","year":"2013","unstructured":"Zeng, Y., Xiang, K., Li, D., & Vasilakos, A. V. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161\u2013173.","journal-title":"Wireless Networks"},{"issue":"1","key":"1113_CR20","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11036-011-0316-4","volume":"17","author":"X Wang","year":"2012","unstructured":"Wang, X., Vasilakos, A. V., Chen, M., Liu, Y., & Kwon, T. T. (2012). A survey of green mobile networks: Opportunities and challenges. Mobile Networks and Applications, 17(1), 4\u201320.","journal-title":"Mobile Networks and Applications"},{"key":"1113_CR21","unstructured":"Li, P., Guo, S., Yu, S., & Vasilakos, A. V. (2012). CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In INFOCOM, 2012 proceedings IEEE (pp. 100\u2013108). IEEE."},{"issue":"7","key":"1113_CR22","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1049\/iet-com.2009.0164","volume":"4","author":"Y Liu","year":"2010","unstructured":"Liu, Y., Xiong, N., Zhao, Y., Vasilakos, A. V., Gao, J., & Jia, Y. (2010). Multi-layer clustering routing algorithm for wireless vehicular sensor networks. IET Communications, 4(7), 810\u2013816.","journal-title":"IET Communications"},{"key":"1113_CR23","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2417543","author":"T Meng","year":"2015","unstructured":"Meng, T., Wu, F., Yang, Z., Chen, G., & Vasilakos, A. (2015). Spatial reusability-aware routing in multi-hop wireless networks. IEEE TMC. doi: 10.1109\/TC.2015.2417543 .","journal-title":"IEEE TMC"},{"issue":"4","key":"1113_CR24","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/1851275.1851233","volume":"41","author":"A Dvir","year":"2011","unstructured":"Dvir, A., & Vasilakos, A. V. (2011). Backpressure-based routing protocol for DTNs. ACM SIGCOMM Computer Communication Review, 41(4), 405\u2013406.","journal-title":"ACM SIGCOMM Computer Communication Review"},{"issue":"12","key":"1113_CR25","doi-asserted-by":"crossref","first-page":"3264","DOI":"10.1109\/TPDS.2013.2297105","volume":"25","author":"P Li","year":"2014","unstructured":"Li, P., Guo, S., Yu, S., & Vasilakos, A. V. (2014). Reliable multicast with pipelined network coding using opportunistic feeding and routing. IEEE Transactions on Parallel and Distributed Systems, 25(12), 3264\u20133273.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"9","key":"1113_CR26","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/TC.2011.145","volume":"61","author":"C Busch","year":"2012","unstructured":"Busch, C., Kannan, R., & Vasilakos, A. V. (2012). Approximating congestion\u00a0+\u00a0dilation in networks via quality of routing games. IEEE Transactions on Computers, 61(9), 1270\u20131283.","journal-title":"IEEE Transactions on Computers"},{"key":"1113_CR27","unstructured":"Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department."},{"key":"1113_CR28","unstructured":"Network Simulator-2. http:\/\/www.isi.edu\/nsnam\/ns\/ ."},{"key":"1113_CR29","volume-title":"Introduction to network simulator NS2","author":"T Issariyakul","year":"2011","unstructured":"Issariyakul, T., & Hossain, E. (2011). Introduction to network simulator NS2. Berlin: Springer."},{"issue":"9","key":"1113_CR30","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":"1113_CR31","unstructured":"Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University."},{"issue":"3","key":"1113_CR32","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":"1113_CR33","doi-asserted-by":"crossref","unstructured":"Daly, E. H., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant manets. In Proceedings of ACM MobiHoc (pp. 32\u201340).","DOI":"10.1145\/1288107.1288113"},{"key":"1113_CR34","doi-asserted-by":"crossref","unstructured":"Giordano, S. (2002). Mobile ad hoc networks. In I. Stojmenovic (Ed.), Handbook of wireless networks and mobile computing. John Wiley & Sons.","DOI":"10.1002\/0471224561.ch15"},{"issue":"3","key":"1113_CR35","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"},{"issue":"2","key":"1113_CR36","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MC.2004.1266295","volume":"37","author":"M Conti","year":"2004","unstructured":"Conti, M., Maselli, G., Turi, G., & Giordano, S. (2004). Cross-layering in mobile ad hoc network design. Computer, 37(2), 48\u201351.","journal-title":"Computer"},{"issue":"3","key":"1113_CR37","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1109\/JSYST.2013.2281262","volume":"9","author":"F Xia","year":"2013","unstructured":"Xia, F., Liu, L., Li, J., Ma, J., & Vasilakos, A. (2013). Socially aware networking: A survey. IEEE Systems Journal, 9(3), 904\u2013921.","journal-title":"IEEE Systems Journal"},{"issue":"2","key":"1113_CR38","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/MIS.2010.48","volume":"25","author":"L Zhou","year":"2010","unstructured":"Zhou, L., Xiong, N, Shu, L., Vasilakos, A., & Yeo, S.-S. (2010). Context-aware middleware for multimedia services in heterogeneous networks. IEEE on Intelligent Systems, 25(2), 40\u201347.","journal-title":"IEEE on Intelligent Systems"},{"key":"1113_CR39","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"},{"key":"1113_CR40","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., & Raghavendra, C. (2005). Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proceedings of ACM SIGCOMM (pp. 252\u2013259).","DOI":"10.1145\/1080139.1080143"},{"issue":"11","key":"1113_CR41","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. IEEE Transactions on Mobile Computing, 10(11), 1576\u20131589.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"1113_CR42","doi-asserted-by":"crossref","unstructured":"Mtibaa, A., May, M., Diot, C., & Ammar, M. (2010). PeopleRank: Social opportunistic forwarding. In Proceedings of IEEE INFOCOM (pp. 1\u20135).","DOI":"10.1109\/INFCOM.2010.5462261"},{"issue":"3","key":"1113_CR43","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TNSM.2014.2346080","volume":"11","author":"Y Song","year":"2014","unstructured":"Song, Y., Liu, L., Ma, H., & Vasilakos, A. V. (2014). A biology-based algorithm to minimal exposure problem of wireless sensor networks. IEEE Transactions on Network and Service Management, 11(3), 417\u2013430.","journal-title":"IEEE Transactions on Network and Service Management"},{"issue":"2","key":"1113_CR44","first-page":"8","volume":"5","author":"G Acampora","year":"2010","unstructured":"Acampora, G., Gaeta, M., Loia, V., & Vasilakos, A. V. (2010). Interoperable and adaptive fuzzy services for ambient intelligence applications. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 5(2), 8.","journal-title":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)"},{"issue":"1","key":"1113_CR45","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.asoc.2009.12.025","volume":"11","author":"D Karaboga","year":"2011","unstructured":"Karaboga, D., & Ozturk, C. (2011). A novel clustering approach: artificial bee colony (ABC) algorithm. Applied Soft Computing, 11(1), 652\u2013657.","journal-title":"Applied Soft Computing"},{"issue":"1","key":"1113_CR46","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga, D., & Basturk, B. (2008). On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing, 8(1), 687\u2013697.","journal-title":"Applied Soft Computing"},{"issue":"11","key":"1113_CR47","doi-asserted-by":"crossref","first-page":"2238","DOI":"10.1016\/j.mcm.2010.10.008","volume":"53","author":"YS Yen","year":"2011","unstructured":"Yen, Y. S., Chao, H. C., Chang, R. S., & Vasilakos, A. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53(11), 2238\u20132250.","journal-title":"Mathematical and Computer Modelling"},{"issue":"1","key":"1113_CR48","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11721-007-0004-y","volume":"1","author":"S Garnier","year":"2007","unstructured":"Garnier, S., Gautrais, J., & Theraulaz, G. (2007). The biological principles of swarm intelligence. Swarm Intelligence, 1(1), 3\u201331.","journal-title":"Swarm Intelligence"},{"issue":"4","key":"1113_CR49","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s11277-011-0355-y","volume":"66","author":"D Liu","year":"2012","unstructured":"Liu, D., & Wang, B. (2012). Biological swarm intelligence based opportunistic resource allocation for wireless ad hoc networks. Wireless Personal Communications, 66(4), 629\u2013649.","journal-title":"Wireless Personal Communications"},{"issue":"3","key":"1113_CR50","first-page":"819","volume":"64","author":"L Liu","year":"2015","unstructured":"Liu, L., Song, Y., Zhang, H., Ma, H., & Vasilakos, A. V. (2015). Physarum optimization: A biology-inspired algorithm for the steiner tree problem in networks. IEEE Transactions on Computers, 64(3), 819\u2013832.","journal-title":"IEEE Transactions on Computers"},{"issue":"1\u20132","key":"1113_CR51","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/B:MONE.0000048545.40783.fc","volume":"10","author":"CC Shen","year":"2005","unstructured":"Shen, C. C., & Jaikaeo, C. (2005). Ad hoc multicast routing algorithm with swarm intelligence. Mobile Networks and Applications, 10(1\u20132), 47\u201359.","journal-title":"Mobile Networks and Applications"},{"key":"1113_CR52","doi-asserted-by":"crossref","unstructured":"Wedde, H. F., Farooq, M., Pannenbaecker, T., Vogel, B., Mueller, C., Meth, J., & Jeruschkat, R. (2005). BeeAdHoc: An energy efficient routing algorithm for mobile ad hoc networks inspired by bee behavior. In Proceedings of the 7th annual conference on genetic and evolutionary computation (pp. 153\u2013160).","DOI":"10.1145\/1068009.1068034"},{"issue":"2","key":"1113_CR53","first-page":"255","volume":"20","author":"C \u00d6zt\u00fcrk","year":"2012","unstructured":"\u00d6zt\u00fcrk, C., Karabo\u011fa, D., & G\u00f6rkemli, B. (2012). Artificial bee colony algorithm for dynamic deployment of wireless sensor networks. Turkish Journal of Electrical Engineering & Computer Sciences, 20(2), 255\u2013262.","journal-title":"Turkish Journal of Electrical Engineering & Computer Sciences"},{"key":"1113_CR54","doi-asserted-by":"crossref","unstructured":"Li, J., Liu, L., & Xia, F. (2013). BEEINFO: data forwarding based on interest and swarm intelligence for socially-aware networking. In Proceedings of the 19th annual international conference on mobile computing and networking (pp. 175\u2013178).","DOI":"10.1145\/2500423.2504569"},{"issue":"1","key":"1113_CR55","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","volume":"27","author":"ME Newman","year":"2005","unstructured":"Newman, M. E. (2005). A measure of betweenness centrality based on random walks. Social Networks, 27(1), 39\u201354.","journal-title":"Social Networks"},{"issue":"2","key":"1113_CR56","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1140\/epjb\/e2004-00111-4","volume":"38","author":"M Barthelemy","year":"2004","unstructured":"Barthelemy, M. (2004). Betweenness centrality in large complex networks. The European Physical Journal B-Condensed Matter and Complex Systems, 38(2), 163\u2013168.","journal-title":"The European Physical Journal B-Condensed Matter and Complex Systems"},{"issue":"1","key":"1113_CR57","doi-asserted-by":"crossref","first-page":"e53095","DOI":"10.1371\/journal.pone.0053095","volume":"8","author":"M Piraveenan","year":"2013","unstructured":"Piraveenan, M., Prokopenko, M., & Hossain, L. (2013). Percolation centrality: Quantifying graph-theoretic impact of nodes during percolation in networks. PLoS One, 8(1), e53095.","journal-title":"PLoS One"},{"issue":"1","key":"1113_CR58","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.socnet.2004.11.007","volume":"27","author":"M Everett","year":"2005","unstructured":"Everett, M., & Borgatti, S. P. (2005). Ego network betweenness. Social Networks, 27(1), 31\u201338.","journal-title":"Social Networks"},{"key":"1113_CR59","doi-asserted-by":"crossref","unstructured":"Wu, J., Xiao, M., & Huang, L. (2013). Homing spread: Community home-based multi-copy routing in mobile social networks. In Proceedings of IEEE INFOCOM (pp. 138\u2013146).","DOI":"10.1109\/INFCOM.2013.6567036"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-1113-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-015-1113-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-1113-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-1113-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T05:28:56Z","timestamp":1567315736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-015-1113-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,6]]},"references-count":59,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1113"],"URL":"https:\/\/doi.org\/10.1007\/s11276-015-1113-y","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,6]]}}}