2009 · 37 citations · 13 references
ComputingComputer ScienceComputer NetworksDigital CommunicationWireless CommunicationsCommunication NetworksCooperative CommunicationNetwork Information TheoryWireless NetworksCooperative RelayingNetwork CodingRandom Access ProtocolsRelay NetworksRelay-assisted CommunicationStore-and-forward CommunicationStore-and-forward RoutingThroughput
In this paper, we investigate the effects of ldquonetwork-levelrdquo cooperation in a wireless three-node network with packet erasure links. Cooperation is achieved through the relaying of packets from the node farthest away from the destination by the intermediate node. We consider both scheduled access and random access, and compare the performance metrics of ldquostability regionrdquo and ldquothroughput regionrdquo. We observe that the throughput region depends on the priority choices at the relay node, and may or may not be equal to the stability region, which is shown to be independent of the priority choices. By contrast, in the non-cooperative random access system, the stability region and the throughput region are proved to be identical. Furthermore, if we apply network coding at the relay node, there is no improvement either in the stability region or in the throughput region over plain store-and-forward routing.
13
Capacity theorems for the relay channel
Thomas M. Cover, Abbas El Gamal · IEEE Transactions on Information Theory · 1979 · 4.2K citations
Three-terminal communication channels
Edward C. van der Meulen · Advances in Applied Probability · 1971 · 1.5K citations