Information exchange with collision detection on multiple channels

Abstract. Information exchange is a fundamental communication primitive in radio networks. We study this problem in multi-channel singlehop networks. In particular, given k pieces of information, initially stored in k nodes respectively, the task is to broadcast these information pieces to the entire network via a set of F channels. We develop efficient distributed algorithms for this task for the scenario where both the identities and the number k of the initial information holders are unknown to the participating nodes. Assuming nodes with collision detection, we present an efficient randomized algorithm for unrestricted information exchange, where multiple information items can be combined into a single message. The algorithm disseminates all the information items within O( k F + F log2 n) timeslots with high probability. To the best of our knowledge, this is the first algorithm that breaks the Ω(k) lower bound for unrestricted information exchange if only a single channel is ava...

• Type: Journal
• Year: 2016
• Where: JCO
• Authors: Yuepeng Wang, Yuexuan Wang, Dongxiao Yu, Jiguo Yu, Francis C. M. Lau
• Keywords: JCO 2016