{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:28:20Z","timestamp":1762100900099},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/tsp.2009.2014814","type":"journal-article","created":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T19:37:11Z","timestamp":1234553831000},"page":"2050-2063","source":"Crossref","is-referenced-by-count":35,"title":["Energy-Efficient Routing for Signal Detection in Wireless Sensor Networks"],"prefix":"10.1109","volume":"57","author":[{"family":"Yang Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.S.","family":"Blum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.M.","family":"Sadler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1002\/net.3230100403","article-title":"a dual algorithm for the constrained shortest path problem","volume":"10","author":"handler","year":"1980","journal-title":"Networks"},{"key":"ref38","author":"dumitrescu","year":"2002","journal-title":"Constrained path and cycle problems"},{"key":"ref33","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230210206"},{"key":"ref31","first-page":"151","article-title":"finding a minimal-ratio elementary path in a network","volume":"3","author":"tung","year":"1987","journal-title":"Asia-Pac J Oper Res"},{"key":"ref30","author":"lawler","year":"1976","journal-title":"Combinatorial Optimization Networks and Matroids"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1111\/1475-3995.00003"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1106159"},{"key":"ref35","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050058"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074535"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2341-0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832213"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MAES.2005.1499273"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"ref20","author":"van trees","year":"1968","journal-title":"Detection Estimation and Modulation Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/45.580443"},{"key":"ref21","year":"1990","journal-title":"Radar Handbook"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.530"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2006.243915"},{"key":"ref26","author":"rappaport","year":"2002","journal-title":"Wireless Communications Principles and Practice"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/98.878533"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/288235.288286","article-title":"power-aware routing in mobile ad hoc networks","author":"singh","year":"1998","journal-title":"Proc 4th Annu ACM\/IEEE Int Conf Mobile Computing Networking (MOBICOM)"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/35.925682"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.812"},{"key":"ref52","author":"mehlhorn","year":"1999","journal-title":"LEDA A Platform for Combinatorial and Geometric Computing"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843536"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.919101"},{"key":"ref40","first-page":"305","article-title":"solving hard constrained shortest path problems by lagrangean relaxation and branch-and-bound algorithms","volume":"53","author":"minoux","year":"1986","journal-title":"Methods Oper Res"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2006.243785"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2006.302317"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2004.1368893"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.833122"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843563"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2004.1381916"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.070221"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1933.0009"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02551407"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.1981.309178"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/5.554209"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/5.554208"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2006.1657814"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.806982"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1007\/978-3-540-30110-3_77","volume":"3195","author":"xerri","year":"2004","journal-title":"Lecture Notes in Computer Science"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/7.489500"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00433-2"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/BF02523689"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-48318-7_4","volume":"1668","author":"jimnez","year":"1999","journal-title":"Lecture Notes in Computer Science"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref42","author":"ziegelmann","year":"2001","journal-title":"Constrained shortest paths and related problems"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190402"},{"key":"ref44","author":"bertsimas","year":"1997","journal-title":"Introduction to Linear Optimization"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/net.20247"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/78\/4939475\/04776475.pdf?arnumber=4776475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:45:27Z","timestamp":1633913127000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4776475\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":53,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2009.2014814","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}