{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T08:10:19Z","timestamp":1772525419476,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"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":[[2005,7]]},"DOI":"10.1007\/s11276-005-1765-0","type":"journal-article","created":{"date-parts":[[2005,7,22]],"date-time":"2005-07-22T03:06:33Z","timestamp":1122001593000},"page":"401-417","source":"Crossref","is-referenced-by-count":40,"title":["Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Anand","family":"Srinivas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eytan","family":"Modiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1765_CR1","unstructured":"A. Ahluwalia, E. Modiano and L. Shu, On the complexity and distributed construction of energy-efficient broadcast trees in static ad hoc wireless networks, in: Proc. 36th Annual Conference on Information Sciences and Systems (CISS) (March 2002)."},{"key":"1765_CR2","doi-asserted-by":"crossref","unstructured":"S. Banerjee and A. Misra, Minimum energy paths for reliable communication in multi-hop wireless networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (June 2002) pp. 146\u2013156.","DOI":"10.1145\/513800.513818"},{"key":"1765_CR3","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"D. Bertsekas and R. Gallager, Data Networks (Prentice-Hall Upper Saddle River, NJ, 1992)."},{"key":"1765_CR4","doi-asserted-by":"crossref","unstructured":"R. Bhandari, Optimal physical diversity algorithms and survivable networks, in: Proc. Second IEEE Symposium on Computers and Communications (July 1997) pp. 433\u2013441.","DOI":"10.1109\/ISCC.1997.616037"},{"key":"1765_CR5","doi-asserted-by":"crossref","unstructured":"M. Cagali, J.P. Hubaux and C. Enz, Minimum energy broadcast in all-wireless networks: NP-completeness and distribution issues, in: Proc. Ninth ACM International Conference on Mobile Networking and Computing (MOBICOM) (September 2002) pp. 172\u2013182.","DOI":"10.1145\/570645.570667"},{"key":"1765_CR6","doi-asserted-by":"crossref","unstructured":"G. Calinescu, I.I. Mandoiu and A. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks, in: Proc. 2nd IFIP International Conference on Theoretical Computer Science (August 2002) pp. 119\u2013130.","DOI":"10.1007\/978-0-387-35608-2_11"},{"key":"1765_CR7","unstructured":"J.H. Chang and L. Tassiulas, Energy conserving routing in wireless ad-hoc networks, in: Proc. IEEE INFOCOM (March 2000) pp. 22\u201331."},{"key":"1765_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/26.20105","volume":"37","author":"W.T. Chen","year":"1989","unstructured":"W.T. Chen and N.F. Huang, The strongly connecting problem on multihop packet radio networks, IEEE Transactions on Communications 37 (1989) 293\u2013295.","journal-title":"IEEE Transactions on Communications"},{"key":"1765_CR9","unstructured":"C. Cheng, S. Kumar and J.J. Garcia-Luna-Aceves, An efficient distributed algorithm for routing over k-disjoint paths of minimum total length, in: Proc. 28th Annual Allerton Conference on Communication, Control, and Computing (October 1990)."},{"key":"1765_CR10","doi-asserted-by":"crossref","unstructured":"A.E.F. Clementi, P. Crescenzi, P. Penna and P.V.G. Rossi, On the complexity of computing minimum energy consumption broadcast subgraphs, in: Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (February 2001) pp. 121\u2013131.","DOI":"10.1007\/3-540-44693-1_11"},{"key":"1765_CR11","doi-asserted-by":"crossref","unstructured":"A. Ephremides, Energy concerns in wireless networks, IEEE Wireless Communications 9 (August 2002) 48\u201359.","DOI":"10.1109\/MWC.2002.1028877"},{"key":"1765_CR12","doi-asserted-by":"crossref","unstructured":"L.M. Feeney and M. Nilson, Investigating the energy consumption of a wireless network interface in an ad hoc networking environment, in: Proc. IEEE INFOCOM (April 2001) pp. 1548\u20131557.","DOI":"10.1109\/INFCOM.2001.916651"},{"key":"1765_CR13","doi-asserted-by":"crossref","unstructured":"S.J. Lee and M. Gerla, split multipath routing with maximally disjoint paths in ad hoc networks, in: Proc. IEEE ICC (June 2001) pp. 3201\u20133205.","DOI":"10.1109\/ICC.2001.937262"},{"key":"1765_CR14","doi-asserted-by":"crossref","unstructured":"W. Liang, Constructing minimum energy broadcast trees in wireless ad hoc networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (June 2002) pp. 112\u2013122.","DOI":"10.1145\/513800.513815"},{"key":"1765_CR15","doi-asserted-by":"crossref","unstructured":"E. Lloyd, R. Liu, M. Marathe, R. Ramanathan and S.S. Ravi, Algorithmic aspects of topology control problems for ad hoc networks, in: Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (June 2002) pp. 123\u2013134.","DOI":"10.1145\/513800.513816"},{"key":"1765_CR16","doi-asserted-by":"crossref","unstructured":"A. Nasipuri and S.R. Das, On-demand multi-path routing for mobile ad hoc networks, in: Proc. IEEE ICCCN (October 1999) pp. 64\u201370.","DOI":"10.1109\/ICCCN.1999.805497"},{"key":"1765_CR17","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/18.212275","volume":"39","author":"R.G. Ogier","year":"May 1993","unstructured":"R.G. Ogier, V. Rutenburg and N. Shacham, Distributed algorithms for computing shortest pairs of disjoint paths, IEEE Transaction on Information Theory 39 (May 1993) 173\u2013182.","journal-title":"IEEE Transaction on Information Theory"},{"key":"1765_CR18","doi-asserted-by":"crossref","unstructured":"Richard G. Ogier and Nachum Shacham, A distributed algorithm for finding shortest pairs of disjoint paths, in: Proc. IEEE INFOCOM (April 1989) pp. 173\u2013182.","DOI":"10.1109\/INFCOM.1989.101450"},{"key":"1765_CR19","doi-asserted-by":"crossref","unstructured":"R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in: Proc. IEEE INFOCOM (March 2000) pp. 404\u2013413.","DOI":"10.1109\/INFCOM.2000.832213"},{"key":"1765_CR20","volume-title":"Wireless Communications: Principles and Practices","author":"T.S. Rappaport","year":"1996","unstructured":"T.S. Rappaport, Wireless Communications: Principles and Practices (Prentice-Hall Upper Saddle River, NJ, 1996)."},{"key":"1765_CR21","doi-asserted-by":"crossref","unstructured":"D. Sidhu, R. Nair and S. Abdallah, Finding disjoint paths in networks, in: Proc. ACM SIGCOMM (September 1991) pp. 43\u201351.","DOI":"10.1145\/115992.115998"},{"key":"1765_CR22","doi-asserted-by":"crossref","unstructured":"S. Singh, M. Woo and C.S. Raghavendra, Power-aware routing in mobile ad hoc networks, in: Proc. Fifth ACM International Conference on Mobile Networking and Computing (MOBICOM) (Oct. 1998) pp. 181\u2013190.","DOI":"10.1145\/288235.288286"},{"key":"1765_CR23","doi-asserted-by":"crossref","unstructured":"A. Srinivas and E. Modiano, Minimum energy disjoint path routing in wireless ad hoc networks, in: Proc. Ninth ACM International Conference on Mobile Networking and Computing (MOBICOM) (September 2003) pp. 122\u2013133.","DOI":"10.1145\/938985.938999"},{"key":"1765_CR24","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J.W. Suurballe","year":"1974","unstructured":"J.W. Suurballe, Disjoint paths in a network, Networks 4 (1974) 125\u2013145.","journal-title":"Networks"},{"key":"1765_CR25","unstructured":"J.W. Suurballe, The single-source, all terminals problem for disjoint paths, Unpublished technical memorandum, Bell Laboratories (1982)."},{"key":"1765_CR26","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1002\/net.3230140209","volume":"14","author":"J.W. Suurballe","year":"1984","unstructured":"J.W. Suurballe and R.E. Tarjan, A quick method for finding shortest pairs of disjoint paths, Networks 14 (1984) 325\u2013336.","journal-title":"Networks"},{"key":"1765_CR27","doi-asserted-by":"crossref","unstructured":"S. Vutukury and J.J. Garcia-Luna-Aceves, MDVA: A distance-vector multipath routing protocol, in: Proc. IEEE INFOCOM (April 2001) pp. 557\u2013564.","DOI":"10.1109\/INFCOM.2001.916780"},{"key":"1765_CR28","doi-asserted-by":"crossref","unstructured":"R. Wattenhofer, L. Li, P. Bahl and Y. Wang, Distributed topology control for power efficient operation in multihop wireless ad-hoc networks, in: Proc. IEEE INFOCOM (April 2001) pp. 1388\u20131397.","DOI":"10.1109\/INFCOM.2001.916634"},{"key":"1765_CR29","doi-asserted-by":"crossref","unstructured":"J.E. Wieselthier, G.D. Nguyen and A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, in: Proc. IEEE INFOCOM (March 2000) pp. 585\u2013594.","DOI":"10.1109\/INFCOM.2000.832232"},{"key":"1765_CR30","doi-asserted-by":"crossref","unstructured":"J.E. Wieselthier, G.D. Nguyen and A. Ephremides, The energy efficiency of distributed algorithms for broadcasting in ad hoc networks, in: Proc. The 5th International Symposium on Wireless Personal Multimedia Communications (Oct. 2002) pp. 499\u2013503.","DOI":"10.1109\/WPMC.2002.1088224"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-005-1765-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-005-1765-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-005-1765-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T16:10:47Z","timestamp":1735834247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-005-1765-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["1765"],"URL":"https:\/\/doi.org\/10.1007\/s11276-005-1765-0","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}