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

Twice Deployment Node Balance Algorithm for Road Network Surveillance

Author

Listed:
  • Liangyin Chen
  • Yecheng Li
  • Zhanghua Li
  • Wenke Li
  • Panlan Su
  • Hua Cheng
  • Qian Luo
  • Feng Yin
  • Yushi Jiang

Abstract

This paper proposes a twice deployment node balance algorithm (TDNB) which guarantees successful detection of the moving target on road networks. Through dividing the deployment of the sensor nodes into two phases instead of deploying all the sensors at one time, TDNB has a better performance. In the former phase, some of the sensors are deployed on the road at random. In the latter phase, the rest of the sensors are deployed on demand to make the number on each path the same. Due to the equivalence of the node's number, the network will have a prolonged lifetime after inserting nodes into the segment according to this algorithm. TDNB extends the network's lifetime remarkably compared with the former algorithms. Furthermore, TDNB enables us to insert nodes to the segment required in the network instead of all the segments, which reduces the workload to a large extent. In short, without increasing the number of sensors in road network, TDNB has a better performance compared to VISA in terms of network lifetime, which meets the demand for persistent monitoring application.

Suggested Citation

  • Liangyin Chen & Yecheng Li & Zhanghua Li & Wenke Li & Panlan Su & Hua Cheng & Qian Luo & Feng Yin & Yushi Jiang, 2014. "Twice Deployment Node Balance Algorithm for Road Network Surveillance," International Journal of Distributed Sensor Networks, , vol. 10(5), pages 957851-9578, May.
  • Handle: RePEc:sae:intdis:v:10:y:2014:i:5:p:957851
    DOI: 10.1155/2014/957851
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2014/957851
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2014/957851?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:5:p:957851. 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.