WEKO3
アイテム
複数無線通信サービス環境におけるアプリケーション特性とネットワーク指標を考慮した基地局割り当て手法
http://hdl.handle.net/10911/00039384
http://hdl.handle.net/10911/00039384b89ea40d-03f6-4f14-b1cd-3fc87243360b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
sokahogaku_KAMEDA-Eiichi(1).pdf (270.6 kB)
|
.png)
|
|
|
sokahogaku_KAMEDA-Eiichi(2).pdf (188.9 kB)
|
|
|
|
sokahogaku_KAMEDA-Eiichi(3).pdf (1.2 MB)
|
|
| Item type | 学位論文 / Thesis or Dissertation(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2018-04-10 | |||||||||
| タイトル | ||||||||||
| タイトル | 複数無線通信サービス環境におけるアプリケーション特性とネットワーク指標を考慮した基地局割り当て手法 | |||||||||
| 言語 | ja | |||||||||
| タイトル | ||||||||||
| タイトル | Studies on efficient assignment of base stations with considering application characteristics and network indexes in heterogeneous wireless communication services | |||||||||
| 言語 | en | |||||||||
| 言語 | ||||||||||
| 言語 | jpn | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | WiFi Service，Round-Trip Time，Assignment Problem. | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_db06 | |||||||||
| 資源タイプ | doctoral thesis | |||||||||
| アクセス権 | ||||||||||
| アクセス権 | open access | |||||||||
| アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||||||
| 著者 |
亀田, 栄一
× 亀田, 栄一
× KAMEDA, Eiichi
|
|||||||||
| 抄録 | ||||||||||
| 内容記述タイプ | Abstract | |||||||||
| 内容記述 | While the LTE has been in widespread use and the line speed for data communications has also been improved, the exploding data traffic required by evolving applications is thought to increase the utilization factor of public WiFi services from now on. The throughput (TP) and the round trip time (RTT), however, might become longer for reasons of increasing heavy processing load on a public WiFi station or network load. On the other hand, the required TP or RTT are totally dependent on the application which a user is working on. This paper de nes a degree of satisfaction of terminal that is the difference between the required TP or RTT for a user's application and the actual TP or RTT obtained when a mobile terminal gets connected to a station. The paper rstly formulates a problem to assign some mobile terminals with the different communications services by means of graph theory, and it also proposes a method to maximize the degree of satisfaction of terminal in the whole system with considering the required TP or RTT for user's applications based on a connection service determination logic by Hungarian method. |
|||||||||
| 学位名 | ||||||||||
| 学位名 | 博士（工学） | |||||||||
| 学位授与機関 | ||||||||||
| 学位授与機関名 | 創価大学 | |||||||||
| 学位授与年月日 | ||||||||||
| 学位授与年月日 | 2017-09-16 | |||||||||
| 学位授与番号 | ||||||||||
| 学位授与番号 | 甲第150号 | |||||||||
| 著者版フラグ | ||||||||||
| 出版タイプ | VoR | |||||||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||||||
