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

A sensor node scheduling algorithm for heterogeneous wireless sensor networks

Author

Listed:
  • Zhangquan Wang
  • Yourong Chen
  • Banteng Liu
  • Haibo Yang
  • Ziyi Su
  • Yunkai Zhu

Abstract

To improve the regional coverage rate and network lifetime of heterogeneous wireless sensor networks, a sensor node scheduling algorithm for heterogeneous wireless sensor networks is proposed. In sensor node scheduling algorithm, heterogeneous perception radius of sensor node is considered. Incomplete coverage constraint and arc coverage interval are analyzed. Regional coverage increment optimization model, arc coverage increment optimization model, and residual energy optimization model are proposed. Multi-objective scheduling model is established using weight factors and integrated function. Furthermore, the heuristic method is proposed to solve the multi-objective optimization model, and scheduling scheme of heterogeneous sensor nodes is obtained. When the network is in operation for a period of time, some sensor nodes are invalid and relevant regions are uncovered. The repair method is proposed to wake up sleep sensor nodes and repair the coverage blind area. The simulation results show that if keeping the same regional coverage rate, sensor node scheduling algorithm improves network lifetime, increases number of living sensor nodes, and keeps average node energy consumption at a low level. Under certain conditions, sensor node scheduling algorithm outperforms DGREEDY, two-tiered scheduling, and minimum connected cover.

Suggested Citation

  • Zhangquan Wang & Yourong Chen & Banteng Liu & Haibo Yang & Ziyi Su & Yunkai Zhu, 2019. "A sensor node scheduling algorithm for heterogeneous wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 15(1), pages 15501477198, January.
    • Handle: RePEc:sae:intdis:v:15:y:2019:i:1:p:1550147719826311
    DOI: 10.1177/1550147719826311
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147719826311
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147719826311?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
    ---><---

    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:1:p:1550147719826311. 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.