TY - JOUR
T1 - Cost-delay tradeoffs for two-way relay networks
AU - Ciftcioglu, Ertugrul Necdet
AU - Sagduyu, Yalin Evren
AU - Berry, Randall A.
AU - Yener, Aylin
N1 - Funding Information:
This work was presented in part at the 47th Annual Allerton Conference on Communication, Control, and Computing, September 2009. This work was supported in part by the National Science Foundation under Grant CNS-0721445, and the DARPA ITMANET Program under Grant W911NF-07-1-0028. Digital Object Identifier 10.1109/TWC.2011.101211.101360
PY - 2011/12
Y1 - 2011/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84355161966&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84355161966&partnerID=8YFLogxK
U2 - 10.1109/TWC.2011.101211.101360
DO - 10.1109/TWC.2011.101211.101360
M3 - Article
AN - SCOPUS:84355161966
SN - 1536-1276
VL - 10
SP - 4100
EP - 4109
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 12
M1 - 6059446
ER -