{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:51:37Z","timestamp":1767984697723,"version":"3.49.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,4,29]],"date-time":"2013-04-29T00:00:00Z","timestamp":1367193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2013,4,29]]},"abstract":"<jats:p>We consider an important problem of wireless sensor network (WSN) routing topology inference\/tomography from indirect measurements observed at the data sink. Previous studies on WSN topology tomography are restricted to static routing tree estimation, which is unrealistic in real-world WSN time-varying routing due to wireless channel dynamics. We study general WSN routing topology inference where routing structure is dynamic. We formulate the problem as a novel compressed sensing problem. We then devise a suite of decoding algorithms to recover the routing path of each aggregated measurement. Our approach is tested and evaluated though simulations with favorable results. WSN routing topology inference capability is essential for routing improvement, topology control, anomaly detection and load balance to enable effective network management and optimized operations of deployed WSNs.<\/jats:p>","DOI":"10.1145\/2479957.2479961","type":"journal-article","created":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T19:47:09Z","timestamp":1367437629000},"page":"21-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Routing topology inference for wireless sensor networks"],"prefix":"10.1145","volume":"43","author":[{"given":"Yao","family":"Liang","sequence":"first","affiliation":[{"name":"Indiana University &amp; Purdue University Indianapolis, Indianapolis, Indiana, USA"}]},{"given":"Rui","family":"Liu","sequence":"additional","affiliation":[{"name":"Indiana University &amp; Purdue University Indianapolis, Indianapolis, Indiana, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,4,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2002.993145"},{"key":"e_1_2_1_2_1","first-page":"10","volume-title":"IEEE Personal Communications","author":"Bonnet P.","year":"2002"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1024422"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/79.998081"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015475"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498451"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.16"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.805026"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5684036"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2149549"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2007.4301292"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.271"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062101"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984680"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843557"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683336"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIS.2007.170"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CMC.2009.314"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460412.1460416"}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2479957.2479961","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2479957.2479961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:28Z","timestamp":1750235728000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2479957.2479961"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,29]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4,29]]}},"alternative-id":["10.1145\/2479957.2479961"],"URL":"https:\/\/doi.org\/10.1145\/2479957.2479961","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2013,4,29]]},"assertion":[{"value":"2013-04-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}