A heuristic solution for N-node bandwidth barter mechanism

Bandwidth barter is an effective way of satisfying throughput requirements in wireless networks; we could expect a station (STA) allows another STA to borrow its bandwidth as long as it is also beneficial for the STA. Our previous work proved bandwidth barter between two STAs is optimized based on Nash bargaining solution (NBS), which brings the Pareto efficiency and the proportional fairness in the bartering game. However, it still remains an open issue how to solve the bartering game when the number of STAs is N (N >; 2), which is discussed in this paper.

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

[2]  Go Hasegawa,et al.  TCP-based window-size delegation method for TXOP Exchange in wireless local area networks , 2011, EURASIP J. Wirel. Commun. Netw..

[3]  TXOP exchange: A cooperation mechanism for wireless access networks , 2011, 2011 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR).

[4]  Takayuki Nishio,et al.  BS-9-5 A Coordination Algorithm for N-node Cooperation Problem in Open-Resource Wireless Access Networks , 2010 .