{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T03:22:40Z","timestamp":1648869760828},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,3,14]],"date-time":"2012-03-14T00:00:00Z","timestamp":1331683200000},"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":[[2012,10]]},"DOI":"10.1007\/s11276-012-0430-7","type":"journal-article","created":{"date-parts":[[2012,3,13]],"date-time":"2012-03-13T11:49:20Z","timestamp":1331639360000},"page":"749-762","source":"Crossref","is-referenced-by-count":0,"title":["Proactive data dissemination to mission sites"],"prefix":"10.1007","volume":"18","author":[{"given":"Fangfei","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew P.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amotz","family":"Bar-Noy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas F.","family":"La Porta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,3,14]]},"reference":[{"key":"430_CR1","unstructured":"Alzoubi, H. A., Lee, S., & Rabinovich, M., Spatscheck, O., van der Merwe, J. E. (2008). Anycast CDNS revisited. In: Proceedings of WWW 2008."},{"issue":"4","key":"430_CR2","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/080715421","volume":"38","author":"I. Baev","year":"2008","unstructured":"Baev, I., Rajaraman, R., & Swamy, C. (2008). Approximation algorithms for data placement problems. SIAM Journal on Computing, 38(4), 1411\u20131429.","journal-title":"SIAM Journal on Computing"},{"key":"430_CR3","unstructured":"Bateni, M. H., & Hajiaghayi, M. (2009). Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location. In: Proceedings of SODA 09."},{"issue":"6","key":"430_CR4","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P. Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovi\u0107, I., & Urrutia, J. (2001). Routing with guaranteed delivery in Ad Hoc wireless networks. Wireless Networks, 7(6), 609\u2013616.","journal-title":"Wireless Networks"},{"issue":"4","key":"430_CR5","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.ipl.2006.06.003","volume":"100","author":"R. Cohen","year":"2006","unstructured":"Cohen, R., Katzir, L., & Raz, D. (2006). An efficient approximation for the generalized assignment problem. Information Processing Letters, 100(4), 162\u2013166.","journal-title":"Information Processing Letters"},{"issue":"2","key":"430_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1504\/IJWMC.2006.012472","volume":"1","author":"S. De","year":"2006","unstructured":"De, S., Caruso, A., Chaira, T., & Chessa, S. (2006). Bounds on hop distance in greedy routing approach in wireless Ad Hoc networks. International Journal of Wireless and Mobile Computing, 1(2), 131\u2013140.","journal-title":"International Journal of Wireless and Mobile Computing"},{"issue":"2","key":"430_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/78952.78953","volume":"8","author":"S. Deering","year":"1990","unstructured":"Deering, S., & Cheriton, D. (1990). Multicast routing in datagram internetworks and extended LANs. ACM Transactions on Computer Systems, 8(2), 85\u2013110.","journal-title":"ACM Transactions on Computer Systems"},{"key":"430_CR8","unstructured":"Fleischer, L., Goemans, M. X., Mirrokni, V. S., & Sviridenko, M. (2006). Tight approximation algorithms for maximum general assignment problems. In: Proceedings of SODA (pp. 611\u2013620)."},{"issue":"3","key":"430_CR9","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00453-001-0122-7","volume":"33","author":"A. Goel","year":"2002","unstructured":"Goel, A., & Munagala, K. (2002). Extending greedy multicast routing to delay sensitive applications. Algorithmica, 33(3), 335\u2013352.","journal-title":"Algorithmica"},{"key":"430_CR10","unstructured":"Goel, A., Ramakrishnan, K., Kataria, D., & Logothetis, D. (2001). Efficient computation of delay-sensitive routes from one source to all destinations. In: INFOCOM."},{"key":"430_CR11","unstructured":"Guha, S., & Munagala, K. (2002). Improved algorithms for the data placement problem. In: Proceedings of SODA (pp. 106\u2013107)."},{"issue":"3","key":"430_CR12","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/COMST.2007.4317616","volume":"9","author":"M. Hosseini","year":"2007","unstructured":"Hosseini, M., Ahmed, D., Shirmohammadi, S., & Georganas, N. (2007). A survey of application-layer multicast protocols. IEEE Communications Surveys & Tutorials, 9(3), 58\u201374.","journal-title":"IEEE Communications Surveys Tutorials"},{"issue":"1","key":"430_CR13","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TNET.2002.808417","volume":"11","author":"C. Intanagonwiwat","year":"2003","unstructured":"Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., & Silva, F. (2003). Directed diffusion for wireless sensor networking. Networking. IEEE\/ACM Transactions on, 11(1), 2\u201316.","journal-title":"IEEE\/ACM Transactions on"},{"key":"430_CR14","doi-asserted-by":"crossref","unstructured":"Karp, B., & Kung, H. (2000). GPSR: greedy perimeter stateless routing for wireless networks. In: Proceedings of ACM\/IEEE MOBICOM, pp. 243\u2013254.","DOI":"10.1145\/345910.345953"},{"key":"430_CR15","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, B., Wills, C., & Zhang, Y. (2001). On the use and performance of content distribution networks. Proceedings of the 1st ACM SIGCOMM workshop on internet measurement (pp. 169\u2013182).","DOI":"10.1145\/505202.505224"},{"key":"430_CR16","unstructured":"Lehmann, B., Lehmann, D. J., & Nisan, N. (2001). Combinatorial auctions with decreasing marginal utilities. In: Proceedings of ACM Conference on Electronic Commerce (pp. 18\u201328)."},{"key":"430_CR17","doi-asserted-by":"crossref","unstructured":"Lenstra, J. K., Shmoys, D. B., & va Tardos (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46.","DOI":"10.1007\/BF01585745"},{"key":"430_CR18","unstructured":"Meyerson, A., Munagala, K., & Plotkin, S.A. (2001). Web caching using access statistics. In: Proceedings of SODA (pp. 354\u2013363)."},{"key":"430_CR19","unstructured":"Qiu, L., Padmanabhan, V., & Voelker, G. (2001). On the placement of web server replicas. In: IEEE INFOCOM 2001 Proceedings (Vol. 3)."},{"issue":"4","key":"430_CR20","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1023\/A:1024591915518","volume":"8","author":"S. Ratnasamy","year":"2003","unstructured":"Ratnasamy, S., Karp, B., Shenker, S., Estrin, D., Govindan, R., Yin, L., et al. (2003). Data-centric storage in sensornets with ght, a geographic hash table. Mobile networks and applications, 8(4), 427\u2013442.","journal-title":"Mobile networks and applications"},{"key":"430_CR21","doi-asserted-by":"crossref","unstructured":"Rodolakis, G., Siachalou, S., & Georgiadis, L. (2006). Replicated server placement with QoS constraints. IEEE Transactions on Parallel and Distributed Systems, 1151\u20131162.","DOI":"10.1109\/TPDS.2006.145"},{"key":"430_CR22","doi-asserted-by":"crossref","unstructured":"Ross, G. T., & Soland, R. M. (1975). A branch and bound algorithm for the generalized assignment problem. Mathematical Programming, 8\u20131.","DOI":"10.1007\/BF01580430"},{"key":"430_CR23","doi-asserted-by":"crossref","unstructured":"Shmoys, D. B., & va Tardos (1993). An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62.","DOI":"10.1007\/BF01585178"},{"issue":"10","key":"430_CR24","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1109\/TPDS.2005.126","volume":"16","author":"X. Tang","year":"2005","unstructured":"Tang, X., & Xu, J. (2005). QoS-aware replica placement for content distribution. IEEE Transactions on Parallel and Distributed Systems, 16(10), 921\u2013932.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"430_CR25","unstructured":"Wang, H., Liu, P., & Wu, J. (2006). A QoS-aware heuristic algorithm for replica placement. In: 7th IEEE\/ACM international conference on grid computing."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-012-0430-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-012-0430-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-012-0430-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T06:34:05Z","timestamp":1561444445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-012-0430-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,14]]},"references-count":25,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["430"],"URL":"https:\/\/doi.org\/10.1007\/s11276-012-0430-7","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,14]]}}}