Joint Flow Routing and Relay Node Assignment in Cooperative Multi-Hop Networks

It has been shown that cooperative communications (CC) has the potential to significantly increase the capacity of wireless networks. However, most of the existing results are limited to single-hop wireless networks. To explore the behavior of CC in multi-hop wireless networks, we study a joint optimization problem of relay node assignment and flow routing for a group of sessions. We develop a mathematical model and propose a solution procedure based on the branch-and-bound framework augmented with cutting planes (BB-CP). We design several novel components to speed-up the computational time of BB-CP. Via numerical results, we show the potential rate gain that can be achieved by incorporating CC in multi-hop networks.

[1]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2]  Laurence A. Wolsey,et al.  Production Planning by Mixed Integer Programming , 2010 .

[3]  Deniz Gündüz,et al.  Opportunistic cooperation by dynamic resource allocation , 2007, IEEE Transactions on Wireless Communications.

[4]  Michalis Faloutsos,et al.  A Cross-Layer Framework for Exploiting Virtual MISO Links in Mobile Ad Hoc Networks , 2007, IEEE Transactions on Mobile Computing.

[5]  Eytan Modiano,et al.  Cooperative Routing in Static Wireless Networks , 2007, IEEE Transactions on Communications.

[6]  Aria Nosratinia,et al.  Diversity through coded cooperation , 2006, IEEE Transactions on Wireless Communications.

[7]  Edward W. Knightly,et al.  Cooperative Strategies and Achievable Rate for Tree Networks With Optimal Spatial Reuse , 2007, IEEE Transactions on Information Theory.

[8]  Jun Cai,et al.  Semi-Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay Networks , 2008, IEEE Transactions on Wireless Communications.

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

[10]  Katta G. Murty,et al.  Nonlinear Programming Theory and Algorithms , 2007, Technometrics.

[11]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[12]  Umberto Spagnolini,et al.  Energy Aware Power Allocation strategies for Multihop-Cooperative transmission schemes , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[13]  Raghupathy Sivakumar,et al.  Diversity Routing for Multi-hop Wireless Networks with Cooperative Transmissions , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[14]  Zhu Han,et al.  Distributed Relay Selection and Power Control for Multiuser Cooperative Communication Networks Using Buyer/Seller Game , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[15]  D.L. Goeckel,et al.  Cooperative communications in mobile ad hoc networks , 2006, IEEE Signal Processing Magazine.

[16]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

[17]  Yiwei Thomas Hou,et al.  Optimal relay assignment for cooperative communications , 2008, MobiHoc '08.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Kui Wu,et al.  Energy-efficient cooperative routing in multi-hop wireless ad hoc networks , 2006, 2006 IEEE International Performance Computing and Communications Conference.

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

[21]  Randall Berry,et al.  Throughput Optimal Control of Cooperative Relay Networks , 2005, IEEE Transactions on Information Theory.

[22]  Raviraj S. Adve,et al.  Improving amplify-and-forward relay networks: optimal power allocation versus selection , 2006, IEEE Transactions on Wireless Communications.

[23]  Gregory W. Wornell,et al.  Cooperative diversity in wireless networks: Efficient protocols and outage behavior , 2004, IEEE Transactions on Information Theory.