7 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
Parameter selection and performance comparison of particle swarm optimization in sensor networks localization
Localization is a key technology in wireless sensor networks. Faced with the challenges of the sensors\u27 memory, computational constraints, and limited energy, particle swarm optimization has been widely applied in the localization of wireless sensor networks, demonstrating better performance than other optimization methods. In particle swarm optimization-based localization algorithms, the variants and parameters should be chosen elaborately to achieve the best performance. However, there is a lack of guidance on how to choose these variants and parameters. Further, there is no comprehensive performance comparison among particle swarm optimization algorithms. The main contribution of this paper is three-fold. First, it surveys the popular particle swarm optimization variants and particle swarm optimization-based localization algorithms for wireless sensor networks. Secondly, it presents parameter selection of nine particle swarm optimization variants and six types of swarm topologies by extensive simulations. Thirdly, it comprehensively compares the performance of these algorithms. The results show that the particle swarm optimization with constriction coefficient using ring topology outperforms other variants and swarm topologies, and it performs better than the second-order cone programming algorithm