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

Lu, Chuiwei; Hu, Defa

doi:10.1515/cait-2016-0019

Cited by 9 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This can result in power outage in some sensor networks resulting in loss of communication among nodes. Lu [15] addressed the problem by proposing a new algorithm using the structured directional de Brujin graph to improve the fault tolerance of communication protocols in wireless sensor networks. The intuition behind the proposed algorithm is to deploy nodes with high energy to act as super nodes responsible for formation of redundant routing tables.…”

Section: Literature Reviewmentioning

confidence: 99%

Fault Tolerant Suffix Trees

Ahmad¹,

Shah²,

Shahnaz³

et al. 2020

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Classical algorithms and data structures assume that the underlying memory is reliable, and the data remain safe during or after processing. However, the assumption is perilous as several studies have shown that large and inexpensive memories are vulnerable to bit flips. Thus, the correctness of output of a classical algorithm can be threatened by a few memory faults. Fault tolerant data structures and resilient algorithms are developed to tolerate a limited number of faults and provide a correct output based on the uncorrupted part of the data. Suffix tree is one of the important data structures that has widespread applications including substring search, super string problem and data compression. The fault tolerant version of the suffix tree presented in the literature uses complex techniques of encodable and decodable error-correcting codes, blocked data structures and fault-resistant tries. In this work, we use the natural approach of data replication to develop a fault tolerant suffix tree based on the faulty memory random access machine model. The proposed data structure stores copies of the indices to sustain memory faults injected by an adversary. We develop a resilient version of the Ukkonen's algorithm for constructing the fault tolerant suffix tree and derive an upper bound on the number of corrupt suffixes.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Fault Tolerant Suffix Trees

Ahmad¹,

Shah²,

Shahnaz³

et al. 2020

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

show abstract

“…Thus, it is possible to determine the exact location of each length-n substring in the sequence. Throughout the years, these sequences have found a variety of applications in cryptography [37], wireless sensor network [39], racetrack memory [8], and DNA storage [56].…”

Section: 1 Positioning Sequencesmentioning

confidence: 99%

“…In this work, we demonstrate that Conjecture A is true for an infinite set of parameters. In the range n 2 [2,50] (39,20), (40,21), (40,22), (41,21), (41,22), (42,22), (46,25), (47,25), (47,26), (48,25), (48,26), (49,25), (49,26), (50,25), (50,26), (50,27)}.…”

Section: The Case N/2 < D < 2n/3mentioning

confidence: 99%