An approach to termination detection in Delay Tolerant Networks

Termination detection in distributed systems has been a popular problem of study. It involves determining whether a computation running on multiple nodes has ceased all its activities. A large number of termination detection algorithms have been proposed with different computational models and methodologies. Here, termination detection is being investigated in the context of link-failure model which is common in Delay Tolerant Networks. A spanning tree based termination detection algorithm is used to suit such a model. Termination detection is freezed locally until the spanning tree is restored, rather than restarting it from the scratch again.