Self-Estimation of Neighborhood Distribution for Mobile Wireless Nodes
スポンサーリンク
概要
- 論文の詳細を見る
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.
著者
-
Higashino Teruo
Graduate School Of Information Science And Technology Osaka University
-
Sakai Yuki
Graduate School Of Computer Science And Systems Engineering Kyushu Institute Of Technology
-
Uchiyama Akira
Graduate School Of Health And Sports Sciences Chukyo University
-
Yamaguchi Hirozumi
Graduate School Of Juformation Scieuce And Technology Osaka University:japan Science Technology And
-
Uchiyama Akira
Graduate School of Information Science and Technology, Osaka University
-
Sakai Yuki
Graduate School of Information Science and Technology, Osaka University
-
Yamaguchi Hirozumi
Graduate School of Information Science and Technology, Osaka University
関連論文
- A Contact-based Hybrid Routing Protocol for Mobile Ad Hoc Networks
- Impact of Censoring on Estimation of Flow Duration Distribution and Its Mitigation Using Kaplan-Meier-Based Method
- A WDS Clustering Algorithm for Wireless Mesh Networks
- An Optical-Drop Wavelength Assignment Algorithm for Efficient Wavelength Reuse under Heterogeneous Traffic in WDM Ring Networks(Discrete Mathematics and Its Applications)
- A Minimum Dead Space Algorithm for Generalized Isochronous Channel Reuse Problems in DQDB Networks(Network)
- P2PMM_router : A Two-Stage Heuristic Algorithm to Peer-to-Peer Multicast Routing Problems in Multihome Networks(Discrete Mathematics and Its Applications)
- A Proposal of Test Sequence Generation Method for Communication Protocols Using SAT Algorithm
- Double Depth First Search Based Parametric Analysis for Parametric Time-Interval Automata(Concurrent/Hybrid Systems : Theory and Applications)
- Association of hypertension with changes in the body mass index of university students
- A Proposal of Improved Lip Contour Extraction Method Using Deformable Template Matching and Its Application to Dental Treatment
- Performance evaluation of vital-sign collection mechanism using wireless sensor device (モバイルマルチメディア通信)
- An Efficient Overlay Multicast Protocol for Heterogeneous Users(Selected Papers from ICMU 2005(Second International Conference on Mobile Computing and Ubiquitous Networking))
- Affinity Purification of α-Amylases Using 0.19 α-Amylase Inhibitor from Wheat Kernel
- Self-Estimation of Neighborhood Distribution for Mobile Wireless Nodes
- Self-Estimation of Neighborhood Distribution for Mobile Wireless Nodes
- An Efficient Overlay Multicast Protocol for Heterogeneous Users
- MECHANISM OF SEISMIC RESPONSE OF A PC CABLE-STAYED BRIDGE SUBJECTED TO A LONG-PERIOD SEISMIC EXCITATION