Issue No. 01 - January (2011 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.30
Hsiao-Ping Tsai , National Taiwan University, Taipei
De-Nian Yang , National Taiwan University, Taipei
Ming-Syan Chen , National Taiwan University, Taipei
Natural phenomena show that many creatures form large social groups and move in regular patterns. However, previous works focus on finding the movement patterns of each single object or all objects. In this paper, we first propose an efficient distributed mining algorithm to jointly identify a group of moving objects and discover their movement patterns in wireless sensor networks. Afterward, we propose a compression algorithm, called 2P2D, which exploits the obtained group movement patterns to reduce the amount of delivered data. The compression algorithm includes a sequence merge and an entropy reduction phases. In the sequence merge phase, we propose a Merge algorithm to merge and compress the location data of a group of moving objects. In the entropy reduction phase, we formulate a Hit Item Replacement (HIR) problem and propose a Replace algorithm that obtains the optimal solution. Moreover, we devise three replacement rules and derive the maximum compression ratio. The experimental results show that the proposed compression algorithm leverages the group movement patterns to reduce the amount of delivered data effectively and efficiently.
Data compression, distributed clustering, object tracking.
M. Chen, D. Yang and H. Tsai, "Exploring Application-Level Semantics for Data Compression," in IEEE Transactions on Knowledge & Data Engineering, vol. 23, no. , pp. 95-109, 2010.