Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Scalable Fault-Tolerant Aggregation in Large Process Groups
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Urban multi-hop broadcast protocol for inter-vehicle communication systems
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
Sextant: a unified node and event localization framework using non-convex constraints
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Localization in sparse networks using sweeps
Proceedings of the 12th annual international conference on Mobile computing and networking
Probabilistic aggregation for data dissemination in VANETs
Proceedings of the fourth ACM international workshop on Vehicular ad hoc networks
Rendered path: range-free localization in anisotropic sensor networks with holes
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Catch-up: a data aggregation scheme for vanets
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
CME: A Contour Mapping Engine in Wireless Sensor Networks
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Hi-index | 0.00 |
In this paper, we propose a method to estimate the density of nodes for pedestrians and/or vehicles with information terminals. The method enables us to provide intelligent services which are environment-aware with highly dynamic movement of nodes such as intellectual navigation that tells the user the best route to detour 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. Also by estimating the change of the density, taking into account the movement characteristics of nodes, the density map is updated in a timely fashion. The simulation experiments have been conducted and the results have shown the accuracy of the estimated density maps.