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

Resilient greedy routing on GPS-free surface sensor networks

Author

Listed:
  • Buri Ban
  • Xuan Li
  • Miao Jin

Abstract

We design a greedy routing scheme specifically for GPS-free large-scale wireless sensor networks deployed on surfaces of complex-connected three-dimensional settings. Compared with other greedy embedding–based surface network routing scheme, the proposed one is cut free such that no pair of nodes suffers a long detour to reach each other. The routing scheme is designed to be resilient to node or link failures especially under random node or link failure model where each node in a network has an equal and independent probability of failure during some time interval. The proposed algorithm is fully distributed and scalable to both the size and the topological complexity of a network. Each sensor node requires only limited and constant storage. Simulation results show the proposed routing scheme with a higher successful delivery ratio, a lower average stretch factor, and a lower normalized communication cost compared with other resilient routing methods.

Suggested Citation

  • Buri Ban & Xuan Li & Miao Jin, 2020. "Resilient greedy routing on GPS-free surface sensor networks," International Journal of Distributed Sensor Networks, , vol. 16(4), pages 15501477209, April.
    • Handle: RePEc:sae:intdis:v:16:y:2020:i:4:p:1550147720913810
    DOI: 10.1177/1550147720913810
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147720913810
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147720913810?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:16:y:2020:i:4:p:1550147720913810. 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.