A novel ℓ 1-regularized LS formulation for target localization and malicious anchor identification

Wenshu Zhang, Huilin Xu, Liuqing Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


Secure target localization in the presence of malicious anchors is a critical issue in wireless sensor networks (WSNs), where compromised anchors attempt to mislead the target to a false position by broadcasting incorrect self location information. In this paper, we explicitly incorporate anchors' misplacements into the distance measurement model and explore the pairwise sparse nature of the misplacements. We formulate the secure target localization problem as an ℓ 1-regularized least squares (LS) problem, whose objective is to simultaneously locate the target as well as identify the compromised anchors. We establish the sparsity threshold which defines the upper bound for the number of identifiable malicious anchors, and propose a simple projected gradient search algorithm to solve this novel ℓ 1- regularized LS problem in WSNs. Simulation results and possible future extensions are also provided.

Original languageEnglish (US)
Title of host publication2010 Military Communications Conference, MILCOM 2010
Number of pages6
StatePublished - 2011
Externally publishedYes
Event2011 IEEE Military Communications Conference, MILCOM 2011 - Baltimore, MD, United States
Duration: Nov 7 2011Nov 10 2011

Publication series

NameProceedings - IEEE Military Communications Conference MILCOM


Conference2011 IEEE Military Communications Conference, MILCOM 2011
CountryUnited States
CityBaltimore, MD

Fingerprint Dive into the research topics of 'A novel ℓ <sub>1</sub>-regularized LS formulation for target localization and malicious anchor identification'. Together they form a unique fingerprint.

Cite this