Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2016, Vol. 39 ›› Issue (2): 98-102.doi: 10.13190/j.jbupt.2016.02.020

• Reports • Previous Articles     Next Articles

A Feasible Direction Algorithm for Solving 3D Sensor Network Localization

CHANG Xiao-kai1, ZHU Wan-jie1, LI De-kui2   

  1. 1. College of Science, Lanzhou University of Technology, Lanzhou 730050, China;
    2. Department of Mathematics of Dingxi Campus, Gansu University of Chinese Medicine, Gansu Dingxi 743000, China
  • Received:2015-05-29 Online:2016-04-28 Published:2016-04-28

Abstract:

By using the change of variables, the semidefinite programming (SDP) problem for solving the senor network localization (SNL) in 3D was reformulated to be a nonlinear programming (NLP) problems. Feasible direction algorithm was proposed to solve the problem. The number of columns of the variables in the NLP is chosen to be equal 3, so as to avoid the higher dimensional solutions. Computational efficiency is improved by exploiting the sparsity of graph, in which the degree of each sensor node are restricted to a small positive integer. Experiments show that the proposed is efficient and robust, and the speed is faster than the existing interior-point algorithms for the SDP.

Key words: sensor network localization, low-rank factorization, feasible direction algorithm

CLC Number: