{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:03:42Z","timestamp":1709823822706},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T00:00:00Z","timestamp":1304553600000},"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":[[2011,7]]},"DOI":"10.1007\/s11276-011-0346-7","type":"journal-article","created":{"date-parts":[[2011,5,4]],"date-time":"2011-05-04T13:35:55Z","timestamp":1304516155000},"page":"1251-1258","source":"Crossref","is-referenced-by-count":5,"title":["Minimum power energy spanners in wireless ad hoc networks"],"prefix":"10.1007","volume":"17","author":[{"given":"A. Karim","family":"Abu-Affash","sequence":"first","affiliation":[]},{"given":"Rom","family":"Aschner","sequence":"additional","affiliation":[]},{"given":"Paz","family":"Carmi","sequence":"additional","affiliation":[]},{"given":"Matthew J.","family":"Katz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,5]]},"reference":[{"issue":"1","key":"346_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I. Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D., & Soares, J. (1993). On sparse spanners of weighted graphs. Discrete and Computational Geometry, 9(1), 81\u2013100.","journal-title":"Discrete and Computational Geometry"},{"issue":"2\u20133","key":"346_CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2004.05.019","volume":"324","author":"P. Bose","year":"2004","unstructured":"Bose, P., & Morin, P. (2004). Competitive online routing in geometric graphs. Theoretical Computer Science, 324(2\u20133), 273\u2013288.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"346_CR3","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1137\/S0097539700369387","volume":"33","author":"P. Bose","year":"2004","unstructured":"Bose, P., & Morin, P. (2004). Online routing in triangulations. SIAM Journal on Computing, 33(4), 937\u2013951.","journal-title":"SIAM Journal on Computing"},{"key":"346_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1142\/S0218195995000088","volume":"5","author":"B. Chandra","year":"1995","unstructured":"Chandra, B., Das, G., Narasimhan, G., & Soares, J. (1995). New sparseness results on graph spanners. International Journal of Computational Geometry and Applications, 5, 125\u2013144.","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"3","key":"346_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/26.20105","volume":"37","author":"W.-T. Chen","year":"1989","unstructured":"Chen, W.-T., & Huang, N.-F. (1989). The strongly connecting problem on multihop packet radio networks. IEEE Transactions on Communications, 37(3), 293\u2013295.","journal-title":"IEEE Transactions on Communications"},{"key":"346_CR6","unstructured":"Clementi, A. E. F., Penna, P., & Silvestri, R. (1999). Hardness results for the power range assignmet problem in packet radio networks. In Proceedings of the third international workshop on approximation algorithms for combinatorial optimization problems (RANDOM-APPROX\u201999) (pp. 197\u2013208). London, UK: Springer."},{"issue":"4","key":"346_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1142\/S0218195997000193","volume":"7","author":"G. Das","year":"1997","unstructured":"Das, G., & Narasimhan, G. (1997). A fast algorithm for constructing sparse Euclidean spanners. International Journal of Computational Geometry and Applications, 7(4), 297\u2013315.","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"346_CR8","unstructured":"Das, G., Narasimhan, G., & Salowe, J. S. (1995) A new way to weight malnourished Euclidean graphs. In Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms (pp. 215\u2013222)."},{"key":"346_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational geometry: Algorithms and applications","author":"M. Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., Kreveld, M., & Overmars, M. (2008). Computational geometry: Algorithms and applications. London: Springer."},{"key":"346_CR10","doi-asserted-by":"crossref","unstructured":"Estrin, D., Govindan, R., Heidemann, J., Kumar, S. (1999). Next century challenges: Scalable coordination in sensor networks. In Proceedings of the ACM\/IEEE international conference on mobile computing and networking (MOBICOM 1999) (pp. 263\u2013270). Seattle, Washington, USA.","DOI":"10.1145\/313451.313556"},{"issue":"1","key":"346_CR11","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/35.894385","volume":"39","author":"J.-P. Hubaux","year":"2001","unstructured":"Hubaux, J.-P., Gross, T., Boudec, J.-Y.-L., & Vetterli, M. (2001). Towards self-organized mobile ad hoc networks: The terminodes project. IEEE Communications Magazine, 39(1), 118\u2013124.","journal-title":"IEEE Communications Magazine"},{"issue":"1-2","key":"346_CR12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L. Kirousis","year":"2000","unstructured":"Kirousis, L., Kranakis, E., Krizanc, D., & Pelc, A. (2000). Power consumption in packet radio networks. Theoretical Computer Science, 243(1\u20132), 289\u2013305.","journal-title":"Theoretical Computer Science"},{"key":"346_CR13","unstructured":"Li, X.-Y., Wan, P.-J., & Wang, Y. (2001). Power efficient and sparse spanner for wireless ad hoc networks. In Proceddings 10th international conference computer communications and networks (pp. 564\u2013567)."},{"key":"346_CR14","volume-title":"Wireless information networks","author":"K. Pahlavan","year":"1995","unstructured":"Pahlavan, K., & Levesque, A. H. (1995). Wireless information networks. New Jersey: Wiley-Interscience."},{"issue":"5","key":"346_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/332833.332838","volume":"43","author":"G. J. Pottie","year":"2000","unstructured":"Pottie, G. J., & Kaiser, W. J. (2000). Wireless integrated network sensors. Communication of the ACM, 43(5), 51\u201358.","journal-title":"Communication of the ACM"},{"issue":"7","key":"346_CR16","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/2.869369","volume":"33","author":"J. Rabaey","year":"2000","unstructured":"Rabaey, J., Ammer, M., da Silva, Jr. J., Patel D., & Roundy, S. (2000). Picoradio supports ad hoc ultra-low power wireless networking. IEEE Computer Magazine, 33(7), 42\u201348.","journal-title":"IEEE Computer Magazine"},{"key":"346_CR17","volume-title":"Wireless communications: Principles and practice","author":"T. Rappaport","year":"1996","unstructured":"Rappaport, T. (1996). Wireless communications: Principles and practice. Prentice-Hall, Englewood Cliffs, NY."},{"key":"346_CR18","doi-asserted-by":"crossref","unstructured":"Shpungin, H., & Segal, M. (2009). Near optimal multicriteria spanner constructions in wireless ad-hoc networks. In Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM 2009) (pp. 163\u2013171).","DOI":"10.1109\/INFCOM.2009.5061918"},{"issue":"1","key":"346_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10878-006-5980-0","volume":"11","author":"Y. Wang","year":"2006","unstructured":"Wang, Y., & Li, X.-Y. (2006). Minimum power assignment in wireless ad hoc networks with spanner property. Journal of Combinatorial Optimization, 11(1), 99\u2013112.","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-011-0346-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-011-0346-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-011-0346-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T13:58:46Z","timestamp":1560175126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-011-0346-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,5]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["346"],"URL":"https:\/\/doi.org\/10.1007\/s11276-011-0346-7","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,5]]}}}