A Generalized Model for Cost and Fairness Analysis in Coded Cooperative Data Exchange
Authors:
- Shahriar Etemadi TajbakhshSTShahriar Etemadi Tajbakhsh
- Parastoo SadeghiParastoo Sadeghi
- Ramtin ShamsRSRamtin Shams
- 1 July 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23749660,p. 1-6
Abstract
We consider the issues of cost and fairness in the problem of cooperative data exchange among a group of wireless clients. In this problem, each client initially holds a subset of packets and needs to obtain the full set of packets through cooperation with other clients via a shared broadcast channel. To find minimum cost transmission schemes, we propose a general model for the problem which is based on network information flow with side information available to the sinks. As a special case of minimum cost solutions, the minimum number of required transmissions is studied in detail. We show that packet splitting is a natural consequence of solving the linear programming associated with the mentioned network flow problem. Our main observation is that splitting the packets not only minimizes the number of transmissions, but also it results in considerably more fairness compared to the case where splitting is not allowed. Hence, incentive-based long-term cooperation among users can be sustained.Keywords
This publication has 11 references indexed in Scilit:
- Optimal exchange of packets for universal recovery in broadcast networks2010
- On coding for cooperative data exchange2010
- On achievable rates for multicast in the presence of side information2008
- Network Coding Based Cooperative Peer-to-Peer Repair in Wireless Ad-Hoc Networks2008
- PPR2007
- Cooperative Peer-to-Peer Repair for Wireless Multimedia Broadcast2007
- Minimum-cost multicast over coded packet networksIEEE Transactions on Information Theory, 2006
- Linear network codingIEEE Transactions on Information Theory, 2003
- Distributed source coding for satellite communicationsIEEE Transactions on Information Theory, 1999
- Uniqueness of solution in linear programmingLinear Algebra and its Applications, 1979