This paper proposes two improved DV-hop localization algorithms named
an Equal Sub-Area-Based DV-Hop (ESAB-DV-Hop) and Equal Sub-Area-Based
DV-Hop with RSSI (ESAB-DV-Hop with RSSI) which achieve less error than an
original algorithm. The two proposed algorithms are derived from the DV-hop method.
The 1st one depends on dividing the network area into sub-areas and setting the
nodes with unknown locations to calculate their positions from anchor nodes in the
same sub-area and the 2nd one depends on dividing the network area into sub-areas
and each node with unknown location calculates the distance between itself and other
nodes using hop count number if they are not neighbor anchor nodes and RSSI if they
are neighbor anchor nodes. Simulation results show that the localization accuracy of
the Equal Sub-Area-Based DV-Hop (ESAB-DV-Hop) method is better than the original
algorithm by 13.5% and by 12% compared to a recent algorithm that solves the
same problem when the total number of the nodes equals 100, the communication
range is 20 m and the anchors ratio is 10%. The Equal Sub-Area-Based DV-Hop with
RSSI (ESAB-DV-Hop with RSSI) method is better than the original algorithm by
17.5% and by 16% compared to a recent algorithm that solves the same problem
when the total number of the nodes equals 100, the communication range is 20 m and
the anchors ratio 10%. |
