Trajectory Approximation for Resource Constrained Mobile Sensor Networks

Ghulam Murtaza, S. Kanhere, A. Ignjatović, R. Jurdak, S. Jha
{"title":"Trajectory Approximation for Resource Constrained Mobile Sensor Networks","authors":"Ghulam Murtaza, S. Kanhere, A. Ignjatović, R. Jurdak, S. Jha","doi":"10.1109/DCOSS.2014.27","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":351707,"journal":{"name":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Distributed Computing in Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCOSS.2014.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

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.
资源受限移动传感器网络的轨迹逼近
低功耗紧凑型传感器节点越来越多地用于收集移动物体(如野生动物)的轨迹数据。这些数据的大小很容易超过这些节点上可用的数据存储。此外,通过无线信道传输如此广泛的数据可能会很困难。这些平台的内存和能量限制强调了轻量级在线轨迹压缩的必要性,尽管不会严重影响移动数据的准确性。在本文中,我们提出了一种新的基于多边形的在线逼近算法(PBA),该算法使用规则多边形作为最小的空间单元来逼近原始GPS样本,规则多边形的大小由允许的空间误差决定。PBA只存储第一个GPS样本作为参考。每个后续点都近似于包含该点的多边形的中心。此外,提出了一种编码方案,对每个多边形相对于前一个多边形在轨迹中的相对位置(距离和方向)进行编码。由此产生的轨迹是一系列位码,它们在参考点上具有对依赖关系。因此,通过解码从第一个参考点开始的代码链,可以很容易地重建原始轨迹的近似值。对单个GPS样本进行编码是一个O(1)的操作,总体复杂度为O (n)。此外,PBA在任何给定时间只需要在内存中存储两个原始GPS样本。PBA的低复杂度和小内存占用使其对低功耗传感器节点特别有吸引力。PBA是通过GPS追踪来评估的,GPS追踪可以捕捉到野外狐蝠的实际移动能力。我们的结果表明,与Douglas-Peucker线简化启发式方法相比,PBA可以节省多达9倍的内存。虽然我们在低功耗设备的背景下介绍了PBA,但它对其他具有gps功能的设备(如智能手机和汽车导航设备)同样有用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信