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

Simple item page
dc.citation.bibtexNameinproceedingsen_US
dc.citation.conferenceNameInformation Processing in Sensor Networksen_US
dc.contributor.authorKhojastepour, Mohammaden_US
dc.contributor.authorAazhang, Behnaamen_US
dc.contributor.authorSabharwal, Ashutoshen_US
dc.contributor.orgCenter for Multimedia Communications (http://cmc.rice.edu/)en_US
dc.date.accessioned2007-10-31T00:49:24Zen_US
dc.date.available2007-10-31T00:49:24Zen_US
dc.date.issued2003-04-20en_US
dc.date.modified2003-11-09en_US
dc.date.note2003-02-14en_US
dc.date.submitted2003-04-20en_US
dc.descriptionConference paperen_US
dc.description.abstractWe 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 <i>cheap</i> radio and the corresponding node of the network as a <i>cheap</i> 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.en_US
dc.description.sponsorshipNokiaen_US
dc.identifier.citationM. Khojastepour, B. Aazhang and A. Sabharwal, "Bounds on Achievable Rates for General Multi-terminal Networks with Practical Constraints," 2003.en_US
dc.identifier.urihttps://hdl.handle.net/1911/20009en_US
dc.language.isoengen_US
dc.subjectCapacityen_US
dc.subjectDiscrete memoryless channelen_US
dc.subjectAcheivable ratesen_US
dc.subject.keywordCapacityen_US
dc.subject.keywordDiscrete memoryless channelen_US
dc.subject.keywordAcheivable ratesen_US
dc.titleBounds on Achievable Rates for General Multi-terminal Networks with Practical Constraintsen_US
dc.typeConference paperen_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kho2003Apr5BoundsonA.PDF
Size:
182.94 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications