{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:54:24Z","timestamp":1762505664465,"version":"build-2065373602"},"reference-count":12,"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>A kind of data compression algorithm for sensor networks based on suboptimal clustering and virtual landmark routing within clusters is proposed in this paper. Firstly, temporal redundancy existing in data obtained by the same node in sequential instants can be eliminated. Then sensor networks nodes will be clustered. Virtual node landmarks in clusters can be established based on cluster heads. Routing in clusters can be realized by combining a greedy algorithm and a flooding algorithm. Thirdly, a global structure tree based on cluster heads will be established. During the course of data transmissions from nodes to cluster heads and from cluster heads to sink, the spatial redundancy existing in the data will be eliminated. Only part of the raw data needs to be transmitted from nodes to sink, and all raw data can be recovered in the sink based on a compression code and part of the raw data. Consequently, node energy can be saved, largely because transmission of redundant data can be avoided. As a result the overall performance of the sensor network can obviously be improved.<\/jats:p>","DOI":"10.3390\/s101009084","type":"journal-article","created":{"date-parts":[[2010,10,11]],"date-time":"2010-10-11T12:02:33Z","timestamp":1286798553000},"page":"9084-9101","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Sensor Network Data Compression Algorithm Based on Suboptimal Clustering and Virtual Landmark Routing Within Clusters"],"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":"Shengqiang","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":[{"doi-asserted-by":"crossref","unstructured":"Potdar, V, Sharif, A, and Chang, E (2009, January 26\u201329). Wireless sensor networks: A Survey. Bradford, UK.","key":"ref_1","DOI":"10.1109\/WAINA.2009.192"},{"doi-asserted-by":"crossref","unstructured":"Jia, L, 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.","key":"ref_2","DOI":"10.1007\/11776178_18"},{"unstructured":"Deligiannakis, A, Kotidis, Y, Vassalos, V, Stoumpos, V, and Delis, A (April, January 29). Another outlier bites the dust: Computing meaningful aggregates in sensor networks. Washington, DC, USA.","key":"ref_3"},{"doi-asserted-by":"crossref","unstructured":"Lin, S, Kalogeraki, V, Gunopulos, D, and Lonardi, S (2006, January 11\u201315). Online information compression in sensor networks. Istanbul, Turkey.","key":"ref_4","DOI":"10.1109\/ICC.2006.255237"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.adhoc.2003.09.001","article-title":"A distributed and adaptive signal processing approach to exploiting correlation in sensor networks","volume":"2","author":"Chou","year":"2004","journal-title":"Ad. Hoc. Netw"},{"unstructured":"Chedy, R, and Marc, P (2008, January 2\u20135). Mining multidimensional sequential patterns over data streams. Turin, Italy.","key":"ref_6"},{"key":"ref_7","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. Software"},{"key":"ref_8","first-page":"28","article-title":"The impact of spatial correlation on routing with compression in wireless sensor networks","volume":"4","author":"Sundeep","year":"2008","journal-title":"ACM Trans. Sens. Netw"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1109\/TC.2009.20","article-title":"Multiresolution spatial and temporal coding in a wireless sensor network for long-term monitoring applications","volume":"6","author":"Wang","year":"2009","journal-title":"IEEE Trans. Comput"},{"doi-asserted-by":"crossref","unstructured":"Pattem, S, Krishnamachari, B, and Govindan, R (2004, January 26\u201327). The impact of spatial correlation on routing with compression in wireless sensor networks. Berkeley, CA, USA.","key":"ref_10","DOI":"10.1145\/984622.984627"},{"unstructured":"Fang, Q, Gao, J, Guibas, LJ, de Silva, V, and Zhang, L (, January March). GLIDER: Gradient landmark-based distributed routing for sensor networks. Miami, FL, USA.","key":"ref_11"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/MSP.2002.1012351","article-title":"Energy-efficient dsps for wireless sensor networks","volume":"7","author":"Wang","year":"2002","journal-title":"IEEE Sig. Process. Mag"}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/10\/10\/9084\/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\/9084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,11]]},"references-count":12,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2010,10]]}},"alternative-id":["s101009084"],"URL":"https:\/\/doi.org\/10.3390\/s101009084","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2010,10,11]]}}}