Please use this identifier to cite or link to this item:
Title: Bouncing tracks in sensor networks
Authors: Li, Z
Xiao, N
Zhao, J
Xiao, B 
Keywords: Bouncing tracks
Data center storage
Issue Date: 2008
Publisher: IEEE
Source: 14th IEEE International Conference on Parallel and Distributed Systems, 2008 : ICPADS '08, 8-10 December 2008, Melbourne, VIC, p. 591-598 How to cite?
Abstract: Recent work in building data-centric sensor networks treats a sensor network as a pool of information. Sensor nodes generate, store, and retrieve information as both data producers and consumers. The intensive demand of data exchange within the network leads previous approaches with sensor-to-sink transmission model inefficient. In-network data storage schemes, such as geographical hash table (GHT) and double-rulings, have been accordingly proposed to structure the information storage among the network so as to facilitate the consumers to efficiently discover and retrieve data. Under those approaches, however, each sensor node needs to publish and retrieve data from different routes calculated every time, introducing unnecessary computation and communication overhead. This paper proposes anew approach that stores and queries data through bouncing tracks. Sensors are able to publish replica of generated data along their bouncing tracks and successfully retrieve data from other sensors along the same tracks, which largely simplifies data exchange and improves efficiency. The strengths of this design also include distance-bounded data retrieval. We conducted extensive simulations and the results show that this approach outperforms existing designs, including rumor routing and double-rulings, in terms of communication efficiency and cost.
ISBN: 978-0-7695-3434-3
ISSN: 1521-9097
DOI: 10.1109/ICPADS.2008.17
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Aug 13, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.