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

  • Yingjie Li
  • Ming-Tsan Liu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3391)


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.


Node Mobility Source Node Data Item Communication Cost Minimum Span Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hara, T.: Effective replica allocation in ad hoc networks for improving data accessibility. In: Proc. of IEEE INFOCOM, pp. 1568–1576 (2001)Google Scholar
  2. 2.
    Wang, K., Li, B.: Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks. In: Proc. of IEEE INFOCOM, pp. 1089–1098 (2002)Google Scholar
  3. 3.
    Karumanchi, G., Muralidharan, S., Prakash, R.: Information dissemination in partitionable mobile ad hoc networks. In: Proc. of IEEE Symposium on Reliable Distributed Systems, pp. 4–13 (1999)Google Scholar
  4. 4.
    Cheng, L.: Service advertisement and discovery in mobile ad hoc networks. In: Workshop on Ad hoc Communications and Collaboration in Ubiquitous Computing Environments (2002)Google Scholar
  5. 5.
    Shenker, S., Ratnasamy, S., Karp, B., Estrin, D., Govindan, R.: Data-centric storage in sensornets. ACM SIGCOMM Computer Communication Review 33, 137–142 (2003)CrossRefGoogle Scholar
  6. 6.
    Karp, B., Kung, H.T.: Greedy perimeter stateless routing. In: Proc. of ACM MOBICOM, pp. 243–254 (2000)Google Scholar
  7. 7.
    Kempe, D., Kleinberg, J.M., Demers, A.J.: Spatial gossip and resource location protocols. In: ACM Symposium on Theory of Computing, pp. 163–172 (2001)Google Scholar
  8. 8.
    USNO GPS operations (2001),
  9. 9.
    Sailhan, F., Issarny, V.: Cooperative caching in ad hoc networks. In: Chen, M.-S., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds.) MDM 2003. LNCS, vol. 2574, pp. 13–28. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Li, J., Jannotti, J., DeCouto, D., Karger, D., Morris, R.: A scalable location service for geographic ad hoc routing. In: Proc. of ACM MOBICOM, pp. 120–130 (2000)Google Scholar

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