Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience

03/03/2019
by   Ni Ding, et al.
0

For a group of users in V where everyone observes a component of a discrete multiple random source, the process that users exchange data so as to reach omniscience, the state where everyone recovers the entire source, is called communication for omniscience (CO). We first consider how to improve the existing complexity O(|V|^2 ·SFM(|V|) of minimizing the sum of communication rates in CO, where SFM(|V|) denotes the complexity of minimizing a submodular function. We reveal some structured property in an existing coordinate saturation algorithm: the resulting rate vector and the corresponding partition of V are segmented in α, the estimation of the minimum sum-rate. A parametric (PAR) algorithm is then proposed where, instead of a particular α, we search the critical points that fully determine the segmented variables for all α so that they converge to the solution to the minimum sum-rate problem and the overall complexity reduces to O(|V| ·SFM(|V|)). For the successive omniscience (SO), we consider how to attain local omniscience in some complimentary user subset so that the overall sum-rate for the global omniscience still remains minimum. While the existing algorithm only determines a complimentary user subset in O(|V| ·SFM(|V|)) time, we show that, if a lower bound on the minimum sum-rate is applied to the segmented variables in the PAR algorithm, not only a complimentary subset, but also an optimal rate vector for attaining the local omniscience in it are returned in O(|V| ·SFM(|V|)) time.

READ FULL TEXT
research
12/26/2019

Part II: A Practical Approach for Successive Omniscience

In Part I, we studied the communication for omniscience (CO) problem and...
research
12/26/2019

Part I: Improving Computational Efficiency of Communication for Omniscience

Communication for omniscience (CO) refers to the problem where the users...
research
02/11/2019

Attaining Fairness in Communication for Omniscience

This paper studies how to attain fairness in communication for omniscien...
research
01/11/2018

A Monetary Mechanism for Stabilizing Cooperative Data Exchange with Selfish Users

This paper considers the problem of stabilizing cooperative data exchang...
research
05/14/2019

On Estimating Maximum Sum Rate of MIMO Systems with Successive Zero-Forcing Dirty Paper Coding and Per-antenna Power Constraint

In this paper, we study the sum rate maximization for successive zero-fo...
research
07/20/2021

Maximizing the Set Cardinality of Users Scheduled for Ultra-dense uRLLC Networks

Ultra-reliability and low latency communication plays an important role ...
research
02/03/2022

The Swapped Dragonfly

This paper describes the Swapped Dragonfly. It is a two-parameter family...

Please sign up or login with your details

Forgot password? Click here to reset