{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T17:03:08Z","timestamp":1783184588734,"version":"3.54.6"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,12,30]],"date-time":"2005-12-30T00:00:00Z","timestamp":1135900800000},"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":[[2006,6]]},"DOI":"10.1007\/s11276-005-5275-x","type":"journal-article","created":{"date-parts":[[2006,2,7]],"date-time":"2006-02-07T17:02:35Z","timestamp":1139331755000},"page":"287-299","source":"Crossref","is-referenced-by-count":68,"title":["Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks"],"prefix":"10.1007","volume":"12","author":[{"given":"E.","family":"Althaus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"C\u0103linescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"I. I.","family":"M\u0103ndoiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Prasad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"N.","family":"Tchervenski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.","family":"Zelikovsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,12,30]]},"reference":[{"key":"5275_CR1","unstructured":"E.\u00a0Althaus, G.\u00a0C\u0103linescu, I.I. M\u0103ndoiu, S.\u00a0Prasad, N.\u00a0Tchervenski and A.Z. Zelikovsky, Power efficient range assignment in ad-hoc wireless networks, in: Proc. IEEE Wireless Communications and Networking Conference (WCNC) (2003) pp. 1889\u20131894."},{"key":"5275_CR2","doi-asserted-by":"crossref","unstructured":"P. Berman and V. Ramaiyer, Improved approximations for the Steiner tree problem, Journal of Algorithms 17 (1994) 381\u2013408.","DOI":"10.1006\/jagm.1994.1041"},{"key":"5275_CR3","doi-asserted-by":"crossref","unstructured":"D.M. Blough, M.\u00a0Leoncini, G.\u00a0Resta and P.\u00a0Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), (Kluwer Academic Publishers, 2002) pp. 71\u201382.","DOI":"10.1007\/978-0-387-35608-2_7"},{"key":"5275_CR4","doi-asserted-by":"crossref","unstructured":"A.\u00a0Borchers and D.-Z. Du, The k-Steiner ratio in graphs, SIAM Journal on Computing 26 (1997) 857\u2013869.","DOI":"10.1137\/S0097539795281086"},{"key":"5275_CR5","doi-asserted-by":"crossref","unstructured":"P.M. Camerini, G.\u00a0Galbiati and F.\u00a0Maffioli, Random pseudo-polynomial algorithms for exact matroid problems, Journal of Algorithms 13 (1992) 258\u2013273.","DOI":"10.1016\/0196-6774(92)90018-8"},{"key":"5275_CR6","doi-asserted-by":"crossref","unstructured":"E.-A. Choukhmane, Une heuristique pour le probleme de l\u2019arbre de Steiner, RAIRO Rech. Oper 12 (1978) 207\u2013212.","DOI":"10.1051\/ro\/1978120202071"},{"key":"5275_CR7","unstructured":"T.\u00a0Chu and I.\u00a0Nikolaidis, Energy efficient broadcast in mobile ad hoc networks, in: Proc. AD-HOC Networks and Wireless (2002)."},{"key":"5275_CR8","unstructured":"A.E.F. Clementi, P.\u00a0Crescenzi, P.\u00a0Penna, G.\u00a0Rossi and P.\u00a0Vocca, On the complexity of computing minimum energy consumption broadcast subgraphs, in: Symposium on Theoretical Aspects of Computer Science, (2001) pp. 121\u2013131."},{"key":"5275_CR9","doi-asserted-by":"crossref","unstructured":"A.E.F. Clementi, P.\u00a0Penna and R.\u00a0Silvestri, On the power assignment problem in radio networks, Electronic Colloquium on Computational Complexity (ECCC) (054), 2000.","DOI":"10.1007\/3-540-46541-3_54"},{"key":"5275_CR10","unstructured":"T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, 2nd ed. (MIT Press, Cambridge, Massachusetts, 2001)."},{"key":"5275_CR11","doi-asserted-by":"crossref","unstructured":"G.\u00a0C\u0103linescu, I.I. M\u0103ndoiu and A.Z. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks. in: 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), Kluwer Academic Publishers, 2002, pp. 119\u2013130.","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"5275_CR12","doi-asserted-by":"crossref","unstructured":"M.\u00a0de\u00a0Berg, M.\u00a0van Kreveld, M.\u00a0Overmars and O.\u00a0Schwarzkopf, Computational Geometry \u2014 Algorithms and Applications (Springer Verlag, Berlin, 1997).","DOI":"10.1007\/978-3-662-03427-9"},{"key":"5275_CR13","unstructured":"D.-Z. Du, Y.-J. Zhang and Q.\u00a0Feng, On better heuristic for Euclidean Steiner minimum trees, in: Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science (1991) pp. 431\u2013439."},{"key":"5275_CR14","doi-asserted-by":"crossref","unstructured":"S.\u00a0Guha and S.\u00a0Khuller, Approximation algorithms for connected dominating sets, Algorithmica 20 (1998) 374\u2013387.","DOI":"10.1007\/PL00009201"},{"key":"5275_CR15","doi-asserted-by":"crossref","unstructured":"A.\u00a0B. Kahng and G.\u00a0Robins, A new class of iterative Steiner tree heuristics with good performance, IEEE Transactions on Computer-Aided Design 11 (1992) 893\u2013902.","DOI":"10.1109\/43.144853"},{"key":"5275_CR16","doi-asserted-by":"crossref","unstructured":"L.M. Kirousis, E.\u00a0Kranakis, D.\u00a0Krizanc and A.\u00a0Pelc, Power consumption in packet radio networks, Theoretical Computer Science 243 (2000) 289\u2013305.","DOI":"10.1016\/S0304-3975(98)00223-0"},{"key":"5275_CR17","doi-asserted-by":"crossref","unstructured":"L.\u00a0Kou, G.\u00a0Markowsky and L.\u00a0Berman, A fast algorithm for Steiner trees, Acta Informatica 15 (1981) 141\u2013145.","DOI":"10.1007\/BF00288961"},{"key":"5275_CR18","unstructured":"E.\u00a0Lloyd, R.\u00a0Liu, M.\u00a0Marathe, R.\u00a0Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. ACM MobiHoc (2002) pp. 123\u2013134."},{"key":"5275_CR19","unstructured":"L.\u00a0Lov\u00e1sz and M.D. Plummer, Matching Theory. (North-Holland, Amsterdam\u2013New York, 1986)."},{"key":"5275_CR20","unstructured":"M.\u00a0Padberg and L.\u00a0Wolsey, Trees and cuts, Anals of Discrete Mathematics 17 (1983) 511\u2013517."},{"key":"5275_CR21","doi-asserted-by":"crossref","unstructured":"H.J. Promel and A.\u00a0Steger, A new approximation algorithm for the Steiner tree problem with performance ratio 5\/3, Journal of Algorithms 36 (2000) 89\u2013101.","DOI":"10.1006\/jagm.2000.1086"},{"key":"5275_CR22","unstructured":"R.\u00a0Ramanathan and R.\u00a0Hain, Topology control of multihop wireless networks using transmit power adjustment, in: Proc. IEEE INFOCOM (2000) pp. 404\u2013413."},{"key":"5275_CR23","doi-asserted-by":"crossref","unstructured":"T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice Hall, 1996).","DOI":"10.1007\/978-1-4615-5491-2"},{"key":"5275_CR24","unstructured":"G.\u00a0Robins and A.\u00a0Zelikovsky, Improved Steiner tree approximation in graphs, in: Proceedings of the 11th ACM-SIAM Annual Symposium on Discrete Algorithms (2000) pp. 770\u2013779."},{"key":"5275_CR25","unstructured":"SCIL\u2013Symbolic Constraints for Integer Linear programming. www.mpi-sb.mpg.de\/SCIL."},{"key":"5275_CR26","doi-asserted-by":"crossref","unstructured":"S.\u00a0Singh, C.S. Raghavendra and J.\u00a0Stepanek, Power-aware broadcasting in mobile ad hoc networks, in: Proceedings of IEEE PIMRC, 1999.","DOI":"10.1145\/288235.288286"},{"key":"5275_CR27","unstructured":"A.S. Tanembaum, Computer Networks, 3rd ed. (Prentice Hall, 1996)."},{"key":"5275_CR28","doi-asserted-by":"crossref","unstructured":"Mikkel Thorup, Undirected single-source shortest paths with positive integer weights in linear time, Journal of the ACM 46 (1999) 362\u2013394.","DOI":"10.1145\/316542.316548"},{"key":"5275_CR29","unstructured":"P.-J. Wan, G.\u00a0Calinescu, X.-Y. Li and O.\u00a0Frieder, Minimum energy broadcast routing in static ad hoc wireless networks, in: Proc. IEEE INFOCOM (2001) pp. 1162\u20131171."},{"key":"5275_CR30","unstructured":"J.E. Wieselthier, G.D. Nguyen and A.\u00a0Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: Proc. IEEE INFOCOM (2000) pp. 585\u2013594."},{"key":"5275_CR31","doi-asserted-by":"crossref","unstructured":"A.\u00a0Zelikovsky, An 11\/6-approximation algorithm for the network Steiner problem, Algorithmica 9 (1993) 463\u2013470.","DOI":"10.1007\/BF01187035"},{"key":"5275_CR32","unstructured":"A.\u00a0Zelikovsky, Better approximation bounds for the network and Euclidean Steiner tree problems, Technical Report CS-96-06, Department of Computer Science, University of Virginia, 1996."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-005-5275-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-005-5275-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-005-5275-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:01:29Z","timestamp":1559394089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-005-5275-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,30]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["5275"],"URL":"https:\/\/doi.org\/10.1007\/s11276-005-5275-x","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,30]]}}}