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

A node deployment algorithm for maximizing network lifetime in delay-constrained duty-cycled wireless sensor networks

Author

Listed:
  • Thi-Nga Dao
  • Seokhoon Yoon

Abstract

Although duty-cycling is a promising approach to reduce energy consumption in wireless sensor networks, sufficiently long network lifetime may not be achieved due to the hot spot problem. Moreover, a long duty cycle interval can lead to high end-to-end delay, which is not desired in delay-constrained applications. In order to address the hot spot problem and long end-to-end delay, this article proposes a novel energy-balanced node deployment algorithm for maximizing network lifetime in duty-cycled wireless sensor networks while taking into account a delay requirement. In addition, energy-balanced node deployment considers network connectivity and sensing coverage constraints, which are also important factors when wireless sensor networks are deployed. An optimization problem is first formulated where the objective function and constraints are estimated based on node distribution in the area and the network parameters. Then, a non-deterministic algorithm is proposed to derive the optimal number of nodes in each circular layer that meets given constraints and maximizes network lifetime. Numerical analysis and simulations have been conducted to validate the proposed algorithm. The results show that the proposed algorithm can achieve higher network lifetime than other schemes.

Suggested Citation

  • Thi-Nga Dao & Seokhoon Yoon, 2018. "A node deployment algorithm for maximizing network lifetime in delay-constrained duty-cycled wireless sensor networks," International Journal of Distributed Sensor Networks, , vol. 14(4), pages 15501477187, April.
  • Handle: RePEc:sae:intdis:v:14:y:2018:i:4:p:1550147718771296
    DOI: 10.1177/1550147718771296
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1177/1550147718771296?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:14:y:2018:i:4:p:1550147718771296. 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.