A new range-free localization method using quadratic programming

Jaehun Lee, Wooyong Chung, Euntai Kim

Research output: Contribution to journalArticle

28 Citations (Scopus)

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.

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

Fingerprint

Quadratic programming
Topology
Proximity sensors
Sensor nodes
Wireless sensor networks

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Lee, Jaehun ; Chung, Wooyong ; Kim, Euntai. / A new range-free localization method using quadratic programming. In: Computer Communications. 2011 ; Vol. 34, No. 8. pp. 998-1010.
@article{6d7a77e892c94d17a8f87e756ab6c9a4,
title = "A new range-free localization method using quadratic programming",
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.",
author = "Jaehun Lee and Wooyong Chung and Euntai Kim",
year = "2011",
month = "6",
day = "1",
doi = "10.1016/j.comcom.2010.10.013",
language = "English",
volume = "34",
pages = "998--1010",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "8",

}

A new range-free localization method using quadratic programming. / Lee, Jaehun; Chung, Wooyong; Kim, Euntai.

In: Computer Communications, Vol. 34, No. 8, 01.06.2011, p. 998-1010.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A new range-free localization method using quadratic programming

AU - Lee, Jaehun

AU - Chung, Wooyong

AU - Kim, Euntai

PY - 2011/6/1

Y1 - 2011/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79954420131&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79954420131&partnerID=8YFLogxK

U2 - 10.1016/j.comcom.2010.10.013

DO - 10.1016/j.comcom.2010.10.013

M3 - Article

VL - 34

SP - 998

EP - 1010

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 8

ER -