Lightweight and distributed algorithms for efficient data-centric storage in sensor networks

In this paper we propose two algorithms for efficient data-centric storage in wireless sensor networks without the support of any location information system. These algorithms are intended to be applied in environments with large number of sensors where the scalability of the network has great issue. During the first algorithm, each sensor obtains a unique temporary address according to its current relative location in the network. The second algorithm is used to route data from one sensor to another, this routing algorithm only depends on the sensor's neighborhood, i.e. in order to implement the routing table each sensor needs only to exchange local information with its first hop neighbors. The forwarding process used in this algorithm resembles the one found in Pastry peer-to-peer protocol.