TY - GEN
T1 - A heuristic solution for N-node bandwidth barter mechanism
AU - Nishio, Takayuki
AU - Shinkuma, Ryoichi
AU - Takahashi, Tatsuro
AU - Mandayam, Narayan
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84860681774&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84860681774&partnerID=8YFLogxK
U2 - 10.1109/CCNC.2012.6181120
DO - 10.1109/CCNC.2012.6181120
M3 - Conference contribution
AN - SCOPUS:84860681774
SN - 9781457720710
T3 - 2012 IEEE Consumer Communications and Networking Conference, CCNC'2012
SP - 356
EP - 357
BT - 2012 IEEE Consumer Communications and Networking Conference, CCNC'2012
T2 - 2012 IEEE Consumer Communications and Networking Conference, CCNC'2012
Y2 - 14 January 2012 through 17 January 2012
ER -