.png){kind=icon}
返回
A Concave-Convex Procedure for TDOA Based Positioning
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2013.020513.122732.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter investigates the time-difference-of-arrival based positioning problem in wireless sensor networks. We consider the least-mean absolute, i.e., the l(1) norm, minimization of the residual errors and formulate the positioning problem as a difference of convex functions (DC) programming. We then employ a concave-convex procedure to solve the corresponding DC programming. Simulation results illustrate the improved performance of the proposed approach compared to existing methods.
Keyword:
Wireless sensor network
time-difference-of-arrival
DC programming
concave-convex procedure
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
分享收藏
Characterization of the Periplasmic Heme-Binding Protein ShuT from the Heme Uptake System ofShigella dysenteriae.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏 没有更多内容
没有更多内容