An Obstacle-Tolerant Path Planning Algorithm for Mobile-Anchor-Node-Assisted Localization

Publisher： MDPI

E-ISSN： 1424-8220|18|3|889-889

ISSN： 1424-8220

Source： Sensors, Vol.18, Iss.3, 2018-03, pp. : 889-889

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

The location information obtained using a sensor is a critical requirement in wireless sensor networks. Numerous localization schemes have been proposed, among which mobile-anchor-node-assisted localization (MANAL) can reduce costs and overcome environmental constraints. A mobile anchor node (MAN) provides its own location information to assist the localization of sensor nodes. Numerous path planning schemes have been proposed for MANAL, but most scenarios assume the absence of obstacles in the environment. However, in a realistic environment, sensor nodes cannot be located because the obstacles block the path traversed by the MAN, thereby rendering the sensor incapable of receiving sufficient three location information from the MAN. This study proposes the obstacle-tolerant path planning (OTPP) approach to solve the sensor location problem owing to obstacle blockage. OTPP can approximate the optimum beacon point number and path planning, thereby ensuring that all the unknown nodes can receive the three location information from the MAN and reduce the number of MAN broadcast packet times. Experimental results demonstrate that OTPP performs better than Z-curves because it reduces the total number of beacon points utilized and is thus more suitable in an obstacle-present environment. Compared to the Z-curve, OTPP can reduce localization error and improve localization coverage.