Optimal resource allocation and relay selection in bandwidth exchange based cooperative forwarding

In this paper, we investigate joint optimal relay selection and resource allocation under bandwidth exchange (BE) enabled incentivized cooperative forwarding in wireless networks. We consider an autonomous network where N nodes transmit data in the uplink to an access point (AP) / base station (BS). We consider the scenario where each node gets an initial amount (equal, optimal based on direct path or arbitrary) of bandwidth, and uses this bandwidth as a flexible incentive for two hop relaying. We focus on α-fair network utility maximization (NUM) and outage reduction in this environment. Our contribution is two-fold. First, we propose an incentivized forwarding based resource allocation algorithm which maximizes the global utility while preserving the initial utility of each cooperative node. Second, defining the link weight of each relay pair as the utility gain due to cooperation (over noncooperation), we show that the optimal relay selection in α-fair NUM reduces to the maximum weighted matching (MWM) problem in a non-bipartite graph. Numerical results show that the proposed algorithms provide 20–25% gain in spectral efficiency and 90–98% reduction in outage probability.

[1]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[3]  Hesham El Gamal,et al.  The three-node wireless network: achievable rates and Cooperation strategies , 2005, IEEE Transactions on Information Theory.

[4]  Chris T. K. Ng,et al.  Transmit Signal and Bandwidth Optimization in Multiple-Antenna Relay Channels , 2010, IEEE Transactions on Communications.

[5]  Jean Walrand,et al.  Fair end-to-end window-based congestion control , 1998, TNET.

[6]  Baochun Li,et al.  Efficient Resource Allocation with Flexible Channel Cooperation in OFDMA Cognitive Radio Networks , 2010, 2010 Proceedings IEEE INFOCOM.

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

[8]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[9]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[10]  Ryoichi Shinkuma,et al.  Bandwidth exchange: an energy conserving incentive mechanism for cooperation , 2010, IEEE Transactions on Wireless Communications.

[11]  Levente Buttyán,et al.  Nash equilibria of packet forwarding strategies in wireless ad hoc networks , 2006, IEEE Transactions on Mobile Computing.

[12]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[13]  Jean-Yves Le Boudec,et al.  Self-policing mobile ad hoc networks by reputation systems , 2005, IEEE Communications Magazine.

[14]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[15]  Narayan B. Mandayam,et al.  Optimal resource allocation in a bandwidth exchange enabled relay network , 2011, 2011 - MILCOM 2011 Military Communications Conference.

[16]  Xuemin Shen,et al.  Maximizing Cooperative Diversity Energy Gain for Wireless Networks , 2007, IEEE Transactions on Wireless Communications.

[17]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[18]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[19]  Leandros Tassiulas,et al.  End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[20]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[21]  Qian Zhang,et al.  Stackelberg game for utility-based cooperative cognitiveradio networks , 2009, MobiHoc '09.

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

[23]  Narayan B. Mandayam,et al.  Pricing for enabling forwarding in self-configuring ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[24]  Jaap-Henk Hoepman,et al.  Simple Distributed Weighted Matchings , 2004, ArXiv.