Location-centric storage and query in wireless sensor networks

  • Authors:

  • Kai Xing;Xiuzhen Cheng;Jiang Li;Min Song

  • Affiliations:

  • Computer Science, The George Washington University, Washington, USA 20052;Computer Science, The George Washington University, Washington, USA 20052;Systems & Computer Science, Howard University, Washington, USA 20059;Electrical & Computer Engineering, Old Dominion University, Norfolk, USA 23529

  • Venue:
  • Wireless Networks
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Location-centric storage (LCS) is envisioned as a promising scheme for robust and user-friendly on-demand data storage in networking environments such as the roadway sensor networks [Xing K et al. J Parallel Distributed Comput 67:336---345, 2007; Xing K et al. in: IEEE wireless communication and networking conference (WCNC), 2005]. In this paper, we analyze the performance of LCS in terms of storage and query overheads. This study indicates that LCS utilizes network resource efficiently and achieves good scalability. In particular, the storage overhead of sensors is independent of the network size, and is evenly distributed across the network. We also propose two algorithms for data retrieval in LCS-enabled one-dimensional and two-dimensional sensor networks. Our algorithms guarantee that acquiring the stored data of any event only takes a small number of communication hops to query a small number of sensors.