By Topic

Lightweight and Distributed Algorithms for Efficient Data-Centric Storage in Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Al Sukkar, G. ; Inst. Nat. des Telecommun., Evry ; Afifi, H. ; Senouci, S.-M.

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.

Published in:

Mobile and Ubiquitous Systems: Networking & Services, 2007. MobiQuitous 2007. Fourth Annual International Conference on

Date of Conference:

6-10 Aug. 2007