A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Computer Networks and Systems: Queueing Theory and Performance Evaluation
Computer Networks and Systems: Queueing Theory and Performance Evaluation
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Proactive Caching for Spatial Queries in Mobile Environments
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Ancile: Pervasively Shared Situational Awareness
IEEE Internet Computing
Collaborative spatial data sharing among mobile lightweight devices
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
GroCoca: group-based peer-to-peer cooperative caching in mobile environment
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
In many scenarios, particularly in military and emergency response operations, mobile nodes that are in close proximity to each other exhibit a high degree of data affinity. For example, all soldiers in the same region, regardless of their specialty, will want to know all nearby threats, as well as all friendly assets. Since relaying queries to a distant server is costly in terms of bandwidth and battery power, it would be ideal to use local resources that are only a hop away. In this paper we propose a shared spatial cache that can be thought of as residing in a region rather than in any given node. Each node that participates in the cache holds an expendable part of the data, so that the loss of any node or small group of nodes can be tolerated with little or no degradation of service. We describe the analytical models that verify our claims and show the results of extensive simulations that validate our models under simulated but realistic conditions.