IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i10p352012.html
   My bibliography  Save this article

A Low Computational Complexity SML Estimation Algorithm of DOA for Wireless Sensor Networks

Author

Listed:
  • Faming Gong
  • Haihua Chen
  • Shibao Li
  • Jianhang Liu
  • Zhaozhi Gu
  • Masakiyo Suzuki

Abstract

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.

Suggested Citation

  • Faming Gong & Haihua Chen & Shibao Li & Jianhang Liu & Zhaozhi Gu & Masakiyo Suzuki, 2015. "A Low Computational Complexity SML Estimation Algorithm of DOA for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(10), pages 352012-3520, October.
    • Handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:352012
    DOI: 10.1155/2015/352012
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/352012
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/352012?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:10:p:352012. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.