Earticle

초록

영어

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 ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605