2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN) (2015)
Dec. 16, 2015 to Dec. 18, 2015
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MSN.2015.10
Typically, anchor-free localization is considered as a nonlinear programming problem in the existing literatures. However, the nonlinear programming algorithms can only achieve constrained optimization and the localization accuracy of such algorithms depends on the precision of initial coordinators, which are the inputs of the algorithm and usually obtained based on GPS. Due to this defect, the algorithm is invalid in GPS-denied area, such as indoor area, dense urban area and forest. In our research, we combined nonlinear programming algorithm with penalty function to solve this problem. Our simulation results show that the localization accuracy of proposed algorithm is not affected by the precision of the initial coordinators, even when the initial coordinators is set randomly. Performance comparisons are also presented to show the improvement of this algorithm.
Optimization, Distance measurement, Linear programming, Programming, Algorithm design and analysis, Global Positioning System, Search problems
R. Wang, J. He, L. Xu and Q. Wang, "Penalty Function Based Anchor-Free Positioning," 2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN), Shenzhen, China, 2015, pp. 270-277.