For each participant A there is stored the identity of all near neighbors B (A) and all far neighbors C (A) being within a radius R of his near neighbors B (A) and who are not also near neighbors B (A) of A. During each first time slice, any participant having a higher priority for the respective first time slice than all of his near and far neighbors may transmit data including the identities of