Cost-Delay Tradeoffs for Two-Way Relay Networks

We consider two sources in a wireless network exchanging stochastically varying traffic using an intermediate relay. Each relay use incurs some cost, which, for example, could be transmission energy. This cost is shared between the sources when packets from both are transmitted simultaneously by the...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications 2011-12, Vol.10 (12), p.4100-4109
Main Authors: Ciftcioglu, E. N., Sagduyu, Y. E., Berry, R. A., Yener, A.
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
competition
cooperation
Cost sharing
delay
Exact sciences and technology
Network coding
Networks
Packet transmission
Policies
queue stability
Queues
Relay
Relays
Resource management
Signal to noise ratio
Statistics
Stochastic processes
stochastic traffic
Studies
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
two-way relaying
Upper bound
Wireless communication
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider two sources in a wireless network exchanging stochastically varying traffic using an intermediate relay. Each relay use incurs some cost, which, for example, could be transmission energy. This cost is shared between the sources when packets from both are transmitted simultaneously by the relay using network coding. If the relay transmits a packet originating from one source only, the cost is incurred by that source only. In this setting, we study transmission policies that tradeoff the average cost with the average packet delay. We first present the cost-delay tradeoff for a centralized scheme using Lyapunov stability arguments. Next, we consider a distributed policy, where each source aims to optimize its own cost-delay tradeoff. We determine the Nash equilibrium of the resulting non-cooperative game and show that it performs worse than the centralized algorithm. To overcome this limitation, we introduce a pricing mechanism at the relay, which is shown to achieve the centralized performance. These algorithms, though oblivious to the arrival statistics, do require global knowledge of queue backlogs. Lastly, we consider distributed algorithms that overcome this requirement. Among those, we observe that simple queue-length threshold algorithms perform remarkably well.
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2011.101211.101360