Robust Source Positioning Method With Accurate and Simplified Worst-Case Approximation

被引:11
|
作者
Qin, Shuang [1 ]
Guo, Xiansheng [2 ,3 ]
机构
[1] Sichuan Normal Univ, Coll Phys & Elect Engn, Key Lab Wireless Sensor Network Univ Sichuan Prov, Chengdu 610101, Peoples R China
[2] Univ Elect Sci & Technol China UESTC, Dept Elect Engn, Chengdu 611731, Peoples R China
[3] Univ Elect Sci & Technol China, Yangtze Delta Reg Inst Quzhou, Quzhou 324000, Peoples R China
基金
中国国家自然科学基金;
关键词
Location awareness; Wireless sensor networks; Approximation algorithms; Gaussian noise; Noise measurement; Linear programming; Synchronization; Global optimization; non-line-of-sight (NLOS); time-difference-of-arrival (TDOA); wireless sensor networks (WSNs) localizaiton; worst-case robust approximation; WIRELESS GEOLOCATION; INDOOR LOCALIZATION; VEHICLE;
D O I
10.1109/TVT.2021.3131909
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Worst-case robust approximation was proven to be efficient in alleviating the non-line-of-sight (NLOS) influence for source positioning. However, the existing time-difference-of-arrival (TDOA)-based worst-case solutions still have two issues: 1) Inaccurate objective transformations are introduced in some algorithms, which reduce the accuracy; 2) A method with higher accuracy is computationally intensive. This study proposes an accurate and simplified worst-case approximation method to tackle the troubles. Precisely, we first prove that the nonconvex worst-case objective is piecewise monotone to the NLOS bias. We further use monotonicity to derive an accurate and convex expression of the worst-case objective. Then, we propose simplified transformations to redefine the worst-case approximation problem with fewer constraints. Besides, we prove the effectiveness of the simplified transformations. Simulations and experiments demonstrate that the proposed method with moderate computation exhibits better performance than the state-of-the-art worst-case approximation algorithms.
引用
收藏
页码:1891 / 1900
页数:10
相关论文
共 50 条
  • [1] Robust Elliptic Localization Using Worst-Case Formulation and Convex Approximation
    Xiong, Wenxin
    So, Hing Cheung
    Schindelhauer, Christian
    Wendeberg, Johannes
    2019 16TH WORKSHOP ON POSITIONING, NAVIGATION AND COMMUNICATIONS (WPNC 2019), 2019,
  • [2] Robust worst-case optimal investment
    Sascha Desmettre
    Ralf Korn
    Peter Ruckdeschel
    Frank Thomas Seifried
    OR Spectrum, 2015, 37 : 677 - 701
  • [3] Worst-case robust Omega ratio
    Kapsos, Michalis
    Christofides, Nicos
    Rustem, Berc
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 234 (02) : 499 - 507
  • [4] Robust worst-case optimal investment
    Desmettre, Sascha
    Korn, Ralf
    Ruckdeschel, Peter
    Seifried, Frank Thomas
    OR SPECTRUM, 2015, 37 (03) : 677 - 701
  • [5] Worst-Case Asymmetric Distributed Source Coding
    Agnihotri, Samar
    Jamadagni, H. S.
    2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, : 653 - 660
  • [6] AN ACCURATE WORST-CASE TIMING ANALYSIS FOR RISC PROCESSORS
    LIM, SS
    BAE, YH
    JANG, GT
    RHEE, BD
    MIN, SL
    PARK, CY
    SHIN, H
    PARK, K
    MOON, SM
    KIM, CS
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1995, 21 (07) : 593 - 604
  • [7] WORST-CASE ANALYSIS OF AN APPROXIMATION ALGORITHM FOR FLOWSHOP SCHEDULING
    NOWICKI, E
    SMUTNICKI, C
    OPERATIONS RESEARCH LETTERS, 1989, 8 (03) : 171 - 177
  • [8] ROBUST OPTIMAL-DESIGN FOR WORST-CASE TOLERANCES
    EMCH, G
    PARKINSON, A
    JOURNAL OF MECHANICAL DESIGN, 1994, 116 (04) : 1019 - 1025
  • [9] Robust beamforming via worst-case SINR maximization
    Kim, Seung-Jean
    Magnani, Alessandro
    Mutapcic, Almir
    Boyd, Stephen P.
    Luo, Zhi-Quan
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (04) : 1539 - 1547
  • [10] Recent Developments in Robust Portfolios with a Worst-Case Approach
    Jang Ho Kim
    Woo Chang Kim
    Frank J. Fabozzi
    Journal of Optimization Theory and Applications, 2014, 161 : 103 - 121