earticle

논문검색

Convex Optimization Algorithms for Multiple Source Localization Based on Received Signal Strength Measurements

초록

영어

Decaying with the increasing of signal propagation distance, Received Signal Strength (RSS) is used in the wireless localization due to its low cost and easily implementation. When the transmit power is unavailable, two convex optimization algorithms including semi definite programming (SDP), second order cone and semi definite programming (SOC/SDP) are designed to estimate the source locations by relaxing the non-convex problem as convex optimization. The corresponding Cramér-Rao lower bound (CRLB) of the problem is derived. The simulations demonstrate that the SOC/SDP algorithm provides the similar accuracy performance compared with the SDP algorithm. However the computational complexity of SOC/SDP is lower than that of the SDP due to the less variables and equality constraints. When perfect knowledge of the path loss exponent is available, the simulations also show that the accuracy performance of the proposed convex optimization algorithms degrades as the path loss exponent increases.

목차

Abstract
 1. Introduction
 2. Localization Model
 3. Semidefinite Programming Algorithm
 4. CRLB Performance
 5. Evaluation
  5.1. Impact of the Shadow Fading
  5.2. CPU Runtime
  5.3. RMSE Performance of Different Source Node
  5.4. Path Loss Exponent
 6. Conclusion
 References

저자정보

  • Xiaodun Deng Modern Education Technology Center, Xi'an International University, Xi'an, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.