e-space
Manchester Metropolitan University's Research Repository

    Reinforcing Localization Credibility Through Convex Optimization

    Tomic, Slavisa ORCID logoORCID: https://orcid.org/0000-0001-5537-6716, Beko, Marko ORCID logoORCID: https://orcid.org/0000-0001-7315-8739, Tsado, Yakubu ORCID logoORCID: https://orcid.org/0000-0002-4442-2200, Adebisi, Bamidele ORCID logoORCID: https://orcid.org/0000-0001-9071-9120 and Oladipo, Abiola (2025) Reinforcing Localization Credibility Through Convex Optimization. IEEE Signal Processing Letters, 32. pp. 3445-3449. ISSN 1070-9908

    [img]
    Preview
    Published Version
    Available under License Creative Commons Attribution.

    Download (470kB) | Preview

    Abstract

    This work proposes a novel approach to reinforce localization security in wireless networks in the presence of malicious nodes that are able to manipulate (spoof) radio measurements. It substitutes the original measurement model by another one containing an auxiliary variance dilation parameter that disguises corrupted radio links into ones with large noise variances. This allows for relaxing the non-convex maximum likelihood estimator (MLE) into a semidefinite programming (SDP) problem by applying convex-concave programming (CCP) procedure. The proposed SDP solution simultaneously outputs target location and attacker detection estimates, eliminating the need for further application of sophisticated detectors. Numerical results corroborate excellent performance of the proposed method in terms of localization accuracy and show that its detection rates are highly competitive with the state of the art.

    Impact and Reach

    Statistics

    Activity Overview
    6 month trend
    11Downloads
    6 month trend
    16Hits

    Additional statistics for this dataset are available via IRStats2.

    Altmetric

    Repository staff only

    Edit record Edit record