Abstract
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 -dimensional -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 with an worst-case time complexity with the set of faulty nodes induced by the faulty clusters.
Highlights
As mentioned, for instance, in [1,2], the number of Internet-connected devices is seeing a very rapid growth, with even fears of running out of available IP addresses
By describing a routing algorithm that is tolerant to faults, the resilience and data transmission performance of the sensor network are increased, which offers a higher quality-of-service
The described algorithm selects a fault-free path of length at most n(2k + bk/2c − 2) with an O(n2 k2 | F |) worst-case time complexity with F the set of faulty nodes induced by the faulty clusters
Summary
For instance, in [1,2], the number of Internet-connected devices is seeing a very rapid growth, with even fears of running out of available IP addresses. In this paper we describe a node-to-node torus routing algorithm under the cluster-fault tolerant model: in addition to faulty nodes, faulty clusters of diameter at most one are considered This induces new conditions on the number of tolerable faults in such a network, refining the conditions stated by Menger’s theorem. Given the number of nodes kn and edges nkn involved in an n-dimensional k-ary torus, solving this cluster-fault tolerant routing problem with a conventional routing algorithm such as Dijkstra’s is clearly impractical: its worst-case time complexity is of polynomial order in the number of nodes or edges of the network, and the same discussion holds with a breadth-first search algorithm [11]
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
