A DC programming approach for sensor network localization with uncertainties in anchor positions

Journal of Industrial and Management Optimization

Volumn 10, Issue 3, 2014, Pages 817-826

  Wu, Changzhi ^a   Li, Chaojie ^b   Long, Qiang ^b  

^a CURTIN UNIVERSITY   (Australia)

^b UNIVERSITY OF BALLARAT   (Australia)

Author keywords

DC programming; Semi definite programming; Sensor network localization

Indexed keywords

EID: 84890112965     PISSN: 15475816     EISSN: 1553166X     Source Type: Journal    
DOI: 10.3934/jimo.2014.10.817     Document Type: Article

References (20)

1. Q. J. Shi, C. He, H. Y. Chen and L. G. Jiang,. Distributed wireless sensor network localization via sequential greedy optimization algorithm, IEEE Trans. Signal Proc., 58 (2010), 3328-3340.
2. H. Cho and G. Hwang,. Optimal design and analysis of a two-hop relay network under Rayleigh fading for packet delay minimization, J. Ind. Manag. Optim., 7 (2011), 607-622.
3. S. Baek and B. D. Choi,. Performance analysis of power save mode in IEEE 802.11 infrastructure wireless local area network, J. Ind. Manag. Optim., 5 (2009), 481-492.
4. A. Jakoby, J. Boldberg and H. Messer,. Source localization in shallow water in the presence of sensor location uncertainty, IEEE J. Ocean. Eng., 25 (2000), 331-336.
5. K. W. K. Lui, W.-K. Ma, H. C. So and F. K. W. Chan,. Semi-definite programming algorithms for sensor network node localization with uncertainties in anchor positions and/or propagation speed, IEEE Trans. Signal Process., 57 (2009), 752-763.
6. P. Biswas, T. C. Liang, K. C. Toh, C. T. Wang and Y. Ye,. Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans. Auto. Sci. Eng., 3 (2006), 360-371.
7. Z. Wang, S. Zheng, Y. Ye and S. Boyd,. Further relaxations of the semidefinite programming approach to sensor network localization, SIAM J. Optim., 19 (2008), 655-673.
8. T. K. Pong and P. Tseng,. (Robust) Edge-based semidefinite programming relaxation of sensor network localization, Math. Program., 130 (2011), 321-358.
9. P. Tseng,. Second-order cone programming relaxation of sensor network localization, SIAM J. Optim., 18 (2007), 156-185.
10. S. Kim, M. Kojima and H. Waki,. Exploiting sparsity in SDP relaxation for sensor network localization. SIAM J. Optim., 20 (2009), 192-215.
11. P. Oguz-Ekim, J. Gomes, J. Xavier and P. Oliveira,. Robust localization of nodes and time-recursive tracking in sensor networks using noisy range measurements, IEEE Trans. Signal Process., 59 (2011), 3930-3942.
12. K. C. Ho, X. Lu and L. Kovavisaruch,. Source localization using TDOA and FDOA measurements in the presence of receiver location errors: Analysis and solution, IEEE Trans. Signal Process., 55 (2007), 684-696.
13. X. Xiao, J. Gu, L. Zhang and S. Zhang,. A sequential convex program method to DC program with joint chance constraints, J. Ind. Manag. Optim., 8 (2012), 733-747.
14. A. S. Ta, L. T. H. An, D. Khadraoui and P. D. Tao,. Solving Partitioning-Hub Location-Routing Problem using DCA. J. Ind. Manag. Optim., 8 (2012), 87-102.
15. T. Pham Dinh and H. A. Le Thi,. Convex analysis approach to d.c. programming: Theory, algorithms and applications, Acta Math. Vietnam., 22 (1997), 289-355.
16. H. A. Le Thi and T. Pham Dinh,. The DC (difference of convex functions) Programming and DCA revisited with DC models of real world nonconvex optimization problems, Annals of Operations Research, 133 (2005), 23-46.
17. G. Nalan, L. T. H. An and M. Moeini,. Robust investment strategies with discrete asset choice constraints using dc programming, Optim., 59 (2010), 45-62.
18. D. Y. Gao,. Sufficient conditions and perfect duality in nonconvex minimization with inequality constraints, J. Ind. Manag. Optim., 1 (2005), 53-63.
19. Z. B. Wang, S. C. Fang, D. Y. Gao and W. X. Xing,. Global extremal conditions for multi-integer quadratic programming, J. Ind. Manag. Optim., 4 (2008), 213-225.
20. J. More and Z. Wu,. Distance geometry optimization for protein structures, J. Glob. Optim., 15 (1999), 219-234.