TY - JOUR
T1 - HiRLoc
T2 - High-resolution robust localization for wireless sensor networks
AU - Lazos, Loukas
AU - Poovendran, Radha
N1 - Funding Information:
Manuscript received October 17, 2004; revised August 15, 2005. This work was supported in part by the Office of Naval Research (ONR) YIP under Award N00014-04-1-0479, and in part by ARO PECASE under Grant W911NF-05-1-0491.
PY - 2006/2
Y1 - 2006/2
N2 - In this paper, we address the problem of robustly estimating the position of randomly deployed nodes of a wireless sensor network (WSN), in the presence of security threats. We propose a range-independent localization algorithm called high-resolution range-independent localization (HiRLoc), that allows sensors to passively determine their location with high resolution, without increasing the number of reference points, or the complexity of the hardware of each reference point. In HiRLoc, sensors determine their location based on the intersection of the areas covered by the beacons transmitted by multiple reference points. By combining the communication range constraints imposed by the physical medium with computationally efficient cryptographic primitives that secure the beacon transmissions, we show that HiRLoc is robust against known attacks on WSN, such as the wormhole attack, the Sybil attack, and compromise of network entities. Finally, our performance evaluation shows that HiRLoc leads to a significant improvement in localization accuracy compared with state-of-the-art range-independent localization schemes, while requiring fewer reference points.
AB - In this paper, we address the problem of robustly estimating the position of randomly deployed nodes of a wireless sensor network (WSN), in the presence of security threats. We propose a range-independent localization algorithm called high-resolution range-independent localization (HiRLoc), that allows sensors to passively determine their location with high resolution, without increasing the number of reference points, or the complexity of the hardware of each reference point. In HiRLoc, sensors determine their location based on the intersection of the areas covered by the beacons transmitted by multiple reference points. By combining the communication range constraints imposed by the physical medium with computationally efficient cryptographic primitives that secure the beacon transmissions, we show that HiRLoc is robust against known attacks on WSN, such as the wormhole attack, the Sybil attack, and compromise of network entities. Finally, our performance evaluation shows that HiRLoc leads to a significant improvement in localization accuracy compared with state-of-the-art range-independent localization schemes, while requiring fewer reference points.
KW - Algorithm
KW - Design
KW - Performance
KW - Security
UR - http://www.scopus.com/inward/record.url?scp=33144475948&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33144475948&partnerID=8YFLogxK
U2 - 10.1109/JSAC.2005.861381
DO - 10.1109/JSAC.2005.861381
M3 - Article
AN - SCOPUS:33144475948
SN - 0733-8716
VL - 24
SP - 233
EP - 246
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 2
ER -