A new range-free localization method using quadratic programming

Jaehun Lee, Wooyong Chung, Euntai Kim

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)


In this paper, we propose a new range-free localization algorithm called optimal proximity distance map using quadratic programming (OPDMQP). First, the relationship between geographical distances and proximity among sensor nodes in the given wireless sensor network is mathematically built. Then, the characteristics of the given network is represented as a set of constraints on the given network topology and the localization problem is formulated into a quadratic programming problem. Finally, the proposed method is applied to two anisotropic networks the topologies of which are very similar to those of the real-world applications. Unlike the most of previous localization methods which work well in the isotropic networks but not in the anisotropic networks, it is shown that the proposed method exhibits excellent and robust performances not only in the isotropic networks but also in the anisotropic networks.

Original languageEnglish
Pages (from-to)998-1010
Number of pages13
JournalComputer Communications
Issue number8
Publication statusPublished - 2011 Jun 1

Bibliographical note

Funding Information:
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (No. 2010-0012631).

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications


Dive into the research topics of 'A new range-free localization method using quadratic programming'. Together they form a unique fingerprint.

Cite this