WEKO3
-
RootNode
アイテム
Incremental Distributed Construction Method of Delaunay Overlay Network on Detour Overlay Paths
https://ipsj.ixsq.nii.ac.jp/records/90287
https://ipsj.ixsq.nii.ac.jp/records/9028748b73daf-8c05-414a-8cf6-11caf6e9418d
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5402027 (1.6 MB)
|
Copyright (c) 2013 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2013-02-15 | |||||||||||
| タイトル | ||||||||||||
| タイトル | Incremental Distributed Construction Method of Delaunay Overlay Network on Detour Overlay Paths | |||||||||||
| タイトル | ||||||||||||
| 言語 | en | |||||||||||
| タイトル | Incremental Distributed Construction Method of Delaunay Overlay Network on Detour Overlay Paths | |||||||||||
| 言語 | ||||||||||||
| 言語 | eng | |||||||||||
| キーワード | ||||||||||||
| 主題Scheme | Other | |||||||||||
| 主題 | [特集：ネットワークサービスと分散処理] delaunay overlay network, structured overlays, geometric routing, ad-hoc networks, computational geometry | |||||||||||
| 資源タイプ | ||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||
| 資源タイプ | journal article | |||||||||||
| 著者所属 | ||||||||||||
| National institute of Information and Communications Technology | ||||||||||||
| 著者所属 | ||||||||||||
| National institute of Information and Communications Technology | ||||||||||||
| 著者所属 | ||||||||||||
| National institute of Information and Communications Technology | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| National institute of Information and Communications Technology | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| National institute of Information and Communications Technology | ||||||||||||
| 著者所属(英) | ||||||||||||
| en | ||||||||||||
| National institute of Information and Communications Technology | ||||||||||||
| 著者名 |
Masaaki, Ohnishi
× Masaaki, Ohnishi
× Masugi, Inoue
× Hiroaki, Harai
|
|||||||||||
| 著者名(英) |
Masaaki, Ohnishi
× Masaaki, Ohnishi
× Masugi, Inoue
× Hiroaki, Harai
|
|||||||||||
| 論文抄録 | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | In wide-area disaster situations, wireless mesh networks lose data communication reachability among arbitrary pairs of base stations due to the loss of routing information propagation and synchronization. This paper uses a Delaunay overlay approach to propose a distributed networking method in which detour overlay paths are incrementally added to a wireless mesh network in wide-area disaster situations. For this purpose, the following functions are added to each base station for wireless multi-hop communication: obtaining the spatial location, exchanging spatial location messages between base stations, transferring data based on spatial locations of base stations. The proposed method always constructs a Delaunay overlay network with detour paths on the condition that a set of wireless links provides a connected graph even if it does not initially provide reachability among arbitrary base stations in the connected graph. This is different from the previous method that assumes a connected graph and reachability. This paper therefore also shows a new convergence principle and implementation guidelines that do not interfere with the existing convergence principle. A simulation is then used to evaluate the detour length and table size of the proposed method. It shows that the proposed method has scalability. This scalability provides adaptable low-link quality and increases the number of nodes in wide-area disaster situations. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.21(2013) No.2 (online) DOI http://dx.doi.org/10.2197/ipsjjip.21.216 ------------------------------ |
|||||||||||
| 論文抄録(英) | ||||||||||||
| 内容記述タイプ | Other | |||||||||||
| 内容記述 | In wide-area disaster situations, wireless mesh networks lose data communication reachability among arbitrary pairs of base stations due to the loss of routing information propagation and synchronization. This paper uses a Delaunay overlay approach to propose a distributed networking method in which detour overlay paths are incrementally added to a wireless mesh network in wide-area disaster situations. For this purpose, the following functions are added to each base station for wireless multi-hop communication: obtaining the spatial location, exchanging spatial location messages between base stations, transferring data based on spatial locations of base stations. The proposed method always constructs a Delaunay overlay network with detour paths on the condition that a set of wireless links provides a connected graph even if it does not initially provide reachability among arbitrary base stations in the connected graph. This is different from the previous method that assumes a connected graph and reachability. This paper therefore also shows a new convergence principle and implementation guidelines that do not interfere with the existing convergence principle. A simulation is then used to evaluate the detour length and table size of the proposed method. It shows that the proposed method has scalability. This scalability provides adaptable low-link quality and increases the number of nodes in wide-area disaster situations. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.21(2013) No.2 (online) DOI http://dx.doi.org/10.2197/ipsjjip.21.216 ------------------------------ |
|||||||||||
| 書誌レコードID | ||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||
| 収録物識別子 | AN00116647 | |||||||||||
| 書誌情報 |
情報処理学会論文誌 巻 54, 号 2, 発行日 2013-02-15 |
|||||||||||
| ISSN | ||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||
| 収録物識別子 | 1882-7764 | |||||||||||
