Towards a Theory of Robust Localization Against Malicious Beacon Nodes

—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundamental theoretical questions still remain unanswered: in the presence of malicious beacon nodes, what are the necessary and sufficient conditions to guarantee a bounded error during 2-dimensional location estimation? Under these necessary and sufficient conditions, what class of localization algorithms can provide that error bound? In this paper, we try to answer these questions. Specifically, we show that, when the number of malicious beacons is greater than or equal to some threshold, there is no localization algorithm that can have a bounded error. Furthermore, when the number of malicious beacons is below that threshold, we identify a class of localization algorithms that can ensure that the localization error is bounded. We also outline two algorithms in this class, one of which is guaranteed to finish i...

• Type: Conference
• Year: 2008
• Where: INFOCOM
• Authors: Sheng Zhong, Murtuza Jadliwala, Shambhu J. Upadhyaya, Chunming Qiao
• Keywords: Communications, INFOCOM 2008, Localization Algorithms, Malicious Beacon Nodes, Malicious Beacons