作者: Beiyu Rong , Anthony Ephremides
DOI: 10.1109/ISIT.2009.5205278
关键词: Computer network 、 Node (networking) 、 Distributed computing 、 Throughput (business) 、 Relay 、 Network packet 、 Physical layer 、 Random access 、 Wireless 、 Computer science 、 Throughput 、 Linear network coding 、 Erasure
摘要: In this paper, we investigate the effects of “network-level” cooperation in a wireless three-node network with packet erasure links. Cooperation is achieved through relaying packets from node farthest away destination by intermediate node. We consider both scheduled access and random access, compare performance metrics “stability region” “throughput region”. observe that throughput region depends on priority choices at relay node, may or not be equal to stability region, which shown independent choices. By contrast, non-cooperative system, are proved identical. Furthermore, if apply coding there no improvement either over plain store-and-forward routing.