Cooperative localization using gradient search in mobile networks

被引:0
作者
机构
[1] Key Lab. on Complex Systems Optimization and Controlling of Hunan High Education Institutions, College of Information and Communication Engineering, Hunan Institute of Science and Technology, Yueyang
[2] Embedded Systems and Networking Laboratory, Hunan University
[3] Institute of Physics and Information Science, Hunan Normal University
[4] College of Information Engineering, Xiangtan University, Xiangtan
来源
Peng, X. (peng-xin@foxmail.com) | 1600年 / Science Press卷 / 37期
关键词
Compressive sensing; Cooperative localization; Gradient search; Internet of Things; Location based services; Mobile networks;
D O I
10.3724/SP.J.1016.2014.00480
中图分类号
学科分类号
摘要
Consider that the impact of mobility on real-time performance of node localization, a novel localization algorithm based on gradient search is advanced. The algorithm considers the mobile localization problem from a temporal standpoint. In each time period, the algorithm computes distance among nodes from one-hop distance by compressive sensing, and derives distance boundary condition for network distance matrix based on the prediction of movement. And then the gradient search method is employed to derive the optimal estimated position of nodes so as to calculate the relative coordinates of nodes. Finally, in condition that there are three or more anchor nodes, the global absolute coordinates is created by using the global relative coordinates. Simulation results show that compared with previous literatures, the new algorithm can achieve preferable estimation accuracy and perform well on range error.
引用
收藏
页码:480 / 488
页数:8
相关论文
共 20 条
[1]  
Luo J.-Z., Wu W.-J., Yang M., Mobile internet: Terminal devices, networks and services, Chinese Journal of Computers, 34, 11, pp. 2029-2051, (2011)
[2]  
Zhou A.-Y., Yang B., Jin C.-Q., Ma Q., Location-based services: Architecture and progress, Chinese Journal of Computers, 34, 7, pp. 1155-1171, (2011)
[3]  
Savvides A., Han C., Strivastava M.B., Dynamic fine-grained localization in ad-hoc networks of sensors, Proceedings of the 7th ACM Annual International Conference on Mobile Computing and Networking (MobiCom 2001), pp. 166-179, (2001)
[4]  
Savvides A., Park H., Srivastava M.B., The bits and flops of the n-hop multilateration primitive for node localization problems, Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA 2002), pp. 112-121, (2002)
[5]  
Niculescu D., Nath B., DV-based positioning in ad hoc networks, Journal of Telecommunication System, 22, 14, pp. 267-280, (2003)
[6]  
He T., Huang C., Blum B.M., Et al., Range-free localization schemes for large scale sensor networks, Proceedings of the Annual International Conference on Mobile Computing and Networking (MobiCom 2003), pp. 81-95, (2003)
[7]  
Shang Y., Ruml W., Zhang Y., Fromherz M., Localization from mere connectivity, Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), pp. 201-212, (2003)
[8]  
Moore D., Leonard J., Rus D., Teller S., Robust distributed network localization with noisy range measurements, Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems (SenSys 2004), pp. 50-61, (2004)
[9]  
Biswas P., Ye Y., Semidefinite programming for ad hoc wireless sensor network localization, Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN 2004), pp. 46-54, (2004)
[10]  
Biswas P., Liang T.C., Toh K.C., Et al., Semidefinite programming approaches for sensor network localization with noisy distance measurements, IEEE Transactions on Automation Science and Engineering, 25, 3, pp. 46-54, (2006)