On the Performance of Location-Centric Storage in Sensor Networks

Abstract

In this paper, we study the performance of location-centric storage (LCS) theoretically. Our results indicate that LCS utilizes network resource efficiently. In particular, the storage load of sensors is independent of the network size, and is evenly distributed across the network. Moreover, the communication distance for getting event information is small. Therefore, the protocol has great scalability. In addition, we also propose algorithms for data retrieval in LCS. Our analysis shows that both the number of queries and the response cost involved in the algorithms could approach to the theoretical lower bound.