{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:09Z","timestamp":1771036329482,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,10,25]],"date-time":"2008-10-25T00:00:00Z","timestamp":1224892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1007\/s11036-008-0105-x","type":"journal-article","created":{"date-parts":[[2008,10,24]],"date-time":"2008-10-24T10:17:30Z","timestamp":1224843450000},"page":"415-432","source":"Crossref","is-referenced-by-count":18,"title":["Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes"],"prefix":"10.1007","volume":"14","author":[{"given":"Moshe","family":"Laifenfeld","sequence":"first","affiliation":[]},{"given":"Ari","family":"Trachtenberg","sequence":"additional","affiliation":[]},{"given":"Reuven","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"David","family":"Starobinski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,25]]},"reference":[{"key":"105_CR1","doi-asserted-by":"crossref","unstructured":"Juang P, Oki H, Wang Y, Martonosi M, Peh LS, Rubenstein D (2002) Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet. In: ASPLOS-X: proceedings of the 10th international conference on architectural support for programming languages and operating systems, San Jose, 5\u20139 October 2002, pp\u00a096\u2013107","DOI":"10.1145\/605397.605408"},{"key":"105_CR2","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/1098918.1098925","volume-title":"SenSys \u201905: proceedings of the 3rd international conference on embedded networked sensor systems","author":"G Tolle","year":"2005","unstructured":"Tolle G, Polastre J, Szewczyk R, Culler D, Turner N, Tu K, Burgess S, Dawson T, Buonadonna P, Gay D, Hong W (2005) A macroscope in the redwoods. In: SenSys \u201905: proceedings of the 3rd international conference on embedded networked sensor systems. IEEE, Los Alamitos, pp 51\u201363"},{"key":"105_CR3","volume-title":"SenSys \u201904: Proceedings of the 2nd international conference on embedded networked sensor systems","author":"N Xu","year":"2004","unstructured":"Xu N, Rangwala S, Chintalapudi K, Ganesan D, Broad A, Govindan R, Estrin D (2004) A wireless sensor network for structural monitoring. In: SenSys \u201904: Proceedings of the 2nd international conference on embedded networked sensor systems. IEEE, Los Alamitos"},{"key":"105_CR4","unstructured":"Sensicast Systems, Inc. (2005) Pump monitoring at a nuclear generating station [Online]. http:\/\/www.sensicast.com\/solutions\/casestudys.php"},{"key":"105_CR5","first-page":"1044","volume-title":"Proceedings INFOCOM, April","author":"S Ray","year":"2003","unstructured":"Ray S, Ungrangsi R, Pellegrinin FD, Trachtenberg A, Starobinski D (2003) Robust location detection in emergency sensor networks. In: Proceedings INFOCOM, April. IEEE, Piscataway, pp 1044\u20131053"},{"issue":"6","key":"105_CR6","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1109\/JSAC.2004.830895","volume":"22","author":"S Ray","year":"2004","unstructured":"Ray S, Starobinski D, Trachtenberg A, Ungrangsi R (2004) Robust location detection with sensor networks. IEEE J Sel Areas Commun 22(6):1016\u20131025, August (Special Issue on Fundamental Performance Limits of Wireless Sensor Networks)","journal-title":"IEEE J Sel Areas Commun"},{"key":"105_CR7","unstructured":"Berger-Wolf T, Hart W, Saia J (2003) Discrete sensor placement problems in distribution networks. In: SIAM conference on mathematics for industry, Toronto, October 2003"},{"issue":"13","key":"105_CR8","doi-asserted-by":"crossref","first-page":"1385","DOI":"10.1016\/j.mcm.2005.03.005","volume":"42","author":"T Berger-Wolf","year":"2005","unstructured":"Berger-Wolf T, Hart W, Saia J (2005) Discrete sensor placement problems in distribution networks. J Math Comput Model 42(13):1385\u20131396","journal-title":"J Math Comput Model"},{"issue":"2","key":"105_CR9","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.661507","volume":"44","author":"MG Karpovsky","year":"1998","unstructured":"Karpovsky MG, Chakrabarty K, Levitin LB (1998) A new class of codes for identification of vertices in graphs. IEEE Trans Inf Theory 44(2):599\u2013611, March","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"105_CR10","doi-asserted-by":"crossref","first-page":"2109","DOI":"10.1016\/S0304-3975(02)00536-4","volume":"290","author":"I Charon","year":"2003","unstructured":"Charon I, Hudry O, Lobstein A (2003) Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theor Comp Sci 290(3):2109\u20132120","journal-title":"Theor Comp Sci"},{"issue":"8","key":"105_CR11","doi-asserted-by":"crossref","first-page":"2192","DOI":"10.1109\/TIT.2002.800490","volume":"48","author":"I Charon","year":"2002","unstructured":"Charon I, Hudry O, Lobstein A (2002) Identifying and locating-dominating codes: NP-completeness results for directed graphs. IEEE Trans Inf Theory 48(8):2192\u20132200, August","journal-title":"IEEE Trans Inf Theory"},{"issue":"14","key":"105_CR12","doi-asserted-by":"crossref","first-page":"2032","DOI":"10.1016\/j.dam.2006.03.011","volume":"154","author":"J Moncel","year":"2006","unstructured":"Moncel J (2006) On graphs of n vertices having an identifying code of cardinality ${\\left\\lceil {log_2(n+1)} \\right\\rceil}$ . Discrete Appl Math 154(14):2032\u20132039","journal-title":"Discrete Appl Math"},{"key":"105_CR13","doi-asserted-by":"crossref","unstructured":"Laifenfeld M (2008) Localization and identification in networks using robust identifying codes. In: Information theory and application workshop, San Diego, 27 January\u20131 February 2008","DOI":"10.1109\/ITA.2008.4601043"},{"key":"105_CR14","doi-asserted-by":"crossref","first-page":"3929","DOI":"10.1109\/TIT.2008.928263","volume":"54","author":"M Laifenfeld","year":"2008","unstructured":"Laifenfeld M, Trachtenberg A (2008) Identifying codes and covering problems. IEEE Trans Inf Theory 54:3929\u20133950","journal-title":"IEEE Trans Inf Theory"},{"key":"105_CR15","first-page":"197","volume-title":"IEEE broadnets 2007, September","author":"M Laifenfeld","year":"2007","unstructured":"Laifenfeld M, Trachtenberg A, Cohen R, Starobinski D (2007) Joint monitoring and routing in wireless sensor networks using robust identifying codes. In: IEEE broadnets 2007, September. IEEE, Piscataway, pp 197\u2013206"},{"key":"105_CR16","unstructured":"Moncel J, Frieze A, Martin R, Ruszink M, Smyth C (2005) Identifying codes in random networks. In: IEEE international symposium on information theory, Adelaide, 4\u20139 September 2005"},{"key":"105_CR17","volume-title":"Introduction to algorithms","author":"T Cormen","year":"2001","unstructured":"Cormen T, Leiserson C, Rivest R, Stein C (2001) Introduction to algorithms. MIT, Cambridge"},{"key":"105_CR18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson DS (1974) Approximation algorithms for combinatorial problems. J Comput Syst Sci 9:256\u2013278","journal-title":"J Comput Syst Sci"},{"issue":"4","key":"105_CR19","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of ln n for approximating set cover. J ACM 45(4):634\u2013652","journal-title":"J ACM"},{"key":"105_CR20","volume-title":"Approximation algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani V (2001) Approximation algorithms. Springer, Heidelberg"},{"key":"105_CR21","doi-asserted-by":"crossref","unstructured":"Laifenfeld M, Trachtenberg A (2005) Disjoint identifying codes for arbitrary graphs. In: IEEE international symposium on information theory, Adelaide, 4\u20139 September 2005","DOI":"10.1109\/ISIT.2005.1523331"},{"key":"105_CR22","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0097539793260763","volume":"28","author":"S Rajagopalan","year":"1998","unstructured":"Rajagopalan S, Vazirani V (1998) Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J Comput 28:525\u2013540","journal-title":"SIAM J Comput"},{"key":"105_CR23","doi-asserted-by":"crossref","unstructured":"Bartal Y, Byers JW, Raz D (1997) Global optimization using local information with applications to flow control. In: IEEE symposium on foundations of computer science, October, pp\u00a0303\u2013312. [Online]. citeseer.ist.psu.edu\/bartal97global.html","DOI":"10.1109\/SFCS.1997.646119"},{"key":"105_CR24","doi-asserted-by":"crossref","unstructured":"Kuhn F, Wattenhofer R (2003) Constant-time distributed dominating set approximation. In: Proceedings of the 22nd ACM symposium on principles of distributed computing (PODC\u201903), pp 25\u201332, July. [Online]. citeseer.ist.psu.edu\/kuhn03constanttime.html","DOI":"10.1145\/872035.872040"},{"key":"105_CR25","unstructured":"M\u00fcller T, Sereni J-S (2007) Identifying and locating-dominating codes in (random) geometric networks. Comb Probab Comput (ITI Series 2006-323 and KAM-DIMATIA Series 2006-797)"},{"key":"105_CR26","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D Peleg","year":"1989","unstructured":"Peleg D, Upfal E (1989) A tradeoff between space and efficiency for routing tables. J ACM 36:510\u2013530","journal-title":"J ACM"},{"key":"105_CR27","first-page":"1","volume-title":"Proceedings of the thirteenth annual ACM symposium on parallel algorithms and architectures","author":"M Thorup","year":"2001","unstructured":"Thorup M, Zwick U (2001) Compact routing schemes. In: Proceedings of the thirteenth annual ACM symposium on parallel algorithms and architectures. ACM, New York, pp 1\u201310"},{"issue":"1","key":"105_CR28","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1006\/jagm.2000.1134","volume":"38","author":"L Cowen","year":"2001","unstructured":"Cowen L (2001) Compact routing with minimum stretch. J Algorithms 38(1):170\u2013183","journal-title":"J Algorithms"},{"key":"105_CR29","first-page":"217","volume":"249","author":"C Gavoille","year":"1999","unstructured":"Gavoille C (1999) A survey on interval routing schemes. Theor Comput Sci 249:217\u2013253","journal-title":"Theor Comput Sci"},{"key":"105_CR30","volume-title":"Handbook of combinatorial optimization","author":"AT Jeremy Blum","year":"2004","unstructured":"Jeremy Blum AT, Ding M Cheng, X (2004) Connected dominating set in sensor networks and MANETs. In: Du D-Z, Pardalos P (eds) Handbook of combinatorial optimization. Kluwer, Dordrecht"},{"key":"105_CR31","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1016783217662","volume":"18","author":"J Wu","year":"2001","unstructured":"Wu J, Li H (2001) A dominating-set-based routing scheme in ad hoc wireless networks. Telecommun Syst 18:13\u201336","journal-title":"Telecommun Syst"},{"key":"105_CR32","volume-title":"Handbook of wireless networks and mobile computing","author":"J Wu","year":"2002","unstructured":"Wu J (2002) Dominating-set-based routing in ad hoc wireless networks. In: Stojmenovic I (ed) Handbook of wireless networks and mobile computing. Wiley, New York"},{"key":"105_CR33","unstructured":"Chen Y, Liestman A, Liu J (2004) Clustering algorithms for ad hoc wireless networks. In: Ad hoc and sensor networks. [Online]. citeseer.ist.psu.edu\/chen04clustering.html"},{"key":"105_CR34","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/COMST.2005.1423333","volume":"7","author":"J Yu","year":"2005","unstructured":"Yu J, Chong P (2005) A survey of clustering schemes for mobile ad hoc networks. IEEE Commun Surv Tutor 7:32\u201348","journal-title":"IEEE Commun Surv Tutor"},{"issue":"2","key":"105_CR35","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/TIT.2005.862097","volume":"52","author":"I Honkala","year":"2006","unstructured":"Honkala I, Karpovsky M, Levitin L (2006) On robust and dynamic identifying codes. IEEE Trans Inf Theory 52(2):599\u2013612, February","journal-title":"IEEE Trans Inf Theory"},{"key":"105_CR36","volume-title":"23rd ACM symposium on principles of distributed computing (PODC 2004)","author":"I Abraham","year":"2004","unstructured":"Abraham I, Malkhi D (2004) Compact routing on euclidean metrics. In: 23rd ACM symposium on principles of distributed computing (PODC 2004). ACM, New York"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-008-0105-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-008-0105-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-008-0105-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T06:25:12Z","timestamp":1738477512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-008-0105-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,25]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["105"],"URL":"https:\/\/doi.org\/10.1007\/s11036-008-0105-x","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,25]]}}}