DocumentCode :
1410777
Title :
Polymatroidal Flows on Two Classes of Information Networks
Author :
Vasudevan, Dinkar ; Korada, Satish Babu
Author_Institution :
Icera, Inc., Bristol, UK
Volume :
57
Issue :
1
fYear :
2011
Firstpage :
227
Lastpage :
233
Abstract :
We present inner bounds to the broadcast capacity region of two classes of information networks: Networks of Multiple Access Channels (MACs) and Networks of Deterministic Broadcast Channels (DBCs). Our achievability scheme is a separation based scheme consisting of a physical layer that involves “cleaning up” the constituent channels in the network to create a point-to-point wired overlay, and a network layer that involves routing over this wired overlay. It is shown that finding the optimal way to “clean-up” is equivalent to the problem of finding maximal flows in “polymatroidal” flow networks, an already solved problem. The resulting inner bounds are cut-set bounds evaluated over product input distributions and are tight for Networks of DBCs.
Keywords :
broadcast channels; multi-access systems; DBC; MAC; broadcast capacity region; deterministic broadcast channel; information network; multiple access channel; polymatroidal flow; separation based scheme; Encoding; Interference; Joints; Markov processes; Receivers; Routing; Transmitters; Network of deterministic broadcast channels; network of multiple access channels; polymatroidal flow networks;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2010.2090229
Filename :
5673957
Link To Document :
بازگشت