Polymatroidal Flows on Two Classes of Information Networks

Vasudevan, Dinkar; Korada, Satish Babu

doi:10.1109/tit.2010.2090229

Cited by 6 publications

(11 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theorem 2: For the deterministic broadcast network, the region is achievable, i.e., a rate vector is achievable if there is a product distribution (denoted by ) such that (16) Remark 1: For many special classes of deterministic networks such as the linear-deterministic network and the network composed of deterministic BCs [26], it can be shown that the cut-set bound is also maximized by the product distribution, thereby characterizing the capacity of such networks completely.…”

Section: Deterministic Broadcast Networkmentioning

confidence: 99%

“…The probability of error for emulation is defined as the probability that the emulated vector is different from the vector in the DSN and is given by (26) In [2], it has been shown that there exits an emulation mapping such that the probability of error for emulation can be made arbitrarily small for rate within a constant of the cut-set bound. This is stated more precisely in the following lemma.…”

Section: B Unicast Network: Connection Between Gaussian and Dsnmentioning

confidence: 99%

“…Decode-and-forward schemes were considered and specialized outer bounds were given for this network, which were shown to be better than cut-set bounds. More recently, Vasudevan and Korada [26] have considered broadcasting over two classes of information networks-1) a network composed of multiple-access channels (MACs) alone and 2) a network composed of deterministic BCs alone. For such networks, it was shown there that cut-set bound can be achieved.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Approximately Optimal Wireless Broadcasting

Kannan

Raja

Viswanath

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

We study a wireless broadcast network, where a single source reliably communicates independent messages to multiple destinations, with the potential aid of relays and cooperation between destinations. The wireless nature of the medium is captured by the broadcast nature of transmissions as well as the superposition of transmitted signals plus independent Gaussian noise at the received signal at any radio. We propose a scheme that can achieve rate tuples within a constant gap away from the cut-set bound, where the constant is independent of channel coefficients and power constraints. First, for a deterministic broadcast network, we propose a new coding scheme, constructed by adopting a "receiver-centric" viewpoint, that uses quantize-and-forward relaying as an inner code concatenated with an outer Marton code for the induced deterministic broadcast channel. This scheme is shown to achieve the cut-set bound evaluated with product form distributions. This result is then lifted to the Gaussian network by using a deterministic network called the discrete superposition network as a formal quantization interface. This two-stage construction circumvents the difficulty involved in working with a vector nonlinear non-Gaussian broadcast channel that arises if we construct a similar scheme directly for the Gaussian network.Index Terms-Broadcast network, broadcast-relay channels, capacity, Marton code, multiuser channels, network information theory, wireless networks.

show abstract

Section: Deterministic Broadcast Networkmentioning

confidence: 99%

Section: B Unicast Network: Connection Between Gaussian and Dsnmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Approximately Optimal Wireless Broadcasting

Kannan

Raja

Viswanath

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…Accordingly, p s is decided through Eqs. (28) or (34). The experimental results show that the exploitation of marginal user principle brings an effective contribution in profit performance improvement.…”

Section: Performance Analysis Of Marginal User Decisionmentioning

confidence: 94%

“…This is the second outstanding property of the polymatroid structure particularly in multiuser scenarios. Recently, polymatroid theory has started to be recognized as the emerging solution for problems in information networks [34].…”

Section: Proofmentioning

confidence: 99%

Profit Improvement in Wireless Video Broadcasting System: A Marginal Principle Approach

Chen

et al. 2015

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

In this paper, we address the problem of how to make the wireless service provider have better profits with consideration of user experience provision in wireless video broadcasting systems. We propose a marginal-based pricing and a resource-allocation framework to achieve better resource utilization and profit improvement. The marginal principle includes 1) marginal user principle, in which a pricing mechanism is established on the basis of marginal users, such that the WSP can seek its own maximum profit of each content with a QoE guarantee; 2) marginal profit principle, in which a WSP can earn the maximum profit through multicontent-service provision by regulating rate allocation in limited available bandwidth. Furthermore, we present a two-tier framework consisting of the inner and outer loops. The inner loop focuses on pricing-based service provision based on the notion of marginal user principle. The outer loop concentrates on allocating bandwidth among multiple video contents according to marginal profit principle. For the solution, we model the profit regions of WSPs and end-users as the polymatroid structures and model the corresponding allocated rate regions as the contra-polymatroid structures. Through exploiting the properties of polymatroid and contra-polymatroid structures, the broadcasting profit problem is solved by finding the optimal rate vector on the sum-rate facet which satisfies the maximal achievable profit. Extensive performance comparison and analysis are presented to demonstrate efficiency of the proposed solution.

show abstract