| Summary: | The number of Internet-connected devices grows very rapidly, with even fears of running out of available IP addresses. It is clear that the number of sensors follows this trend, thus inducing large sensor networks. It is insightful to make the comparison with the huge number of processors of modern supercomputers. In such large networks, the problem of node faults necessarily arises, with faults often happening in clusters. The tolerance to faults, and especially cluster faults, is thus critical. Furthermore, thanks to its advantageous topological properties, the torus interconnection network has been adopted by the major supercomputer manufacturers of the recent years, thus proving its applicability. Acknowledging and embracing these two technological and industrial aspects, we propose in this paper a node-to-node routing algorithm in an <inline-formula> <math display="inline"> <semantics> <mi>n</mi> </semantics> </math> </inline-formula>-dimensional <inline-formula> <math display="inline"> <semantics> <mi>k</mi> </semantics> </math> </inline-formula>-ary torus that is tolerant to faults. Not only is this algorithm tolerant to faulty nodes, it also tolerates faulty node clusters. The described algorithm selects a fault-free path of length at most <inline-formula> <math display="inline"> <semantics> <mrow> <mi>n</mi> <mo>(</mo> <mn>2</mn> <mi>k</mi> <mo>+</mo> <mo>⌊</mo> <mi>k</mi> <mo>/</mo> <mn>2</mn> <mo>⌋</mo> <mo>−</mo> <mn>2</mn> <mo>)</mo> </mrow> </semantics> </math> </inline-formula> with an <inline-formula> <math display="inline"> <semantics> <mrow> <mi>O</mi> <mo>(</mo> <msup> <mi>n</mi> <mn>2</mn> </msup> <msup> <mi>k</mi> <mn>2</mn> </msup> <mo>|</mo> <mi>F</mi> <mo>|</mo> <mo>)</mo> </mrow> </semantics> </math> </inline-formula> worst-case time complexity with <inline-formula> <math display="inline"> <semantics> <mi>F</mi> </semantics> </math> </inline-formula> the set of faulty nodes induced by the faulty clusters.
|
|---|