{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:39:35Z","timestamp":1648906775816},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T00:00:00Z","timestamp":1379376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1007\/s11276-013-0641-6","type":"journal-article","created":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T07:34:19Z","timestamp":1379316859000},"page":"733-745","source":"Crossref","is-referenced-by-count":0,"title":["A fully distributed replica allocation scheme for an opportunistic network"],"prefix":"10.1007","volume":"20","author":[{"given":"Ji-Hyeun","family":"Yoon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jae-Ho","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwang-Jo","family":"Lee","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":[[2013,9,17]]},"reference":[{"issue":"9","key":"641_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":"1","key":"641_CR2","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":"11","key":"641_CR3","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":"641_CR4","doi-asserted-by":"crossref","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. In Proceedings of ASPLOS (pp. 96\u2013107).","DOI":"10.1145\/605397.605408"},{"issue":"2","key":"641_CR5","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TMC.2011.57","volume":"11","author":"J Choi","year":"2012","unstructured":"Choi, J., Shim, K., Lee, S., & Wu, K. (2012). Handling selfishness in replica allocation over a mobile ad hoc network. IEEE Transactions on Mobile Computing, 11(2), 278\u2013291.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"641_CR6","doi-asserted-by":"crossref","unstructured":"Hara, T. (2001). Effective replica allocation in ad hoc networks for improving data accessibility. In Proceedings of IEEE INFOCOM (pp. 1568\u20131576).","DOI":"10.1109\/INFCOM.2001.916653"},{"key":"641_CR7","doi-asserted-by":"crossref","unstructured":"Shinohara, M., Hayashi, H., Hara, T., & Nishio, S. (2006). Replica allocation considering power consumption in mobile ad hoc networks. In Proceedings of PerCom (pp. 13\u201317).","DOI":"10.1109\/PERCOMW.2006.117"},{"key":"641_CR8","doi-asserted-by":"crossref","unstructured":"Yen, Y. S., Wu, J. Z., Chung, B. Y., & Chao, H. C. (2009). A novel energy-efficient replica allocation within one-hop groups (ERAOG) in MANET. In Proceedings of CHINACOM (pp. 1\u20139).","DOI":"10.1109\/CHINACOM.2009.5339826"},{"key":"641_CR9","volume-title":"Mathematical theory of entropy","author":"N Martin","year":"2011","unstructured":"Martin, N., & England, J. (2011). Mathematical theory of entropy. New York: Cambridge University Press."},{"issue":"2","key":"641_CR10","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/MC.2004.1266293","volume":"37","author":"G Cao","year":"2004","unstructured":"Cao, G., Yin, L., & Das, C. R. (2004). Cooperative cache-based data access in ad hoc networks. IEEE Computer, 37(2), 32\u201339.","journal-title":"IEEE Computer"},{"key":"641_CR11","doi-asserted-by":"crossref","unstructured":"Chen, L. J., Yu, C. H., Sun, T., Chen, Y. C., & Chu, H. (2006). A hybrid routing approach for opportunistic networks. In Proceedings of CHANTS (pp. 213\u2013220).","DOI":"10.1145\/1162654.1162658"},{"key":"641_CR12","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":"641_CR13","doi-asserted-by":"crossref","unstructured":"Burns, B., Brock, O., & Levine, B. N. (2005). MV routing and capacity building in disruption tolerant networks. In Proceedings of IEEE INFOCOM (pp. 398\u2013408).","DOI":"10.1109\/INFCOM.2005.1497909"},{"key":"641_CR14","doi-asserted-by":"crossref","unstructured":"Small, T., & Haas, Z. J. (2003). The shared wireless infostation model: A new ad hoc networking paradigm (or where there is a whale, there is a way). In Proceedings of ACM MobiHoc (pp. 233\u2013244).","DOI":"10.1145\/778415.778443"},{"issue":"3","key":"641_CR15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s11036-006-5186-9","volume":"11","author":"S Jain","year":"2006","unstructured":"Jain, S., Shah, R., Brunette, W., Borriello, G., & Roy, S. (2006). Exploiting mobility for energy efficient data collection in wireless sensor networks. Mobile Networks and Applications, 11(3), 327\u2013339.","journal-title":"Mobile Networks and Applications"},{"key":"641_CR16","doi-asserted-by":"crossref","unstructured":"Krifa, A., Barakat, C., & Spyropoulos, T. (2011). MobiTrade: Trading content in disruption tolerant networks. In Proceedings of CHANTS (pp. 31\u201336).","DOI":"10.1145\/2030652.2030663"},{"key":"641_CR17","doi-asserted-by":"crossref","unstructured":"Boldrini, C., Conti, M., & Passarella, A. (2008). Context and resource awareness in opportunistic network data dissemination. In Proceedings of WoWMoM (pp. 1\u20136).","DOI":"10.1109\/WOWMOM.2008.4594890"},{"key":"641_CR18","doi-asserted-by":"crossref","unstructured":"Lenders, V., Karlsson, G., & May, M. (2007). Wireless Ad Hoc Podcasting. In Sensor, mesh and ad hoc communications and networks (pp. 273\u2013283).","DOI":"10.1109\/SAHCN.2007.4292839"},{"key":"641_CR19","doi-asserted-by":"crossref","unstructured":"Pantazopoulos, P., Stavrakakis, I., Passarella, A., & Conti, M. (2010). Efficient social-aware content placement in opportunistic networks. In Proceedings of WONS (pp. 17\u201324).","DOI":"10.1109\/WONS.2010.5437139"},{"key":"641_CR20","doi-asserted-by":"crossref","unstructured":"Reich, J., & Chaintreau, A. (2009). The age of impatience: Optimal replication schemes for opportunistic networks. In Proceedings of CoNEXT (pp. 85\u201396).","DOI":"10.1145\/1658939.1658950"},{"key":"641_CR21","doi-asserted-by":"crossref","unstructured":"Ma, Y., Kibria, M. R., & Jamalipour, A. (2008). Cache-based content delivery in opportunistic mobile ad hoc networks. In Proceedings of IEEE GLOBECOM (pp. 1\u20135).","DOI":"10.1109\/GLOCOM.2008.ECP.153"},{"key":"641_CR22","doi-asserted-by":"crossref","unstructured":"Zhuo, X., Li, Q., Cao, G., Dai, Y., Szymanski, B., & Porta, T. L. (2011) Social-based cooperative caching in DTNs: A contact duration aware approach. In Proceedings of MASS (pp. 92\u2013101).","DOI":"10.1109\/MASS.2011.22"},{"issue":"9","key":"641_CR23","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: Modeling spatial and temporal properties of human mobility driven by users\u2019 social relationships. Computer Communications, 33(9), 1056\u20131074.","journal-title":"Computer Communications"},{"key":"641_CR24","unstructured":"The Network Simulator NS-3. http:\/\/www.nsnam.org ."},{"key":"641_CR25","doi-asserted-by":"crossref","unstructured":"Boldrini, C., Conti, M., & Passarella, A. (2008). ContentPlace: Social-aware data dissemination in opportunistic networks. In Proceedings of MSWiM (pp. 203\u2013210).","DOI":"10.1145\/1454503.1454541"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-013-0641-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-013-0641-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-013-0641-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T00:04:20Z","timestamp":1563926660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-013-0641-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,17]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["641"],"URL":"https:\/\/doi.org\/10.1007\/s11276-013-0641-6","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,17]]}}}