2015/03/30 by Li Ning, Ning, Li, Dongxiao Yu +9
Computer Science · #Cooperative Communication and Network Coding #Distributed #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Opportunistic and Delay-Tolerant Networks #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1503.08570
openalex publication_date 2015/03/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In the information exchange problem, k packets that are initially maintained by k nodes need to be disseminated to the whole network as quickly as possible. We consider this problem in single-hop multi- channel networks of n nodes, and propose a uniform protocol that with high probability accomplishes the dissemination in O(k/F + F ⋅ log n) rounds, assuming F available channels and collision detection. This result is asymptotically optimal when k is large (k ≥ F2 ⋅ log n). To our knowledge, this is the first uniform protocol for information exchange in multi-channel networks.