Joint protocol and relay node selection in collaborative networks

We consider a multi-hopping communication network of users transmitting information on a shared medium with limited resources, e.g., limited time and limited bandwidth. We assume that two users collaborate (one acts as a relay for another) only if, as a result of the collaboration, they gain more capacity, save on resources or save power.We perform optimal resource allocation for three problems: 1) maximizing the capacity given limited resource and energy, 2) minimizing the resource usage given capacity and energy and 3) minimizing energy usage given capacity and resources. By comparing the collaboration gain as a function of the channels and available energies, one may decide either to collaborate or not and select a collaborator among candidates. We show that a significant gain is attained only if the channel energy gain of one of the users is significantly smaller than those of other involved links. Depending on the channel conditions, there is a given capacity gain ratio that may be obtained, where eta is the environment path loss exponent. We show that the energy minimizing problem is the dual of the capacity maximizing problem. Also we show that users requiring low capacity might not gain more resources from possible collaboration.

[1]  M. Gastpar,et al.  Information-theoretic multihopping for relay networks , 2004, International Zurich Seminar on Communications, 2004.

[2]  E. Meulen,et al.  Three-terminal communication channels , 1971, Advances in Applied Probability.

[3]  Jean-Yves Le Boudec,et al.  A unified framework for max-min and min-max fairness with applications , 2007, TNET.

[4]  Elza Erkip,et al.  User cooperation diversity. Part I. System description , 2003, IEEE Trans. Commun..

[5]  Aria Nosratinia,et al.  CTH13-2: Relay Channel with Private Messages , 2006, IEEE Globecom 2006.

[6]  Elza Erkip,et al.  User cooperation diversity. Part II. Implementation aspects and performance analysis , 2003, IEEE Trans. Commun..

[7]  Leandros Tassiulas,et al.  Maxmin fair scheduling in wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Michael Gastpar,et al.  Cooperative strategies and capacity theorems for relay networks , 2005, IEEE Transactions on Information Theory.

[9]  Saeed Gazor,et al.  Collaborative Gain in Resource Sharing Communication Networks , 2007, ArXiv.

[10]  Helmut Bölcskei,et al.  Fading relay channels: performance limits and space-time signal design , 2004, IEEE Journal on Selected Areas in Communications.