Data storage placement in sensor networks

  • Authors:
  • Bo Sheng;Qun Li;Weizhen Mao

  • Affiliations:
  • College of William and Mary, Williamsburg, VA;College of William and Mary, Williamsburg, VA;College of William and Mary, Williamsburg, VA

  • Venue:
  • Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data storage has become a important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces storage nodes to store the data collected from the sensors in their proximities. The storage nodes alleviate the heavy load of transmitting all the data to a central place for archiving and reduce the communicatio cost induced by the network query. This paper considers the storage node placement problem aiming to minimize the total energy cost for gathering data to the storage nodes and replying queries. We examine deterministic placement of storage odes and present optimal algorithms based on dy amic programming. Further, we give stochastic analysis for random deployment and conduct simulatio evaluatio for both deterministic and random placements of storage nodes.