Part II: A Practical Approach for Successive Omniscience
Ni Ding, Parastoo Sadeghi, Thierry Rakotoarivelo

TL;DR
This paper introduces a practical multi-stage approach for successive omniscience, optimizing the sequence of local omniscience in user subsets to achieve global omniscience efficiently.
Contribution
It proposes a multi-stage successive omniscience method using a parametric algorithm to identify optimal subsets for local omniscience, improving upon previous single-stage approaches.
Findings
The multi-stage approach achieves the minimum sum-rate for global omniscience.
A nesting sequence of subsets guides the successive local omniscience process.
Derived rate vectors optimize individual user transmissions at each stage.
Abstract
In Part I, we studied the communication for omniscience (CO) problem and proposed a parametric (PAR) algorithm to determine the minimum sum-rate at which a set of users indexed by a finite set attain omniscience. The omniscience in CO refers to the status that each user in recovers the observations of a multiple random source. It is called the global omniscience in this paper in contrast to the study of the successive omniscience (SO), where the local omniscience is attained subsequently in user subsets. By inputting a lower bound on the minimum sum-rate for CO, we apply the PAR algorithm to search a complimentary subset such that if the local omniscience in is reached first, the global omniscience whereafter can still be attained with the minimum sum-rate. We further utilize the outputs of the PAR algorithm to outline a multi-stage SO approach that is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Wireless Communication Security Techniques · Error Correcting Code Techniques
