GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
ACM SIGCOMM Computer Communication Review
Updated data dissemination methods for updating old replicas in ad hoc networks
Personal and Ubiquitous Computing
A replica distrubution scheme for location-dependent information on vehicular ad hoc networks
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Double rulings for information brokerage in sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Road Network Based Adaptive Query Evaluation in VANET
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
Information discovery in mission-critical wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Continuous Location Dependent Queries in Mobile Wireless Sensor Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Storing data on sensor nodes at a specified location is a useful technique for data-centric storage and management of location dependent data on wireless sensor networks. To decrease the cost of accessing these data, arranging replicas of data so that the distance between the consumer nodes and replica holder nodes decreases is desirable. Conventional schemes, however, are costly for updating the replicas even if they are not often used or do not support functions for ensuring their consistency. We propose a novel replica arrangement scheme, which adaptively arranges replicas at positions close to nodes for frequent sending of queries. Instead of arranging many replicas on sensor nodes, our scheme consists of nodes with pointers that point to the replica holder nodes in order to save storage for replicas. The pointers, which are smaller than replicas, are arranged so that nodes are in circular arcs surrounding the location where the original data item is associated. Simulation results show that our scheme outperforms conventional replica arrangement schemes in terms of the cost required for sending queries and replies with sufficiently low replica update cost.