IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v42y2021i1d10.1007_s10878-021-00745-x.html
   My bibliography  Save this article

Efficient algorithms for support path with time constraint

Author

Listed:
  • Lili Zhang

    (Soochow University)

  • Cheng-Kuan Lin

    (Fuzhou University)

  • Xiaoqiang Chen

    (Soochow University)

  • Jianxi Fan

    (Soochow University)

  • Yuan-Hsiang Teng

    (Providence University)

Abstract

Target traversing is an important research topic in wireless sensor networks, with most studies examining coverage issues of the target’s moving paths. The best coverage path is one that minimizes the target support to the sensors. Most existing algorithms either ensure that the target remains as close as possible to the sensors or deploy sensors to enhance coverage. In this paper, we consider a scenario where the target must traverse the sensor network within a certain time constraint. Furthermore, we propose some algorithms to ensure that the target stays close to the sensors within this time constraint. Simulations show that the proposed algorithms can solve traversal path problems in wireless sensor networks.

Suggested Citation

  • Lili Zhang & Cheng-Kuan Lin & Xiaoqiang Chen & Jianxi Fan & Yuan-Hsiang Teng, 2021. "Efficient algorithms for support path with time constraint," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 187-205, July.
    • Handle: RePEc:spr:jcomop:v:42:y:2021:i:1:d:10.1007_s10878-021-00745-x
    DOI: 10.1007/s10878-021-00745-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00745-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-021-00745-x?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:42:y:2021:i:1:d:10.1007_s10878-021-00745-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.