WEKO3
アイテム
Self-Estimation of Neighborhood Distribution for Mobile Wireless Nodes
https://ipsj.ixsq.nii.ac.jp/records/90282
https://ipsj.ixsq.nii.ac.jp/records/90282cc19c265-9797-45bc-b10a-1fa4e3afd5d6
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5402022 (1.3 MB)
|
Copyright (c) 2013 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2013-02-15 | |||||||||||||
| タイトル | ||||||||||||||
| タイトル | Self-Estimation of Neighborhood Distribution for Mobile Wireless Nodes | |||||||||||||
| タイトル | ||||||||||||||
| 言語 | en | |||||||||||||
| タイトル | Self-Estimation of Neighborhood Distribution for Mobile Wireless Nodes | |||||||||||||
| 言語 | ||||||||||||||
| 言語 | eng | |||||||||||||
| キーワード | ||||||||||||||
| 主題Scheme | Other | |||||||||||||
| 主題 | [特集：ネットワークサービスと分散処理] portable terminals, location based services, mobile applications, adhoc networks | |||||||||||||
| 資源タイプ | ||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||
| 資源タイプ | journal article | |||||||||||||
| 著者所属 | ||||||||||||||
| Graduate School of Information Science and Technology, Osaka University | ||||||||||||||
| 著者所属 | ||||||||||||||
| Graduate School of Information Science and Technology, Osaka University／Japan Science Technology and Agency, CREST | ||||||||||||||
| 著者所属 | ||||||||||||||
| Graduate School of Information Science and Technology, Osaka University／Japan Science Technology and Agency, CREST | ||||||||||||||
| 著者所属 | ||||||||||||||
| Graduate School of Information Science and Technology, Osaka University／Japan Science Technology and Agency, CREST | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| Graduate School of Information Science and Technology, Osaka University | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| Graduate School of Information Science and Technology, Osaka University / Japan Science Technology and Agency, CREST | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| Graduate School of Information Science and Technology, Osaka University / Japan Science Technology and Agency, CREST | ||||||||||||||
| 著者所属(英) | ||||||||||||||
| en | ||||||||||||||
| Graduate School of Information Science and Technology, Osaka University / Japan Science Technology and Agency, CREST | ||||||||||||||
| 著者名 |
Yuki, Sakai
× Yuki, Sakai
× Akira, Uchiyama
× Hirozumi, Yamaguchi
× Teruo, Higashino
|
|||||||||||||
| 著者名(英) |
Yuki, Sakai
× Yuki, Sakai
× Akira, Uchiyama
× Hirozumi, Yamaguchi
× Teruo, Higashino
|
|||||||||||||
| 論文抄録 | ||||||||||||||
| 内容記述タイプ | Other | |||||||||||||
| 内容記述 | In this paper, we propose a method to estimate the node distribution for pedestrians with information terminals. The method enables us to provide situation-aware services such as intellectual navigation that tells the user the best route to go around congested regions. In the proposed method, each node is supposed to know its location roughly (i.e., within some error range) and to maintain a density map covering its surroundings. This map is updated when a node receives a density map from a neighboring node. Each node also updates the density map in a timely fashion by estimating the change of the density due to node mobility. Node distribution is obtained from the density map by choosing cells with the highest density in a greedy fashion. The simulation experiments have been conducted and the results have shown that the proposed method could keep average position errors less than 10m. ------------------------------ 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.198 ------------------------------ |
|||||||||||||
| 論文抄録(英) | ||||||||||||||
| 内容記述タイプ | Other | |||||||||||||
| 内容記述 | In this paper, we propose a method to estimate the node distribution for pedestrians with information terminals. The method enables us to provide situation-aware services such as intellectual navigation that tells the user the best route to go around congested regions. In the proposed method, each node is supposed to know its location roughly (i.e., within some error range) and to maintain a density map covering its surroundings. This map is updated when a node receives a density map from a neighboring node. Each node also updates the density map in a timely fashion by estimating the change of the density due to node mobility. Node distribution is obtained from the density map by choosing cells with the highest density in a greedy fashion. The simulation experiments have been conducted and the results have shown that the proposed method could keep average position errors less than 10m. ------------------------------ 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.198 ------------------------------ |
|||||||||||||
| 書誌レコードID | ||||||||||||||
| 収録物識別子タイプ | NCID | |||||||||||||
| 収録物識別子 | AN00116647 | |||||||||||||
| 書誌情報 |
情報処理学会論文誌 巻 54, 号 2, 発行日 2013-02-15 |
|||||||||||||
| ISSN | ||||||||||||||
| 収録物識別子タイプ | ISSN | |||||||||||||
| 収録物識別子 | 1882-7764 | |||||||||||||
