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

Node optimization coverage method under link model in passive monitoring system of three-dimensional wireless sensor network

Author

Listed:
  • Zhanjun Hao
  • Nanjiang Qu
  • Xiaochao Dang
  • Jiaojiao Hou

Abstract

3D coverage is not only closer to the actual application environment, but also a research hotspot of sensor networks in recent years. For this reason, a node optimization coverage method under link model in passive monitoring system of three-dimensional wireless sensor network is proposed in this article. According to wireless link-aware area, the link coverage model in three-dimensional wireless sensor network is constructed, and the cube-based network coverage is used to represent the quality of service of the network. This model takes advantage of the principle that the presence of human beings can change the transmission channel of the link. On this basis, the intruder is detected by the data packets transmitted between the wireless links, and then the coverage area is monitored by monitoring the received signal strength of the wireless signal. Based on this new link awareness model, the problem of optimal coverage deployment of the receiving node is solved, that is, how to deploy the receiving node to achieve the optimal coverage of the monitoring area when the location of the sending node is given. In the process of optimal coverage, the traditional genetic algorithm and particle swarm optimization algorithm are introduced and improved. Based on the genetic algorithm, the particle swarm optimization algorithm which integrates the idea of simulated annealing is regarded as an important operator of the genetic algorithm, which can converge to the optimal solution quickly. The simulation results show that the proposed method can improve the network coverage, converge quickly, and reduce the network energy consumption. In addition, we set up a real experimental environment for coverage verification, and the experimental results verify the feasibility of the proposed method.

Suggested Citation

  • Zhanjun Hao & Nanjiang Qu & Xiaochao Dang & Jiaojiao Hou, 2019. "Node optimization coverage method under link model in passive monitoring system of three-dimensional wireless sensor network," International Journal of Distributed Sensor Networks, , vol. 15(8), pages 15501477198, August.
  • Handle: RePEc:sae:intdis:v:15:y:2019:i:8:p:1550147719869877
    DOI: 10.1177/1550147719869877
    as

    Download full text from publisher

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

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhanjun Hao & Jiaojiao Hou & Jianwu Dang & Xiaochao Dang & Nanjiang Qu, 2021. "Game algorithm based on link quality: Wireless sensor network routing game algorithm based on link quality," International Journal of Distributed Sensor Networks, , vol. 17(2), pages 15501477219, February.

    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:8:p:1550147719869877. 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.