Deterministic linear-hexagonal path traversal scheme for localization in wireless sensor networks

Recent trends of using wireless sensor network in various applications have reduced the significance of human intervention greatly. Due to the cost efficiency and energy constraint nature of wireless sensor network, mobile anchor nodes are preferred over the static ones for localization and thus reducing the amount of GPS modules required to be associated within sensor region. Use of mobile anchor node requires traversal path optimization so that average localization error as well the traversed path length is reduced. Specific localization algorithm is used in literature to measure average localization error, which results in different preference of traversal scheme. In order to encounter the problem and to make comparison among the traversal schemes more generalized, a novel evaluation metric namely Inverted Coverability, a variation of ANOVA, is proposed. Besides this, a novel traversing path scheme, Linear-Hexagonal (LH) traversal scheme is proposed. Mathematical analysis and the result shows better performance of the proposed scheme with respect to the total path traversed, number of beacon points, Inverted Coverability and average localization error over other geometric based deterministic path planning schemes like DOUBLE SCAN, CIRCLES, Z-curve, and Polygon approach.