A new range-free localization method using quadratic programming

  • Authors:
  • Jaehun Lee;Wooyong Chung;Euntai Kim

  • Affiliations:
  • School of Electrical and Electronic Engineering, Yonsei University, 134 Sinchon-dong, Seodaemun-gu, Seoul 120-749, Republic of Korea;School of Electrical and Electronic Engineering, Yonsei University, 134 Sinchon-dong, Seodaemun-gu, Seoul 120-749, Republic of Korea;School of Electrical and Electronic Engineering, Yonsei University, 134 Sinchon-dong, Seodaemun-gu, Seoul 120-749, Republic of Korea

  • Venue:
  • Computer Communications
  • Year:
  • 2011

Quantified Score

Hi-index 0.24

Visualization

Abstract

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.