WEKO3
-
RootNode
アイテム
Characterization of Minimum Route MTM in One-Dimensional Multi-Hop Wireless Networks
http://hdl.handle.net/10191/22380
http://hdl.handle.net/10191/22380a056dd47-20ae-45da-9701-3b11c2c6e4c1
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
E92-A_9_2227-2235.pdf (999.9 kB)
|
|
| Item type | 学術雑誌論文 / Journal Article(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2013-05-17 | |||||
| タイトル | ||||||
| タイトル | Characterization of Minimum Route MTM in One-Dimensional Multi-Hop Wireless Networks | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | eng | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | multi-hop wireless networks | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | medium time metric | |||||
| キーワード | ||||||
| 主題Scheme | Other | |||||
| 主題 | theoretical analysis | |||||
| 資源タイプ | ||||||
| 資源 | http://purl.org/coar/resource_type/c_6501 | |||||
| タイプ | journal article | |||||
| 著者 |
Miyakita, Kazuyuki
× Miyakita, Kazuyuki× Nakano, Keisuke× Sengoku, Masakazu× Shinoda, Shoji |
|||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | In multi-hop wireless networks, since source and destination nodes usually have some candidate paths between them, communication quality depends on the selection of a path from these candidates. For network design, characterizing the best path is important. To do this, in [1], [2] we used expected transmission count (ETX) as a metric of communication quality and showed that the best path for ETX is modeled by a path that consists of links whose lengths are close to each other in static one-dimensional multi-hop networks with a condition that the ETX function of a link is a convex monotonically increasing function. By using the results of this characterization, a minimum route ETX can be approximately computed in a one-dimensional random network. However, other metrics fail to satisfy the above condition, like medium time metric (MTM). In this paper, we use MTM as a metric of communication quality and show that we cannot directly apply the results of to the characterization of the best path for MTM and the computation of minimum route MTM. In this paper, we characterize the path that minimizes route MTM in a different manner from [1] [2] and propose a new approximate method suitable for the computation of minimum route MTM. | |||||
| 言語 | en | |||||
| 書誌情報 |
en : IEICE transactions on fundamentals of electronics, communications and computer sciences 巻 E92-A, 号 9, p. 2227-2235, 発行日 2009-09 |
|||||
| 出版者 | ||||||
| 出版者 | 電子情報通信学会 | |||||
| 言語 | ja | |||||
| ISSN | ||||||
| 収録物識別子タイプ | ISSN | |||||
| 収録物識別子 | 0916-8508 | |||||
| 書誌レコードID | ||||||
| 収録物識別子タイプ | NCID | |||||
| 収録物識別子 | AA10826239 | |||||
| DOI | ||||||
| 識別子タイプ | DOI | |||||
| 関連識別子 | http://doi.org/10.1587/transfun.e92.a.2227 | |||||
| 権利 | ||||||
| 権利情報 | copyright(C)2009 IEICE | |||||
| 出版タイプ | ||||||
| 出版タイプ | VoR | |||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
| 著者版フラグ | ||||||
| 値 | publisher | |||||
| 異版である | ||||||
| 関連タイプ | isVersionOf | |||||
| 識別子タイプ | URI | |||||
| 関連識別子 | http://www.ieice.org/jpn/trans_online/ | |||||
