A heuristic solution for N-node bandwidth barter mechanism

Takayuki Nishio, Ryoichi Shinkuma, Tatsuro Takahashi, Narayan Mandayam

研究成果

抄録

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.

本文言語English
ホスト出版物のタイトル2012 IEEE Consumer Communications and Networking Conference, CCNC'2012
ページ356-357
ページ数2
DOI
出版ステータスPublished - 2012
外部発表はい
イベント2012 IEEE Consumer Communications and Networking Conference, CCNC'2012 - Las Vegas, NV, United States
継続期間: 2012 1 142012 1 17

出版物シリーズ

名前2012 IEEE Consumer Communications and Networking Conference, CCNC'2012

Other

Other2012 IEEE Consumer Communications and Networking Conference, CCNC'2012
国/地域United States
CityLas Vegas, NV
Period12/1/1412/1/17

ASJC Scopus subject areas

  • コンピュータ ネットワークおよび通信
  • 電子工学および電気工学

フィンガープリント

「A heuristic solution for N-node bandwidth barter mechanism」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル