Self-stabilizing Philosophers with Generic Conflicts

Abstract

We generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while conflict neighbors compete for the access to the exclusive critical section of code. This generalization is motivated by a number of practical problems in distributed systems. We present a self-stabilizing deterministic algorithm -KDP that solves a restricted version of the generalized problem where the conflict set for each process is limited to its k-hop neighborhood. We formally prove KDP correct and evaluate its performance. We then extend KDP to handle fully generalized problem. We further extend it to handle a similarly generalized drinking philosophers problem. We describe how KDP can be implemented in wireless sensor networks and demonstrate that this implementation does not jeopardize its correctness or termination properties. Thesis written by

Self-Stabilizing Deterministic Time Division Multiple Access for Sensor Networks

“…In this section, we compare and contrast the proposed algorithm with the related work. 2,6,7,9,20,24,30,37,38 Self-stabilizing deterministic TDMA algorithms. Related work that deals with self-stabilizing deterministic TDMA algorithms include.…”

“…Related work that deals with self-stabilizing deterministic TDMA algorithms include. 9,30,37 SS-TDMA. In, 30 Kulkarni and Arumugam propose a self-stabilizing TDMA (SS-TDMA) algorithm where the topology is known and cannot change.…”

“…Self-stabilizing philosophers. In, 9 Danturi et al proposed a self-stabilizing solution to dining philosophers problem where a process cannot share the critical section (CS) with non-neighboring processes also. Such generalized dining philosophers problem has application in distance-k coloring, where k is the distance up to which a process cannot share CS.…”

“…Such generalized dining philosophers problem has application in distance-k coloring, where k is the distance up to which a process cannot share CS. In, 9 each process p is assumed to maintain a tree (rooted at p) that spans the processes with whom p cannot share CS using algorithms from the literature. However, existing tree construction and maintenance algorithms are not written for WAC model.…”

“…On the contrary, in our algorithm, we show how a token circulation algorithm can be used in WAC model in order to obtain distance 2 coloring. And, on the other hand, unlike our algorithm, the approach in 9 allows concurrent coloring of processes.…”