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

Multi-targets device-free localization based on sparse coding in smart city

Author

Listed:
  • Min Zhao
  • Danyang Qin
  • Ruolin Guo
  • Guangchao Xu

Abstract

With the continuous expansion of the market of device-free localization in smart cities, the requirements of device-free localization technology are becoming higher and higher. The large amount of high-dimensional data generated by the existing device-free localization technology will improve the positioning accuracy as well as increase the positioning time and complexity. The positions required from single target to multi-targets become a further increasing difficulty for device-free localization. In order to satisfy the practical localizing application in smart city, an efficient multi-target device-free localization method is proposed based on a sparse coding model. To accelerate the positioning as well as improve the localization accuracy, a sparse coding-based iterative shrinkage threshold algorithm (SC-IA) is proposed and a subspace sparse coding-based iterative shrinkage threshold algorithm (SSC-IA) is presented for different practical application requirements. Experiments with practical dataset are performed for single-target and multi-targets localization, respectively. Compared with three typical machine learning algorithms: deep learning based on auto encoder, K -nearest neighbor, and orthogonal matching pursuit, experimental results show that the proposed sparse coding-based iterative shrinkage threshold algorithm and subspace sparse coding-based iterative shrinkage threshold algorithm can achieve high localization accuracy and low time cost simultaneously, so as to be more practical and applicable for the development of smart city.

Suggested Citation

  • Min Zhao & Danyang Qin & Ruolin Guo & Guangchao Xu, 2019. "Multi-targets device-free localization based on sparse coding in smart city," International Journal of Distributed Sensor Networks, , vol. 15(6), pages 15501477198, June.
  • Handle: RePEc:sae:intdis:v:15:y:2019:i:6:p:1550147719858229
    DOI: 10.1177/1550147719858229
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147719858229
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147719858229?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
    ---><---

    References listed on IDEAS

    as
    1. Lingping Kong & Jeng-Shyang Pan & Václav Snášel & Pei-Wei Tsai & Tien-Wen Sung, 2018. "An energy-aware routing protocol for wireless sensor network based on genetic algorithm," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 67(3), pages 451-463, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Alma Rodríguez & Marco Pérez-Cisneros & Julio C. Rosas-Caro & Carolina Del-Valle-Soto & Jorge Gálvez & Erik Cuevas, 2021. "Robust Clustering Routing Method for Wireless Sensor Networks Considering the Locust Search Scheme," Energies, MDPI, vol. 14(11), pages 1-19, May.
    2. Chang Zhou & Zhenghong Gu & Yu Gao & Jin Wang, 2019. "An Improved Style Transfer Algorithm Using Feedforward Neural Network for Real-Time Image Conversion," Sustainability, MDPI, vol. 11(20), pages 1-15, October.
    3. Alma Rodríguez & Carolina Del-Valle-Soto & Ramiro Velázquez, 2020. "Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks Based on Yellow Saddle Goatfish Algorithm," Mathematics, MDPI, vol. 8(9), pages 1-17, September.
    4. S. Jeevanantham & B. Rebekka, 2022. "Energy-aware neuro-fuzzy routing model for WSN based-IoT," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 81(3), pages 441-459, November.

    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:15:y:2019:i:6:p:1550147719858229. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.