deposit_your_work

Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints

Files in this item

Files Size Format View
Kho2003Apr5BoundsonA.PDF 187.3Kb application/pdf Thumbnail

Show full item record

Item Metadata

Title: Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints
Author: Khojastepour, Mohammad; Aazhang, Behnaam; Sabharwal, Ashutosh
Type: Conference Paper
Keywords: Capacity; Discrete memoryless channel; Acheivable rates
Citation: M. Khojastepour, B. Aazhang and A. Sabharwal,"Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints," in Information Processing in Sensor Networks,
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 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, and thus their respective capacities are derived.
Date Published: 2003-04-20

This item appears in the following Collection(s)

  • ECE Publications [1082 items]
    Publications by Rice University Electrical and Computer Engineering faculty and graduate students