کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
449044 693626 2011 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A new range-free localization method using quadratic programming
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
A new range-free localization method using quadratic programming
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Communications - Volume 34, Issue 8, 1 June 2011, Pages 998–1010
نویسندگان
, , ,