Algorithm 920: SFSDP: A sparse version of full semidefinite programming relaxation for sensor network localization problems

Sunyoung Kim, Masakazu Kojima, Hayato Waki, Makato Yamashita

    研究成果: ジャーナルへの寄稿記事

    12 引用 (Scopus)

    抜粋

    SFSDP is a Matlab package for solving sensor network localization (SNL) problems. These types of problems arise in monitoring and controlling applications using wireless sensor networks. SFSDP implements the semidefinite programming (SDP) relaxation proposed in Kim et al. [2009] for sensor network localization problems, as a sparse version of the full semidefinite programming relaxation (FSDP) by Biswas and Ye [2004]. To improve the efficiency of FSDP, SFSDP exploits the aggregated and correlative sparsity of a sensor network localization problem. As a result, SFSDP can handle much larger problems than other software as well as three-dimensional anchor-free problems. SFSDP analyzes the input data of a sensor network localization problem, solves the problem, and displays the computed locations of sensors. SFSDP also includes the features of generating test problems for numerical experiments.

    元の言語英語
    記事番号27
    ジャーナルACM Transactions on Mathematical Software
    38
    発行部数4
    DOI
    出版物ステータス出版済み - 8 1 2012

      フィンガープリント

    All Science Journal Classification (ASJC) codes

    • Software
    • Applied Mathematics

    これを引用