KDDCS

We propose an In-Network Data-Centric Storage scheme for answering ad-hoc queries in sensor networks

Mohamed Aly; Kirk Pruhs; Panos K. Chrysanthis

2007

Scholarcy highlights

  • We propose an In-Network Data-Centric Storage scheme for answering ad-hoc queries in sensor networks
  • K-D tree based Data-Centric Storage is composed of a set of distributed algorithms whose running time is within a poly-log factor of the diameter of the network
  • In addition to analytical bounds on KDDCS individual algorithms, we provide experimental evidence of our scheme's general efficiency, as well as its ability to avoid the formation of storage hot-spots of various sizes, unlike all previous INDCS schemes
  • The process may takea few minutes but once it finishes a file will be downloaded on your browser soplease do not close the new tab

Need more features? Save interactive summary cards to your Scholarcy Library.