{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:40:04Z","timestamp":1760244004086,"version":"build-2065373602"},"reference-count":11,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2010,10,11]],"date-time":"2010-10-11T00:00:00Z","timestamp":1286755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In many wireless sensor network applications, the possibility of exceptions occurring is relatively small, so in a normal situation, data obtained at sequential time points by the same node are time correlated, while, spatial correlation may exist in data obtained at the same time by adjacent nodes. A great deal of node energy will be wasted if data which include time and space correlation is transmitted. Therefore, this paper proposes a data compression algorithm for wireless sensor networks based on optimal order estimation and distributed coding. Sinks can obtain correlation parameters based on optimal order estimation by exploring time and space redundancy included in data which is obtained by sensors. Then the sink restores all data based on time and space correlation parameters and only a little necessary data needs to be transmitted by nodes. Because of the decrease of redundancy, the average energy cost per node will be reduced and the life of the wireless sensor network will obviously be extended as a result.<\/jats:p>","DOI":"10.3390\/s101009065","type":"journal-article","created":{"date-parts":[[2010,10,11]],"date-time":"2010-10-11T12:02:33Z","timestamp":1286798553000},"page":"9065-9083","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Data Compression Algorithm for Wireless Sensor Networks Based on an Optimal Order Estimation Model and Distributed Coding"],"prefix":"10.3390","volume":"10","author":[{"given":"Peng","family":"Jiang","sequence":"first","affiliation":[{"name":"Institute of Information and Control, School of Automation, Hangzhou Dianzi University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Qiang","family":"Li","sequence":"additional","affiliation":[{"name":"Institute of Information and Control, School of Automation, Hangzhou Dianzi University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2010,10,11]]},"reference":[{"key":"ref_1","unstructured":"Deligiannakis, A, Kotidis, Y, Vassalos, V, Stoumpos, V, and Delis, A (April, January 30). Another Outlier Bites the Dust: Computing Meaningful Aggregates in Sensor Networks. Washington, DC, USA."},{"key":"ref_2","unstructured":"Chedy, R, and Marc, P (2008, January 2\u20135). Mining Multidimensional Sequential Patterns over Data Streams. Turin, Italy."},{"key":"ref_3","unstructured":"Sundeep, P, Bhaskar, K, and Ramesh, G (, January August). The Impact of Spatial Correlation on Routing with Compression in Wireless Sensor Networks. New York, NY, USA. article no. 24."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Jia, LJ, Noubir, G, Rajaraman, R, and Ravi, S (2006, January 18\u201320). GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks. San Francisco, CA, USA.","DOI":"10.1007\/11776178_18"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1360\/jos180669","article-title":"A wavelet data compression algorithm using ring topology for wireless sensor networks","volume":"18","author":"Zhou","year":"2007","journal-title":"J. Softw"},{"key":"ref_6","unstructured":"Song, L, Kalogeraki, V, Gunopulos, D, and Lonardi, S (2006, January 11\u201315). Online Information Compression in Sensor Networks. Istanbul, Turkey."},{"key":"ref_7","first-page":"387","article-title":"A distributed and adaptive signal processing approach to exploiting correlation in sensor networks, Ad hoc Networks","volume":"2","author":"Jim","year":"2004","journal-title":"J. Elsevier"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","article-title":"Noiseless encoding of correlated information sources","volume":"IT-19","author":"Slepian","year":"1973","journal-title":"IEEE Trans. Inform Theory"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"3867","DOI":"10.1109\/TIM.2009.2021206","article-title":"The Quality of lagged products and autoregressive Yule\u2014Walker models as autocorrelation estimates","volume":"58","author":"Broersen","year":"2009","journal-title":"IEEE Trans. Instrum. Meas"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/TIM.2009.2022451","article-title":"The removal of spurious spectral peaks from autoregressive models for irregularly sampled data","volume":"59","author":"Broersen","year":"2010","journal-title":"IEEE Trans. Instrum. Meas"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wang, A, and Chandraksan, A (2002). Energy-efficient dsps for wireless sensor networks. IEEE Signal Process Mag, 68\u201378.","DOI":"10.1109\/MSP.2002.1012351"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/10\/10\/9065\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:03:32Z","timestamp":1760220212000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/10\/10\/9065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,11]]},"references-count":11,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2010,10]]}},"alternative-id":["s101009065"],"URL":"https:\/\/doi.org\/10.3390\/s101009065","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2010,10,11]]}}}