A Novel Virtual Anchor Node-based Localization Algorithm for Wireless Sensor Networks Pengxi Liu, Xinming Zhang, Shuang Tian, Zhiwei Zhao, Peng Sun Department of Computer Science and Technology University of Science and Technology of China International Conference on Networking 2007
33
Embed
A Novel Virtual Anchor Node- based Localization Algorithm for Wireless Sensor Networks Pengxi Liu, Xinming…
Introduction WSNs usually are arranged at special scout region, and sense special physics information in the region. Sensor nodes are often deployed by random bestrewing. The application of WSNs is often related to the positions of nodes. So the localization of sensor nodes has become a hot topic in WSNs.
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
A Novel Virtual Anchor Node-based Localization Algorithm for Wireless Sensor Networks
Pengxi Liu, Xinming Zhang, Shuang Tian, Zhiwei Zhao, Peng SunDepartment of Computer Science and TechnologyUniversity of Science and Technology of China
International Conference on Networking 2007
Outline Introduction Error analysis of typical localization
Introduction WSNs usually are arranged at special scout region, and sense special physics information in the region.
Sensor nodes are often deployed by random bestrewing. The application of WSNs is often related to the positions of nodes. So the localization of sensor nodes has become a hot topic in WSNs.
Introduction Most of the existent researches suppose
The network includes a small number of anchor nodes. The existence of various errors
The location precision will be restricted Some nodes even cannot be located.
The improvement of localization precision with lower cost less energy consumption less hardware support
Introduction The new algorithm finds out virtual anchors
to provide highly precise positions for unknowns nodes to assist in locating the rest unknowns along with primary real anchors.
Error analysis of typical localization algorithms The authors choose two concrete algorithms to
carry out error analysis. Euclidean
Range-Based
DV-hop Range-Free
Error analysis of typical localization algorithms - Euclidean
Each sensor has ability to measure their relative distance.
A
B
C
L1
D
α β
L3
L2
Error analysis of typical localization algorithms - Euclidean
The draw back of Euclidean The ranging error is the main flaw of Range-based algorithm. This error can be accumulated hop by hop.
Error analysis of typical localization algorithms – DV-hop
DV-hop Use the corrected factor ci to fixed the hop distance.
A
B
C
X
cA
Error analysis of typical localization algorithms – DV-hop
The draw back of DV-hop In practical application, the communication range of each node is not a standard circle ideally.
Error analysis of typical localization algorithms – DV-hop
A BC
n-hop n-hop
n*r n*r/2
The corrected factor is (3n*r/2*2n)=3r/4
Distance AC is n* 3r/4 =3n*r/4
The error is n*r-(3n*r/4)=n*r/4
This error can be accumulated hop by hop.
Virtual anchor node-based localization algorithm There can be only a few anchor nodes deployed in the network due to high cost and energy issue Virtual anchor node-based localization algorithm
The Selection of Virtual Anchor Node The Upgrade of Virtual Anchor Node