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

A Vascular-Network-Based Nonuniform Hierarchical Fault-Tolerant Routing Algorithm for Wireless Sensor Networks

Author

Listed:
  • Hongbing Li
  • Peng Gao
  • Qingyu Xiong
  • Weiren Shi
  • Qiang Chen

Abstract

Fault tolerance is the key technology in wireless sensor networks which attracts many research interests. Aiming at the issue that the nodes' failures affect the network's stability and service quality, a vascular-network-based fault-tolerant routing algorithm is presented by nonuniform hierarchical clustering. According to the distribution characteristics of the vascular network and inspirations to the fault tolerance for wireless sensor networks, a mathematical model and network topology are, respectively, established. It applies the improved particle swarm optimization (IPSO) to the nonuniform hierarchical clustering, and multipaths are established between the neighbor hierarchical nodes based on the best-worst ant system (BWAS). It introduces the normalized values of the pheromone generated by the ants as the selection probabilities of transmitting paths to establish the hierarchical routing. Theoretical analysis and simulations show that the algorithm has higher packet receiving rates, lower average transmission delay, and balanced energy consumption. It has the good performance in fault tolerance and stability of data transmitting, and it avoids the hot issue in energy consumption and achieves the network load balance.

Suggested Citation

  • Hongbing Li & Peng Gao & Qingyu Xiong & Weiren Shi & Qiang Chen, 2012. "A Vascular-Network-Based Nonuniform Hierarchical Fault-Tolerant Routing Algorithm for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 8(11), pages 981380-9813, November.
  • Handle: RePEc:sae:intdis:v:8:y:2012:i:11:p:981380
    DOI: 10.1155/2012/981380
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/981380
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/981380?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:8:y:2012:i:11:p:981380. 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.