Abstract: The localization information is crucial for the
operation of WSN. There are principally two types of localization
algorithms. The Range-based localization algorithm has strict
requirements on hardware, thus is expensive to be implemented in
practice. The Range-free localization algorithm reduces the hardware
cost. However, it can only achieve high accuracy in ideal scenarios.
In this paper, we locate unknown nodes by incorporating the
advantages of these two types of methods. The proposed algorithm
makes the unknown nodes select the nearest anchor using the
Received Signal Strength Indicator (RSSI) and choose two other
anchors which are the most accurate to achieve the estimated
location. Our algorithm improves the localization accuracy compared
with previous algorithms, which has been demonstrated by the
simulating results.
Abstract: Information of nodes’ locations is an important
criterion for lots of applications in Wireless Sensor Networks. In the
hop-based range-free localization methods, anchors transmit the
localization messages counting a hop count value to the whole
network. Each node receives this message and calculates its own
distance with anchor in hops and then approximates its own position.
However the estimative distances can provoke large error, and affect
the localization precision. To solve the problem, this paper proposes
an algorithm, which makes the unknown nodes fix the nearest anchor
as a reference and select two other anchors which are the most
accurate to achieve the estimated location. Compared to the DV-Hop
algorithm, experiment results illustrate that proposed algorithm has
less average localization error and is more effective.