CGChao Guan
Chao Guan
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chao Guan has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Baofu Fang
School of Computer Science and Information Engineering, Hefei University of Technology, Hefei, China
1 shared publication - Qiubo Zhong
Ningbo University of Technology
1 shared publication - Weizhong Ding
School of Cyber Science and Engineering, Ningbo University of Technology, Ningbo 315211, China
1 shared publication - Yan Wang
Robotics Institute, Ningbo University of Technology, Ningbo 315048, China
1 shared publication
Latest Publications
- Open Access
Target Localization in Wireless Sensor Networks Based on Received Signal Strength and Convex Relaxation
A new positioning algorithm based on RSS measurement is proposed. The algorithm adopts maximum likelihood estimation and semi-definite programming. The received signal strength model is transformed to a non-convex estimator for the positioning of the target using the maximum likelihood estimation. The non-convex estimator is then transformed into a convex estimator by semi-definite programming, and the global minimum of the target location estimation is obtained. This algorithm aims at the known problem and then extends its application to the case of unknown. The simulations and experimental results show that the proposed algorithm has better accuracy than the existing positioning algorithms.Open AccessTarget Localization in Wireless Sensor Networks Based on Received Signal Strength and Convex Relaxation
A new positioning algorithm based on RSS measurement is proposed. The algorithm adopts maximum likelihood estimation and semi-definite programming. The received signal strength model is transformed to a non-convex estimator for the positioning of the target using the maximum likelihood estimation. The non-convex estimator is then transformed into a convex estimator by semi-definite programming, and the global minimum of the target location estimation is obtained. This algorithm aims at the known problem and then extends its application to the case of unknown. The simulations and experimental results show that the proposed algorithm has better accuracy than the existing positioning algorithms.