Comparison of Path Planning Algorithm for WSN LMCS, Robust Interval-Based Localization Algorithms, Localization Based On Genetic Algorithm

Abstract: Node localization technology is especially important to most applications of wireless sensor network. There are different path planning algorithms for wireless sensor network. However, each mobile beacon needs to broadcast its current position many times, and locating all the nodes must take a long time in most of the localization algorithms. In order to solve these problems, we propose a novel range-free localization algorithm—localization with a mobile beacon based on compressive sensing (LMCS). Robust interval based localization algorithm, this algorithm perform set-membership estimation, where only the maximal number of outliers is required to be known. Using these algorithms, estimates consist of sets of boxes whose union surely contains the correct location of the sensor, provided that the considered hypotheses are satisfied. This technique evaluates the number of outliers to be robust. Localization in wireless sensor network based on genetic algorithm, approximate the distance between anchor node and unknown node which is out of the anchor node’s communication radius.

Keywords: Wireless Sensor Networks(WSNs), Genetic Algorithm(GA), Localization, Mobile Beacon, path planning Algorithm