Provided by: Association for Computing Machinery
Date Added: Jun 2012
In this paper, the authors study the information exchange problem on a set of multiple access channels: k arbitrary nodes have information they want to distribute to the entire network via a shared medium partitioned into channels. They present algorithms and lower bounds on the time and channel complexity for disseminating these k information items in a single-hop network of n nodes. A fundamental problem of many communication systems that rely on a shared communication medium, e.g., wireless and bus networks, is (co-channel) interference, which occurs when more than one network entity tries to transmit a message over the same communication channel at the same time.