TY - GEN
T1 - Anti-collusion position estimation in wireless sensor networks
AU - Kiyavash, Negar
AU - Koushanfar, Farinaz
PY - 2007
Y1 - 2007
N2 - Sensor networks are highly susceptible to errors and malicious attacks. A host of nefarious attacks are targeted at preventing nodes from discovering their correct positions. In this work, we present a novel framework for position estimation in presence of malicious attacks on distance measurements of sensor networks. Additionally, we propose a practical randomized algorithm in the framework, which efficiently detects and rejects the corrupted measurements. The algorithm searches for an agreeable solution starting from randomly sampled minimal subsets of data; it subsequently enhances its estimate by augmenting consistent data points to the best random sample. The performance of the proposed algorithm is evaluated and compared to state-of-the-art robust positioning algorithms, both for independent and colluding attackers. While our method performs the same or better compared with the other algorithms on independent attacks, it is significantly more robust against collusion attacks, in terms of both the position estimation error and attack diagnosis and isolation. Moreover, the algorithm has a shorter runtime due to its randomized nature.
AB - Sensor networks are highly susceptible to errors and malicious attacks. A host of nefarious attacks are targeted at preventing nodes from discovering their correct positions. In this work, we present a novel framework for position estimation in presence of malicious attacks on distance measurements of sensor networks. Additionally, we propose a practical randomized algorithm in the framework, which efficiently detects and rejects the corrupted measurements. The algorithm searches for an agreeable solution starting from randomly sampled minimal subsets of data; it subsequently enhances its estimate by augmenting consistent data points to the best random sample. The performance of the proposed algorithm is evaluated and compared to state-of-the-art robust positioning algorithms, both for independent and colluding attackers. While our method performs the same or better compared with the other algorithms on independent attacks, it is significantly more robust against collusion attacks, in terms of both the position estimation error and attack diagnosis and isolation. Moreover, the algorithm has a shorter runtime due to its randomized nature.
UR - http://www.scopus.com/inward/record.url?scp=50249153620&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50249153620&partnerID=8YFLogxK
U2 - 10.1109/MOBHOC.2007.4428647
DO - 10.1109/MOBHOC.2007.4428647
M3 - Conference contribution
AN - SCOPUS:50249153620
SN - 1424414555
SN - 9781424414550
T3 - 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS
BT - 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS
T2 - 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS
Y2 - 8 October 2007 through 11 October 2007
ER -