SDSR: A Scalable Data Storage and Retrieval Service for Wireless Ad Hoc Networks

  • Yingjie Li
  • Ming-Tsan Liu
Conference paper

DOI: 10.1007/978-3-540-30582-8_52

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3391)
Cite this paper as:
Li Y., Liu MT. (2005) SDSR: A Scalable Data Storage and Retrieval Service for Wireless Ad Hoc Networks. In: Kim C. (eds) Information Networking. Convergence in Broadband and Mobile Networking. ICOIN 2005. Lecture Notes in Computer Science, vol 3391. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yingjie Li
    • 1
  • Ming-Tsan Liu
    • 1
  1. 1.Computer Science & Engineering DepartmentThe Ohio State UniversityColumbusUSA

Personalised recommendations