<abstract xmlns="http://www.w3.org/1999/xhtml"><p> Wireless Sensor Network (WSNs) nodes with low energy, run out of energy easily and stop working, which results then in routing failures and communication blocking. The paper puts forward a FTRSDDB algorithm based on the structured directional de Bruijn graph to enhance the performance of faulttolerant routing for WSNs. The algorithm randomly deploys some super nodes with abundant energy and powerful performance in WSNs. These nodes are responsible for the collection of topology information from the WSNs to build redundant routing table, and provide data forwarding and routing update service for popular nodes. The FTRSDDB algorithm optimizes network topology structure using de Bruijn graph, and can quickly find neighbor nodes failure and invalid routing path, and then calculate new routing information with low cost, which greatly improves the performance of fault-tolerant routing of WSNs. Experiments show that the FTRSDDB algorithm takes on better performance compared with other faulttolerant routing algorithms, even that exist malicious nodes attack in the WSNs.</p></abstract>

Wireless Sensor Network (WSNs) nodes with low energy, run out of energy easily and stop working, which results then in routing failures and communication blocking. The paper puts forward a FTRSDDB algorithm based on the structured directional de Bruijn graph to enhance the performance of faulttolerant routing for WSNs. The algorithm randomly deploys some super nodes with abundant energy and powerful performance in WSNs. These nodes are responsible for the collection of topology information from the WSNs to build redundant routing table, and provide data forwarding and routing update service for popular nodes. The FTRSDDB algorithm optimizes network topology structure using de Bruijn graph, and can quickly find neighbor nodes failure and invalid routing path, and then calculate new routing information with low cost, which greatly improves the performance of fault-tolerant routing of WSNs. Experiments show that the FTRSDDB algorithm takes on better performance compared with other faulttolerant routing algorithms, even that exist malicious nodes attack in the WSNs.

A Fault-Tolerant Routing Algorithm for Wireless Sensor Networks Based on the Structured Directional de Bruijn Graph

Computer Institute, Hubei Polytechnic University, Huangshi 435003, Hubei, China

School of Information, Hunan University of Commerce, Changsha 410205, Hunan, China

Cybernetics and Information Technologies

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Wireless Sensor Network (WSNs) nodes with low energy, run out of energy easily and stop working, which results then in routing failures and communication...

A Fault-Tolerant Routing Algorithm for Wireless Sensor Networks Based on the Structured Directional de Bruijn Graph

Pubblicato online: 22 giu 2016

Pagine: 46 - 59

DOI: https://doi.org/10.1515/cait-2016-0019

Parole chiave
Wireless sensor networks, directional de Bruijn graph, fault-tolerant routing

© by Chuiwei Lu

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

A Fault-Tolerant Routing Algorithm for Wireless Sensor Networks Based on the Structured Directional de Bruijn Graph

Pubblicato online: 22 giu 2016

Pagine: 46 - 59

DOI: https://doi.org/10.1515/cait-2016-0019

Parole chiaveWireless sensor networks, directional de Bruijn graph, fault-tolerant routing

© by Chuiwei Lu

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Parole chiave
Wireless sensor networks, directional de Bruijn graph, fault-tolerant routing