* rewrote the paper to have a solution to the generic diners problem rather than the restricted (k-hop) version * added comparison to [Blin et al 2003] a snap-stabilizing PIF paper that constructs the spanning tree on the fly as it propagates the request (in the algorithm overview -- section 3.1 and in the conclusion) * added a formal proof of the termination of our algorithm (theorem 4) * added a more detailed discussion of coordination between spanning tree construction and the solution to diners - in algorithm overview (Section 3.1) also cited [Herman 1991] - in implementation in wireless sensor networks also cited [Nesterenko and Arora 2001] * updated the further extensions section, In particular - added the extension of KDP (our main algorithm) to the drinking philosophers problem that is less efficient but much simpler. - added a new subsection describing the extension of KDP to committee coordination problem. - modified future research extension section by adding several interesting subjects of future exploration. In one such subject we discussed how our algorithm can be modified to withstand crash-faults alongside transient faults.