SDSR: a scalable data storage and retrieval service for wireless ad hoc networks

Authors:
Yingjie Li;Ming-Tsan Liu
Affiliations:
Computer Science & Engineering Department, The Ohio State University, Columbus, Ohio;Computer Science & Engineering Department, The Ohio State University, Columbus, Ohio
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 6
Cited 0

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
Spatial gossip and resource location protocols

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Cooperative Caching in Ad Hoc Networks

MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Data-centric storage in sensornets

ACM SIGCOMM Computer Communication Review
Information Dissemination in Partitionable Mobile Ad Hoc Networks

SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the framework of SDSR, a Scalable, efficient, robust and load-balanced Data Storage/Retrieval service for large scale wireless ad hoc networks. SDSR hashes each data key to normalized geographical coordinates (x,y), which can be seen as a rendezvous point for storing/retrieving the data in a unit grid. SDSR achieves scalability, robustness and load-balancing by partitioning the network into hierarchical grids of increasing sizes and replicating the data item into each grid. The storage location in each grid is determined by scaling the normalized coordinates to the corresponding grid size. SDSR retrieves a data item in the same way as it stores the data item. We show that in query dominant, large scale wireless ad hoc networks, SDSR performs better than existing schemes in terms of energy efficiency, query latency, hotspot usage, and resilience to clustering failures. It scales well when the network size and the number of queries increase.