Title :
A heuristic solution for N-node bandwidth barter mechanism
Author :
Nishio, Takayuki ; Shinkuma, Ryoichi ; Takahashi, Tatsuro ; Mandayam, Narayan
Author_Institution :
Grad. Sch. of Inf., Kyoto Univ., Kyoto, Japan
Abstract :
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.
Keywords :
game theory; radio networks; N-node bandwidth barter mechanism; Nash bargaining solution; Pareto efficiency; bartering game; heuristic solution; wireless networks; Throughput;
Conference_Titel :
Consumer Communications and Networking Conference (CCNC), 2012 IEEE
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4577-2070-3
DOI :
10.1109/CCNC.2012.6181120
