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

Optimal Deployment and Scheduling with Directional Sensors for Energy-Efficient Barrier Coverage

Author

Listed:
  • Lu Zhao
  • Guangwei Bai
  • Yanhui Jiang
  • Hang Shen
  • Zhenmin Tang

Abstract

In recent years, barrier coverage problem in directional sensor networks has been an interesting research issue. Most of the existing solutions to this problem aim to find as many barrier sets as possible to enhance coverage for the target area, which did not consider the power conservation. In this paper, we address the efficient sensor deployment (ESD) problem and energy-efficient barrier coverage (EEBC) problem for directional sensor networks. First, we describe a deployment model for the distribution of sensor locations to analyze whether a target area can be barrier covered. By this model, we examine the relationship between the probability of barrier coverage and network deployment parameters. Moreover, we model the EEBC as an optimization problem. An efficient scheduling algorithm is proposed to prolong the network lifetime when the target area is barrier covered. Simulation results are presented to demonstrate the performance of this algorithm.

Suggested Citation

  • Lu Zhao & Guangwei Bai & Yanhui Jiang & Hang Shen & Zhenmin Tang, 2014. "Optimal Deployment and Scheduling with Directional Sensors for Energy-Efficient Barrier Coverage," International Journal of Distributed Sensor Networks, , vol. 10(1), pages 596983-5969, January.
    • Handle: RePEc:sae:intdis:v:10:y:2014:i:1:p:596983
    DOI: 10.1155/2014/596983
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/596983
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/596983?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:10:y:2014:i:1:p:596983. 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.