Abstract:
Some monitoring applications in wireless sensor networks (WSNs) may require that the target is tracked by at least k directional nodes in m-connected WSNs, where k ≥ 1 an...Show MoreMetadata
Abstract:
Some monitoring applications in wireless sensor networks (WSNs) may require that the target is tracked by at least k directional nodes in m-connected WSNs, where k ≥ 1 and m ≥ 1. In this paper, we address the target tracking problem in term of the number and orientation of tracking region of directional nodes required to achieve k-target tracking in m-connected WSNs. We consider the different values of k, m, target range, tracking angle, communication range of nodes, and shape of the field of interest (FoI) for solving the problem. The FoI is divided into an equilateral triangle, square, and hexagon patterns to estimate the optimal side length of a polygon and tracking direction of the nodes for k-target tracking and m-connectivity of the network. Next, the optimal side length in a polygon is used to estimate the node locations required for the desired level of target tracking and connectivity. Finally, we select a regular deployment pattern, which requires the least number of nodes for the designed level of tracking and connectivity. We also propose a target tracking system using the proposed analysis for tracking the moving targets in the FoI.
Published in: IEEE Systems Journal ( Volume: 13, Issue: 2, June 2019)