Distributed colouring and communication in rings with local knowledge
We consider two interrelated tasks in a synchronous n-node ring: distributed constant colouring and local communication. We investigate the impact of the amount of knowledge available to nodes on the time of completing these tasks. Every node knows the labels of nodes up to a distance r from it, called the knowledge radius. In distributed constant colouring every node has to assign itself one out
