Trajectory Approximation for Resource Constrained Mobile Sensor Networks

Low-power compact sensor nodes are being increasingly used to collect trajectory data from moving objects such as wildlife. The size of this data can easily overwhelm the data storage available on these nodes. Moreover, the transmission of this extensive data over the wireless channel may prove to be difficult. The memory and energy constraints of these platforms underscores the need for lightweight online trajectory compression albeit without seriously affecting the accuracy of the mobility data. In this paper, we present a novel online Polygon Based Approximation (PBA) algorithm that uses regular polygons, the size of which is determined by the allowed spatial error, as the smallest spatial unit for approximating the raw GPS samples. PBA only stores the first GPS sample as a reference. Each subsequent point is approximated to the centre of the polygon containing the point. Furthermore, a coding scheme is proposed that encodes the relative position (distance and direction) of each polygon with respect to the preceding polygon in the trajectory. The resulting trajectory is thus a series of bit codes, that have pair-wise dependencies at the reference point. It is thus possible to easily reconstruct an approximation of the original trajectory by decoding the chain of codes starting with the first reference point. Encoding a single GPS sample is an O (1) operation, with an overall complexity of O (n). Moreover, PBA only requires the storage of two raw GPS samples in memory at any given time. The low complexity and small memory footprint of PBA make it particularly attractive for low-power sensor nodes. PBA is evaluated using GPS traces that capture the actual mobility of flying foxes in the wild. Our results demonstrate that PBA can achieve up to nine-fold memory savings as compared to Douglas-Peucker line simplification heuristic. While we present PBA in the context of low-power devices, it can be equally useful for other GPS-enabled devices such smartphones and car navigation units.

[1]  Leonidas J. Guibas,et al.  Pathlet learning for compressing and planning trajectories , 2013, SIGSPATIAL/GIS.

[2]  Arnold P. Boedihardjo,et al.  Model-driven matching and segmentation of trajectories , 2013, SIGSPATIAL/GIS.

[3]  Navinda Kottege,et al.  Camazotz: Multimodal activity-based GPS sampling , 2013, 2013 ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN).

[4]  Kai-Florian Richter,et al.  Semantic trajectory compression: Representing urban movement in a nutshell , 2012, J. Spatial Inf. Sci..

[5]  Dan Feldman,et al.  An effective coreset compression algorithm for large scale sensor networks , 2012, 2012 ACM/IEEE 11th International Conference on Information Processing in Sensor Networks (IPSN).

[6]  Matthew B. Dwyer,et al.  Sensing through the continent: Towards monitoring migratory birds using cellular sensor networks , 2012, 2012 ACM/IEEE 11th International Conference on Information Processing in Sensor Networks (IPSN).

[7]  S. S. Ravi,et al.  SQUISH: an online approach for GPS trajectory compression , 2011, COM.Geo.

[8]  Barbara A. Han,et al.  Animal Migration and Infectious Disease Risk , 2011, Science.

[9]  Cecilia Mascolo,et al.  Evolution and sustainability of a wildlife monitoring sensor network , 2010, SenSys '10.

[10]  Nikos Pelekis,et al.  Trajectory Compression under Network Constraints , 2009, SSTD.

[11]  Joachim Gudmundsson,et al.  Detecting Commuting Patterns by Clustering Subtrajectories , 2008, Int. J. Comput. Geom. Appl..

[12]  Margaret Martonosi,et al.  Data compression algorithms for energy-constrained devices in delay tolerant networks , 2006, SenSys '06.

[13]  Ouri Wolfson,et al.  On-line data reduction and the quality of history in moving objects databases , 2006, MobiDE '06.

[14]  Nirvana Meratnia,et al.  Spatiotemporal Compression Techniques for Moving Point Objects , 2004, EDBT.

[15]  Ouri Wolfson,et al.  Spatio-temporal data reduction with deterministic error bounds , 2003, DIALM-POMC '03.

[16]  Eamonn J. Keogh,et al.  An online algorithm for segmenting time series , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[17]  Calvin Rutstrum The Wilderness Route Finder: The Classic Guide to Finding Your Way in the Wild , 2000 .

[18]  R. Sinnott Virtues of the Haversine , 1984 .

[19]  John D. Hobby,et al.  Polygonal approximations that minimize the number of inflections , 1993, SODA '93.