Self-Stabilizing Philosophers with Generic Conflicts- implement in JAVA OR C

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 including problems in wire-
less sensor networks. A self-stabilizing deterministic algorithm is presented —GDP that solves this
generalized problem. The algorithm is terminating. The algorithm is extended to handle a similarly generalized drinking philosophers
and the committee coordination problem. The paper shows that GDP can be implemented in wireless
sensor networks and demonstrate that this implementation does not jeopardize its correctness or
termination properties.
I want someone to implement this algorithm, GDP with or without wireless sensor networks in JAVA or C .