A Novel Two-Class Localization Algorithm in Wireless Sensor Networks | Zendy

Linqing Gui | Zendy; Thierry Val | Zendy; Anne Wei | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Novel Two-Class Localization Algorithm in Wireless Sensor Networks

Author(s) -

Linqing Gui,

Thierry Val,

Anne Wei

Publication year - 2011

Publication title -

network protocols and algorithms

Language(s) - English

Resource type - Journals

ISSN - 1943-3581

DOI - 10.5296/npa.v3i3.863

Subject(s) - computer science , wireless sensor network , computation , algorithm , class (philosophy) , range (aeronautics) , centroid , computational complexity theory , wireless , wireless network , key distribution in wireless sensor networks , distributed computing , computer network , artificial intelligence , telecommunications , materials science , composite material

For most of the applications in wireless sensor networks, localization is fundamental and essential. The localization systems can be categorized into two types: range-based and rangefree. In this paper, we propose a new range-free localization algorithm. The basic principle of this algorithm is to define two classes of nodes according to the number of anchors in the neighborhood, and then to apply the proposed localization methods to each class of nodes. The computation complexity of related algorithms has also been estimated and analyzed. The simulation results prove that our proposed two-class algorithm has acceptable complexity, and achieves better precision than the existing ones, such as Centroid, CPE and DV-hop.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research