Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints
| |
|
Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints
Mohammad Ali Khojastepour6  , Ashutosh Sabharwal6 and Behnaam Aazhang6
| (6) |
Department of Electrical and Computer Engineering, Rice University, 6100 Main St. MS-366, Houston, TX, 77005 |
Abstract
We consider the problem of communication in a general multi-terminal network where each node of the network is a potential
sender or receiver (or both) but it cannot do both functions together. The motivation for this assumption comes from the fact
that current radios in sensor nodes operate in TDD mode when the transmitting and receiving frequencies are the same. We label
such a radio as a cheap radio and the corresponding node of the network as a cheap node.
We derive bounds on the achievable rates in a general multi-terminal network with finite number of states. The derived bounds
coincide with the known cut-set bound [11] of network information theory if the network has just one state. Also, the bounds trivially hold in the network with cheap
nodes because such a network operates in a finite number of states when the number of nodes is finite. As an example, application
of these bounds in the multi-hop network and the relay channel with cheap nodes is presented. In both of these cases, the
bounds are tight enough to provide converses for the coding theorems [16], and thus their respective capacities are derived.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|