A feasible direction algorithm for solving 3D sensor network localization

被引：0
|
作者：
Chang X.-K. [1 ]
Zhu W.-J. [1 ]
Li D.-K. [2 ]
机构：
[1] College of Science, Lanzhou University of Technology, Lanzhou
[2] Department of Mathematics of Dingxi Campus, Gansu University of Chinese Medicine, Dingxi, 743000, Gansu
来源：
| 2016年 / Beijing University of Posts and Telecommunications卷 / 39期
关键词：
Feasible direction algorithm; Low-rank factorization; Sensor network localization;
D O I：
10.13190/j.jbupt.2016.02.020
中图分类号：
学科分类号：
摘要：
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. © 2016, Editorial Department of Journal of Beijing University of Posts and Telecommunications. All right reserved.
引用
收藏
页码：98 / 102
页数：4
相关论文
共 10 条
  • [1] Shou X., Xu H., Design and implementation of RSSI localization algorithm in wireless sensor network, Engineering Journal of Wuhan University, 48, 2, pp. 284-288, (2015)
  • [2] Tan Z., Zhang H., A modified mobile location algorithm based on RSSI, Journal of Beijing University of Posts and Telecommunications, 36, 3, pp. 88-91, (2013)
  • [3] Biswas P., Liang T.C., Wang T.C., Et al., Semidefinite programming based algorithms for sensor network localization, ACM Transactions on Sensor Networks, 2, 2, pp. 188-220, (2006)
  • [4] Wang Z., Zheng S., Boyd S., Et al., Further relaxations of the SDP approach to sensor network localization, SIAM Journal on Optimization, 19, 2, pp. 655-673, (2008)
  • [5] Kim S., Kojima M., Waki H., Exploiting sparsity in SDP relaxation for sensor network localization, SIAM Journal on Optimization, 20, 1, pp. 192-215, (2009)
  • [6] Meng Y., Wen Y., Chen J., Et al., Range free localization algorithm based on proximity fro wireless sensor network, Acta Electronica Sinica, 42, 9, pp. 1712-1717, (2014)
  • [7] Jiang R., Yang Z., An improved centroid localization algorithm based on iterative computation for wireless sensor network, Acta Physica Sinica, 65, 3, pp. 1-8, (2016)
  • [8] Chang X., Augmented Lagrangian algorithm for solving quadratic semidefinite programming, Mathematica Numerica Sinica, 36, 2, pp. 133-142, (2014)
  • [9] Man-Cho S., Ye Y., The theory of semidefinite programming for sensor network localization, Mathematical Programming, 109, 2-3, pp. 367-384, (2007)
  • [10] Liu D.C., Nocedal J., On the limited memory BFGS method for large scale optimization, Mathematical Programming, 45, 1, pp. 503-528, (1989)
1