Cost sharing with network coding in two-way relay networks

Authors:
Ertugrul Necdet Ciftcioglu;Yalin Evren Sagduyu;Randall Berry;Aylin Yener
Affiliations:
Dept. of Electrical Engineering, The Pennsylvania State University, University Park, PA;Dept. of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL;Dept. of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL;Dept. of Electrical Engineering, The Pennsylvania State University, University Park, PA
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 11
Cited 0

Data networks (2nd ed.)

Data networks (2nd ed.)
Minimum-cost multicast over coded packet networks

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Stability regions of two-way relaying with network coding

Proceedings of the 4th Annual International Conference on Wireless Internet
Dynamic algorithms for multicast with intra-session network coding

IEEE Transactions on Information Theory
Network information flow

IEEE Transactions on Information Theory
Communication over fading channels with delay constraints

IEEE Transactions on Information Theory
Energy optimal control for time-varying wireless networks

IEEE Transactions on Information Theory
Optimal Energy and Delay Tradeoffs for Multiuser Wireless Downlinks

IEEE Transactions on Information Theory
Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks

IEEE Transactions on Information Theory
Performance Bounds for Bidirectional Coded Cooperation Protocols

IEEE Transactions on Information Theory
Network Coding Games with Unicast Flows

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a scenario in which two sources exchange stochastically varying traffic with the aid of a bi-directional relay that may perform network coding over the incoming packets. Each relay use incurs a unit cost, e.g., transmission energy. This cost is shared between the sources when packets from both are transmitted via network coding; if traffic from a single source is sent, the cost is passed on to only that source. We study transmission policies which trade-off the average cost with the average packet delay. First, we analyze the cost-delay trade-off for a centralized control scheme using Lyapunov stability arguments. We then consider a distributed control scheme, where each source selfishly optimizes its own cost-delay trade-off by playing a non-cooperative game. We determine the Nash equilibrium and show that it performs worse than the centralized algorithm. However, appropriate pricing at the relay achieves the centralized performance. These algorithms require full information of queue backlogs. Next, we relax this assumption and any source makes the transmission decision depending on whether the other sources queue backlog exceeds a threshold, or not. This needs only one bit information exchange and leads to asymptotically optimal cost, as the delay grows. Finally, we consider cost sharing with only local queue information at each source. The results illustrate new cost-delay trade-offs based on different levels of cooperation and queue information availability.