A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
A directionality based location discovery scheme for wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Zone sharing: a hot-spots decomposition scheme for data-centric storage in sensor networks
DMSN '05 Proceedings of the 2nd international workshop on Data management for sensor networks
Model-driven data acquisition in sensor networks
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Dynamic random replication for data centric storage
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
A power-saving data storage scheme for wireless sensor networks
Journal of Network and Computer Applications
Computers and Electrical Engineering
STARR-DCS: Spatio-temporal adaptation of random replication for data-centric storage
ACM Transactions on Sensor Networks (TOSN)
Hi-index | 0.00 |
In many data-centric storage techniques, each event corresponds to a hashing location by event type. However, most of them fail to deal with storage memory space due to high percentage of the load is assigned to a relatively small portion of the sensor nodes. Hence, these nodes may fail to deal with the storage of the sensor nodes effectively. To solve the problem, we propose a grid-based dynamic load balancing approach for data-centric storage in sensor networks that relies on two schemes: (1) a cover-up scheme to deal with a problem of a storage node whose memory space is depleted. This scheme can adjust the number of storage nodes dynamically; (2) the multi-threshold levels to achieve load balancing in each grid and all nodes get load balancing. Simulations have shown that our scheme can enhance the quality of data and avoid hotspot of the storage while there are a vast number of the events in a sensor network.