{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T21:25:55Z","timestamp":1780521955568,"version":"3.54.1"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T00:00:00Z","timestamp":1406592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["NSF-1125165, NSF-1066391"],"award-info":[{"award-number":["NSF-1125165, NSF-1066391"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003712","name":"Korea Food Research Institute","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003712","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2015,3,2]]},"abstract":"<jats:p>Sensor networks have particularly important applications in challenging environments. However, those challenging environments also pose significant challenges to network sustainability and reliability. In such environments, the network often becomes disruptive and even unavailable during downtime. This results in undesired loss of valuable spatial-temporal sensor data. Data persistence can be achieved by using in-situ encoding and caching of data through distributed mechanisms. However, the existing methods in the literature are mainly based on network random walks, which not only incur significant communication overhead, but also are prone to network or node failures. In this article, we present<jats:italic>ECPC<\/jats:italic>, a distributed<jats:italic>E<\/jats:italic>rasure<jats:italic>C<\/jats:italic>oding with randomized<jats:italic>P<\/jats:italic>ower<jats:italic>C<\/jats:italic>ontrol protocol for preserving data in disruptive sensor networks.<jats:italic>ECPC<\/jats:italic>only requires each sensor node to perform several rounds of broadcast in its neighborhood at some randomly chosen radio transmission power levels, and thus it incurs low communication overhead. We proved that<jats:italic>ECPC<\/jats:italic>achieves the expected code degree distribution and pseudo-global randomness of erasure coding principles. We have also evaluated the performance of<jats:italic>ECPC<\/jats:italic>by comparing it with several key related approaches in the literature (such as EDFC and RCDS). The performance comparisons validate that our proposed<jats:italic>ECPC<\/jats:italic>protocol can reach higher data reliability under varying node failure probabilities. In addition,<jats:italic>ECPC<\/jats:italic>protocol is also shown to be scalable with different network sizes.<\/jats:p>","DOI":"10.1145\/2629584","type":"journal-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T20:13:24Z","timestamp":1406924004000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["ECPC"],"prefix":"10.1145","volume":"11","author":[{"given":"Wen-Zhan","family":"Song","sequence":"first","affiliation":[{"name":"Georgia State University, Georgia, USA, Shanghai University of Electric Power, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingsen","family":"Xu","sequence":"additional","affiliation":[{"name":"Georgia State University, Georgia, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Debraj","family":"De","sequence":"additional","affiliation":[{"name":"Georgia State University, Georgia, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deukhyoun","family":"Heo","sequence":"additional","affiliation":[{"name":"Washington State University, Pullman, Washington, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jong-Hoon","family":"Kim","sequence":"additional","affiliation":[{"name":"Korean Food Research Institution, Seoul, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Byeong-Sam","family":"Kim","sequence":"additional","affiliation":[{"name":"Korean Food Research Institution, Seoul, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,7,29]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1927083.1927093"},{"key":"e_1_2_1_2_1","volume-title":"Spencer","author":"Alon Noga","year":"2000","unstructured":"Noga Alon and Joel H . Spencer . 2000 . The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Noga Alon and Joel H. Spencer. 2000. The Probabilistic Method. Wiley-Interscience Series in Discrete Mathematics and Optimization."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2008.64"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595350"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/285237.285258"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1147685.1147708"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2006.1661484"},{"key":"e_1_2_1_9_1","volume-title":"Low-Density Parity-Check Codes","author":"Gallager R. G.","unstructured":"R. G. Gallager . 1963. Low-Density Parity-Check Codes . MIT Press . R. G. Gallager. 1963. Low-Density Parity-Check Codes. MIT Press."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"G. R. Grimmett and D. R. Stirzaker. 2001. Probability and Random Processes (3rd ed.). Oxford University Press. G. R. Grimmett and D. R. Stirzaker. 2001. Probability and Random Processes (3rd ed.). Oxford University Press.","DOI":"10.1093\/oso\/9780198572237.001.0001"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.165"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing.","author":"Harrelson C.","unstructured":"C. Harrelson , L. Ip , and W. Wang . 2003. Limited randomness LT codes . In Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing. C. Harrelson, L. Ip, and W. Wang. 2003. Limited randomness LT codes. In Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing."},{"key":"e_1_2_1_13_1","volume-title":"Probability Theory: The Logic of Science","author":"Jaynes E. T.","unstructured":"E. T. Jaynes . 2003. Probability Theory: The Logic of Science . Cambridge University Press . E. T. Jaynes. 2003. Probability Theory: The Logic of Science. Cambridge University Press."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159943"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/958491.958506"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.194"},{"key":"e_1_2_1_17_1","volume-title":"IEEE International Conference on Communications.","author":"Lin Y.","unstructured":"Y. Lin , B. Liang , and B. Li . 2008. Geometric random linear codes in sensor networks . In IEEE International Conference on Communications. Y. Lin, B. Liang, and B. Li. 2008. Geometric random linear codes in sensor networks. In IEEE International Conference on Communications."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652135"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2007.108"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.210"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the EWSN.","author":"Munaretto D.","unstructured":"D. Munaretto , J. Widmer , M. Rossi , and M. Zorzi . 2008. Resilient coding algorithms for sensor network data persistence . In Proceedings of the EWSN. D. Munaretto, J. Widmer, M. Rossi, and M. Zorzi. 2008. Resilient coding algorithms for sensor network data persistence. In Proceedings of the EWSN."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.080143"},{"key":"e_1_2_1_23_1","volume-title":"Random Geometric Graphs","author":"Penrose M.","unstructured":"M. Penrose . 2003. Random Geometric Graphs . Oxford University Press . M. Penrose. 2003. Random Geometric Graphs. Oxford University Press."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1687299.1687342"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASS.2013.37"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555816.1555850"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629584","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2629584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:29Z","timestamp":1750227209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2629584"}},"subtitle":["Toward Preserving Downtime Data Persistence in Disruptive Wireless Sensor Networks"],"short-title":[],"issued":{"date-parts":[[2014,7,29]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,3,2]]}},"alternative-id":["10.1145\/2629584"],"URL":"https:\/\/doi.org\/10.1145\/2629584","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,29]]},"assertion":[{"value":"2013-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-07-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}