Proceedings ArticleDOI
Cooperation above the physical layer: The case of a simple network
Beiyu Rong,Anthony Ephremides +1 more
- pp 1789-1793
Reads0
Chats0
TLDR
The effects of “network-level” cooperation in a wireless three-node network with packet erasure links is investigated, and it is observed 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 thepriority choices.Abstract:
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 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 “stability region” and “throughput region”. 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.read more
Citations
More filters
Journal ArticleDOI
Relay-Assisted Multiple Access With Full-Duplex Multi-Packet Reception
TL;DR: It is shown that perfect self-interference cancelation plays a crucial role when the SINR threshold is small, since it may result to worse performance in throughput and delay comparing with the half-duplex case.
Journal ArticleDOI
Cooperative Access in Wireless Networks: Stable Throughput and Delay
Beiyu Rong,Anthony Ephremides +1 more
TL;DR: This work investigates the impact of a protocol-level cooperation idea in a wireless multiple-access system, and indicates that cooperation can significantly reduce delay for both users.
Journal ArticleDOI
Stable Throughput in a Cognitive Wireless Network
TL;DR: It is shown that the more secondary nodes in the system, the better for the primary user in terms of his stable throughput, and the use of the secondary nodes as relays of the primary node's traffic to compensate for the interference they might cause.
Journal ArticleDOI
Opportunistic Cooperative Networking: To Relay or Not To Relay?
TL;DR: This paper considers opportunistic cooperative networking in wireless ad hoc networks, with a focus on characterizing the desired tradeoff between the probing cost for establishing cooperative relaying and hence higher throughput via opportunistic Cooperative networking.
Journal ArticleDOI
Network-level performance evaluation of a two-relay cooperative random access wireless system
TL;DR: This paper investigates the benefits from the deployment of a second relay in a wireless networks system, in which the users are divided into clusters, each being served by one relay, and shows its advantages in terms of aggregate and throughput per user.
References
More filters
Journal ArticleDOI
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
TL;DR: Using distributed antennas, this work develops and analyzes low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks and develops performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading.
Journal ArticleDOI
User cooperation diversity. Part I. System description
TL;DR: Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
Journal ArticleDOI
Capacity theorems for the relay channel
Thomas M. Cover,Abbas El Gamal +1 more
TL;DR: In this article, the capacity of the Gaussian relay channel was investigated, and a lower bound of the capacity was established for the general relay channel, where the dependence of the received symbols upon the inputs is given by p(y,y) to both x and y. In particular, the authors proved that if y is a degraded form of y, then C \: = \: \max \!p(x,y,x,2})} \min \,{I(X,y), I(X,Y,Y,X,Y
Capacity theorems for the relay channel
Thomas M. Cover,A. El Gamal +1 more
TL;DR: An achievable lower bound to the capacity of the general relay channel is established and superposition block Markov encoding is used to show achievability of C, and converses are established.
Journal ArticleDOI
User cooperation diversity. Part II. Implementation aspects and performance analysis
TL;DR: It is illustrated that, under all scenarios studied, cooperation is beneficial in terms of increasing system throughput and cell coverage, as well as decreasing sensitivity to channel variations.