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

Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor Networks

Author

Listed:
  • Demin Gao
  • Yunfei Liu
  • Fuquan Zhang
  • Jun Song

Abstract

In rechargeable wireless sensor networks (R-WSNs), sensors have to adjust their duty cycles continuously owing to sporadic availability of energy and operate in a very low duty cycle because of current energy conversion technical limitations. Even though the network lifetime is not the main problem, packet delivery latency is critical because a sensor is in the dormant state most of the time in R-WSNs. These unique characteristics pose a new challenge for routing protocol design over traditional energy-static sensor networks. In this work, we introduce a routing protocol based on anycast communications technology, a novel design to minimize packet delivery latency for forest monitoring in R-WSNs. The key idea is to let a sender choose a closest neighbor to forward packets from forwarding candidates and a nearest sink node to accept the packet from all sinks. For multiple source nodes, we introduce an anycast technology based on Tabu search for each source establishing a minimal E2E delay routing path to reach anyone sinks. Through extensive simulation and experiments, we demonstrate that our anycast scheme based on Tabu search is efficient to provide smallest packets delivery latency in R-WSNs.

Suggested Citation

  • Demin Gao & Yunfei Liu & Fuquan Zhang & Jun Song, 2013. "Anycast Routing Protocol for Forest Monitoring in Rechargeable Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 9(12), pages 239860-2398, December.
  • Handle: RePEc:sae:intdis:v:9:y:2013:i:12:p:239860
    DOI: 10.1155/2013/239860
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/239860
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2013/239860?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:9:y:2013:i:12:p:239860. 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.