Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICDE.2007.367884
Title: Clustering wavelets to speed-up data dissemination in structured P2P MANETs
Authors: Lupu, M.
Li, J.
Ooi, B.C. 
Shi, S.
Issue Date: 2007
Source: Lupu, M.,Li, J.,Ooi, B.C.,Shi, S. (2007). Clustering wavelets to speed-up data dissemination in structured P2P MANETs. Proceedings - International Conference on Data Engineering : 386-395. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2007.367884
Abstract: This paper introduces a fast data dissemination method for structured peer-to-peer networks. The work is motivated on one side by the increase in non-volatile memory available on mobile devices and, on the other side, by observed behavioral patterns of the users. We envision a scenario where users come together for short periods of time (e.g. public transport, conference sessions) and wish to be able to share large collections of data. With hundreds and even thousands of data items stored on small devices, content publication is simply too energy and time consuming. By indexing summary information obtained by a combination of multi-resolution analysis and k-means, our method (Hyper-M) is able to cut down the overall construction time of an overlay network such as CAN by an order of magnitude, as well as provide fast approximate similarity search on such a network. The results of our extensive experimental studies confirm that Hyper-M is both energy and time efficient, and provides good precision and recall. © 2007 IEEE.
Source Title: Proceedings - International Conference on Data Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/42009
ISBN: 1424408032
ISSN: 10844627
DOI: 10.1109/ICDE.2007.367884
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

7
checked on Dec 11, 2017

Page view(s)

50
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


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