2021-09-17T16:06:16Zhttps://kitami-it.repo.nii.ac.jp/oaioai:kitami-it.repo.nii.ac.jp:000085512021-09-07T05:06:19Z1A Low Computational Complexity SML Estimation Algorithm of DOA for Wireless Sensor NetworksGong, FamingChen, HaihuaLi, ShibaoLiu, JianhangGu, ZhaozhiSuzuki, MasakiyoCopyright © 2015 Faming Gong et al.We address the problem of DOA estimation in positioning of nodes in wireless sensor networks. The Stochastic Maximum Likelihood (SML) algorithm is adopted in this paper. The SML algorithm is well-known for its high resolution of DOA estimation. However, its computational complexity is very high because multidimensional nonlinear optimization problem is usually involved. To reduce the computational complexity of SML estimation, we do the following work. (1) We point out the problems of conventional SML criterion and explain why and how these problems happen. (2) A local AM search method is proposed which could be used to find the local solution near/around the initial value. (3) We propose an algorithm which uses the local AM search method together with the estimation of DML or MUSIC as initial value to find the solution of SML. Simulation results are shown to demonstrate the effectiveness and efficiency of the proposed algorithms. In particular, the algorithm which uses the local AM method and estimation of MUSIC as initial value has much higher resolution and comparable computational complexity to MUSIC.SAGE Publications2015engjournal articlehttps://kitami-it.repo.nii.ac.jp/records/8551https://doi.org/10.1155/2015/3520121550-1329International Journal of Distributed Sensor Networks2015111https://kitami-it.repo.nii.ac.jp/record/8551/files/352012.pdfapplication/pdf1.8 MB2017-12-14