29,683 research outputs found
Multi-mode Tracking of a Group of Mobile Agents
We consider the problem of tracking a group of mobile nodes with limited
available computational and energy resources given noisy RSSI measurements and
position estimates from group members. The multilateration solutions are known
for energy efficiency. However, these solutions are not directly applicable to
dynamic grouping scenarios where neighbourhoods and resource availability may
frequently change. Existing algorithms such as cluster-based GPS duty-cycling,
individual-based tracking, and multilateration-based tracking can only
partially deal with the challenges of dynamic grouping scenarios. To cope with
these challenges in an effective manner, we propose a new group-based
multi-mode tracking algorithm. The proposed algorithm takes the topological
structure of the group as well as the availability of the resources into
consideration and decides the best solution at any particular time instance. We
consider a clustering approach where a cluster head coordinates the usage of
resources among the cluster members. We evaluate the energy-accuracy trade-off
of the proposed algorithm for various fixed sampling intervals. The evaluation
is based on the 2D position tracks of 40 nodes generated using Reynolds'
flocking model. For a given energy budget, the proposed algorithm reduces the
mean tracking error by up to in comparison to the existing
energy-efficient cooperative algorithms. Moreover, the proposed algorithm is as
accurate as the individual-based tracking while using almost half the energy.Comment: Accepted for publication in the 20th international symposium on
wireless personal multimedia communications (WPMC-2017
A Novel Framework for Online Amnesic Trajectory Compression in Resource-constrained Environments
State-of-the-art trajectory compression methods usually involve high
space-time complexity or yield unsatisfactory compression rates, leading to
rapid exhaustion of memory, computation, storage and energy resources. Their
ability is commonly limited when operating in a resource-constrained
environment especially when the data volume (even when compressed) far exceeds
the storage limit. Hence we propose a novel online framework for error-bounded
trajectory compression and ageing called the Amnesic Bounded Quadrant System
(ABQS), whose core is the Bounded Quadrant System (BQS) algorithm family that
includes a normal version (BQS), Fast version (FBQS), and a Progressive version
(PBQS). ABQS intelligently manages a given storage and compresses the
trajectories with different error tolerances subject to their ages. In the
experiments, we conduct comprehensive evaluations for the BQS algorithm family
and the ABQS framework. Using empirical GPS traces from flying foxes and cars,
and synthetic data from simulation, we demonstrate the effectiveness of the
standalone BQS algorithms in significantly reducing the time and space
complexity of trajectory compression, while greatly improving the compression
rates of the state-of-the-art algorithms (up to 45%). We also show that the
operational time of the target resource-constrained hardware platform can be
prolonged by up to 41%. We then verify that with ABQS, given data volumes that
are far greater than storage space, ABQS is able to achieve 15 to 400 times
smaller errors than the baselines. We also show that the algorithm is robust to
extreme trajectory shapes.Comment: arXiv admin note: substantial text overlap with arXiv:1412.032
- …