Name
Abstract | ||
|---|---|---|
Sensor network localization (SNL) has been an important subject of research in recent years for a wide variety of applications. Among the solution methods proposed for SNL problems, semidefinite programming (SDP) approach is known for its effectiveness of obtaining solutions. In particular, the full SDP (FSDP) relaxation by Biswas and Ye was shown to be successful for solving small to medium-sized SNL problems. We present a sparse version of FSDP (SFSDP) for larger-sized problems by exploiting the sparsity of the problem. This method finds the same quality of solutions as the FSDP in a shorter amount of time. The performance of the SFSDP is measured with randomly generated test problems and compared with other methods. Numerical results suggest that exploiting the sparsity of the problem improve the efficiency of solving larger-sized problems. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/CACSD.2010.5612817 | CACSD |
Keywords | DocType | ISBN |
semidefinite programming relaxation,sensor network localization,wireless sensor networks,sensor placement,problem sparsity | Conference | 978-1-4244-5355-9 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Kim | 1 | 248 | 14.25 |
| Masakazu Kojima | 2 | 1603 | 222.51 |