{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:35:04Z","timestamp":1725496504704},"publisher-location":"Berlin, Heidelberg","reference-count":41,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540726050"},{"type":"electronic","value":"9783540726067"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72606-7_2","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T21:02:47Z","timestamp":1196110967000},"page":"13-24","source":"Crossref","is-referenced-by-count":3,"title":["Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks"],"prefix":"10.1007","author":[{"given":"Amit","family":"Dvir","sequence":"first","affiliation":[]},{"given":"Michael","family":"Segal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Holm, J., Thorup, M.: Maintaining median and center in dynamic trees. In: 7th Scandinavian Workshop on Algorithm Theory, pp. 46\u201356 (2000)","DOI":"10.1007\/3-540-44985-X_6"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1016\/S0305-0548(99)00042-8","volume":"26","author":"I. Averbakh","year":"1999","unstructured":"Averbakh, I., Berman, O.: Algorithms for path medi-centers of a tree. Computers Operation Research\u00a026, 1395\u20131409 (1999)","journal-title":"Computers Operation Research"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/166237.166246","volume-title":"Proc. ACM SIGCOMM","author":"T. Ballardie","year":"1993","unstructured":"Ballardie, T., Francis, P., Crowcroft, J.: Core Based Trees (CBT): An Architecture for Scalable Inter Domain Multicast Routing. In: Proc. ACM SIGCOMM, pp. 85\u201395. ACM Press, New York (1993)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J. Bar-IIan","year":"1993","unstructured":"Bar-IIan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. Journal of Algorithms\u00a015, 385\u2013415 (1993)","journal-title":"Journal of Algorithms"},{"key":"2_CR5","unstructured":"Benkoczi, R., Bhattacharya, B., Tamir, A.: Collection Depots Facility Location Problems in Trees (submitted), http:\/\/www.tau.ac.il\/~atamir\/tamirp.html"},{"key":"2_CR6","first-page":"1011","volume-title":"IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 2","author":"Y. Ben-Shimol","year":"2004","unstructured":"Ben-Shimol, Y., Dvir, A., Segal, M.: SPLAST: A novel approach for multicasting in mobile as hoc networks. In: IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 2, pp. 1011\u20131015. IEEE, Los Alamitos (2004)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1057\/jors.1991.69","volume":"42","author":"O. Berman","year":"1991","unstructured":"Berman, O., Yang, E.K.: Medi-centre location problems. Journal Operation Research Society\u00a042, 313\u2013322 (1991)","journal-title":"Journal Operation Research Society"},{"issue":"5","key":"2_CR8","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1142\/S0218195900000292","volume":"10","author":"S. Bespamyatnikh","year":"2000","unstructured":"Bespamyatnikh, S., et al.: Optimal facility location under various distance functions. Int. Journal on Comp. Geometry and Appls.\u00a010(5), 523\u2013534 (2000)","journal-title":"Int. Journal on Comp. Geometry and Appls."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s11235-006-9002-4","volume":"32","author":"L. Bing-Hong","year":"2006","unstructured":"Bing-Hong, L., Wei-Chieh, K., Ming-Jer, T.: Distributed formation of core-based forwarding multicast trees in mobile ad hoc networks. Telecommun. System\u00a032, 263\u2013281 (2006)","journal-title":"Telecommun. System"},{"key":"2_CR10","first-page":"165","volume":"2","author":"E.J. Carrizosa","year":"1994","unstructured":"Carrizosa, E.J., et al.: An axiomatic approach to the centdian criterion. Location Science\u00a02, 165\u2013171 (1994)","journal-title":"Location Science"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1109\/90.490743","volume":"4","author":"S.E. Deering","year":"1996","unstructured":"Deering, S.E., et al.: The PIM Architecture for Wide-Area Multicast Routing. IEEE\/ACM Trans. Networking\u00a04(2), 153\u2013162 (1996)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"2_CR12","volume-title":"Discrete Mathematics","author":"J. Dossey","year":"1993","unstructured":"Dossey, J., et al.: Discrete Mathematics. Harper Collins College Publishers, New York (1993)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1504\/IJSNET.2006.010837","volume":"1","author":"S. Dulman","year":"2006","unstructured":"Dulman, S., et al.: On the hop count statistics for randomly deployed wireless sensor networks. International Journal of Sensor Networks\u00a01, 89\u2013102 (2006)","journal-title":"International Journal of Sensor Networks"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math.\u00a032, 835\u2013859 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"2_CR15","unstructured":"Gavrilovska, L.M., Atanasovski, V.M.: Ad Hoc Networking Toward 4G: Challenges and QoS Solutions. In: International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services (2005)"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/TPDS.2003.1167368","volume":"14","author":"S.K.S. Gupta","year":"2003","unstructured":"Gupta, S.K.S., Srimani, P.K.: Adaptive core selection and migration method for multicast routing in mobile ad hoc networks. IEEE Transactions on Parallel and Distributed Systems\u00a014, 27\u201338 (2003)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"2_CR17","first-page":"387","volume-title":"IEEE Int\u2019l Performance Computing, and Communications Conference","author":"S.K.S. Gupta","year":"2002","unstructured":"Gupta, S.K.S., et al.: An Efficient Core Migration Protocol for QoS in Mobile Ad Hoc Networks. In: IEEE Int\u2019l Performance Computing, and Communications Conference, pp. 387\u2013391. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"2_CR18","first-page":"534","volume":"16","author":"J. Halpern","year":"1978","unstructured":"Halpern, J.: Finding minimal center-median convex combination (cent-dian) of a graph. Management Science\u00a016, 534\u2013544 (1978)","journal-title":"Management Science"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1111\/j.1467-9787.1976.tb00966.x","volume":"16","author":"J. Halpern","year":"1976","unstructured":"Halpern, J.: The location of a centdian convex combination on an undirected tree. Journal Regional Science\u00a016, 237\u2013245 (1976)","journal-title":"Journal Regional Science"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1287\/trsc.19.3.246","volume":"19","author":"G.Y. Handler","year":"1985","unstructured":"Handler, G.Y.: Medi-centers of a tree. Transportation Science\u00a019, 246\u2013260 (1985)","journal-title":"Transportation Science"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F. Hwang","year":"1992","unstructured":"Hwang, F., Richards, F.D.: Steiner Tree Problems. Networks\u00a022(1), 55\u201389 (1992)","journal-title":"Networks"},{"key":"2_CR22","first-page":"93","volume-title":"The Steiner tree problem","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner tree problem, pp. 93\u2013202. North-Holland, Amsterdam (1992)"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0167-6377(02)00121-9","volume":"30","author":"J. Kalcsics","year":"2002","unstructured":"Kalcsics, J., et al.: Algorithmic results for ordered median problems defined on networks and the plane. Operations Research Letters\u00a030, 149\u2013158 (2002)","journal-title":"Operations Research Letters"},{"key":"2_CR24","first-page":"374","volume-title":"13th Annual ACM Symposium on Principles of Distributed Computing","author":"M.H. Karaata","year":"1994","unstructured":"Karaata, M.H., et al.: Self-stabilizing algorithms for finding centers and medians of trees. In: 13th Annual ACM Symposium on Principles of Distributed Computing, pp. 374\u2013395. ACM Press, New York (1994)"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/MCSA.1999.749282","volume-title":"Second IEEE Workshop on Mobile Computing Systems and Applications","author":"Y.B. Ko","year":"1999","unstructured":"Ko, Y.B., Vaidya, N.H.: Geocasting in Mobile Ad hoc Networks: Location-Based Multicast Algorithms. In: Second IEEE Workshop on Mobile Computing Systems and Applications, pp. 101\u2013110. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1145\/579.585","volume":"6","author":"E. Korach","year":"1984","unstructured":"Korach, E., Rotem, D., Santoro, N.: Distributed Algorithms for Finding Centers and Medians in Networks. ACM Trans. Program. Lang. Syst.\u00a06, 380\u2013401 (1984)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"1662","DOI":"10.1109\/5.889006","volume":"88","author":"J. Lansford","year":"2000","unstructured":"Lansford, J., Bahl, P.: The Design And Implementation Of HomeRF: A Radio Frequency Wireless Networking Standard For The Connected Home. Proceedings of the IEEE\u00a088, 1662\u20131676 (2000)","journal-title":"Proceedings of the IEEE"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0020-0190(92)90208-D","volume":"44","author":"J.H. Lin","year":"1992","unstructured":"Lin, J.H., Vitter, J.S.: Approximation algorithms for geometric median problems. Information Processing Letters\u00a044, 245\u2013249 (1992)","journal-title":"Information Processing Letters"},{"key":"2_CR29","volume-title":"Proc. ACM MobiCom","author":"S. Meguerdichian","year":"2001","unstructured":"Meguerdichian, S., et al.: Exposure In Wireless Ad-Hoc Sensor Networks. In: Proc. ACM MobiCom, ACM Press, New York (2001)"},{"key":"2_CR30","unstructured":"Mobile Ad hoc Networks (MANET) Charter: MANET Homepage. http:\/\/www.ietf.org\/html.charters\/manetcharter.html"},{"key":"2_CR31","first-page":"34","volume-title":"IEEE international conference on Mobile computing and networking","author":"E. Pagani","year":"1997","unstructured":"Pagani, E., Rossi, G.P.: Reliable broadcast in mobile multi-hop packet networks. In: IEEE international conference on Mobile computing and networking, pp. 34\u201342. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"2_CR32","first-page":"27","volume":"11","author":"D. Perez-Brito","year":"1997","unstructured":"Perez-Brito, D., Moreno-Perez, J.A., Rodriguez-Martin, I.: The finite dominating set for the p-facility centdian network location problem. Location Science\u00a011, 27\u201340 (1997)","journal-title":"Location Science"},{"key":"2_CR33","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0966-8349(98)00057-6","volume":"6","author":"D. Perez-Brito","year":"1998","unstructured":"Perez-Brito, D., Moreno-Perez, J.A., Rodriguez-Martin, I.: The 2-facility centdian network problem. Location Science\u00a06, 369\u2013381 (1998)","journal-title":"Location Science"},{"issue":"4","key":"2_CR34","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.20112","volume":"47","author":"J. Puerto","year":"2006","unstructured":"Puerto, J., et al.: The bi-criteria doubly weighted center-median path problem on a tree. Networks\u00a047(4), 237\u2013247 (2006)","journal-title":"Networks"},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10107-004-0547-2","volume":"102","author":"J. Puerto","year":"2005","unstructured":"Puerto, J., Tamir, A.: Locating tree-shaped facilities using the ordered median objective. Mathematical Programming\u00a0102, 313\u2013338 (2005)","journal-title":"Mathematical Programming"},{"key":"2_CR36","unstructured":"Pusateri, T.: Distance Vector Multicast Routing Protocol. Internet Draft draft-ietf-idmr-dvmrp-v3-09.txt, Internet Engineering Task Force (1999)"},{"key":"2_CR37","unstructured":"Ravi, R.: Steiner trees and beyond: Approximation algorithms for network design. Ph.D. Dissertation, Brown University (1993)"},{"key":"2_CR38","first-page":"770","volume-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"G. Robins","year":"2000","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 770\u2013779. ACM Press, New York (2000)"},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1999","unstructured":"Tamir, A.: An O(pn) algorithm for p-median and related problems on tree graphs. Operations Research Letters\u00a019, 59\u201364 (1999)","journal-title":"Operations Research Letters"},{"key":"2_CR40","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0166-218X(98)00059-6","volume":"87","author":"A. Tamir","year":"1998","unstructured":"Tamir, A.: Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem. Discrete Applied Mathematics\u00a087, 229\u2013243 (1998)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"2_CR41","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-O","volume":"32","author":"A. Tamir","year":"1998","unstructured":"Tamir, A., Perez-Brito, D., Moreno-Perez, J.A.: A polynomial algorithm for the p-centdian problem on a tree. Networks\u00a032(4), 255\u2013262 (1998)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72606-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T17:19:18Z","timestamp":1708363158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72606-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540726050","9783540726067"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72606-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}