Abstract
This study proposes a keyword search technique to reduce the traffic caused when applying Distributed Hash Table(DHT) base P2P systems as middleware for ubiquitous computing application in order to ensure effective search in Mobile Ad-hoc Network (MANET). For query with many keywords, nodes should be visited as much as the number of keywords and many posting files(inverted list) should be sent to the next node and these posting files bring about traffic. To solve this problem firstly the size of inverted list nothing to do with search result was diminished using distance of the hash values obtained by hashing keywords within document; secondly the positive false rate of bloom filter can be lowered since the size of posting file to be hashed can be reduced through distance-based bloom filter technique and by doing this the size of inverted list to be sent can be reduced as well. This technique is based on Plaxton’s approach and the proposed technique was evaluated through a series of tests.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Gnutella. http://gnutella.wego.com
The Gnutella Protocol Specification v0.41 Document Revision 1.2. http://rfc-gnutella.sourceforge.net/developer/stable/index.html/
KaZaA media dekstop, http://www.kazaa.com/.
Stoica, I., Morris, R., Karger, D.R., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. Proc. of the ACM SIGCOMM, pp. 149–160 (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM 2001 (2001)
Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed object location in a dynamic network. In: Proc. of the 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), August 2002, ACM Press, New York (2002)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Reynolds, P., Vahdat, A.: Efficient Peer-to-Peer Keyword Searching. In: Endler, M., Schmidt, D.C. (eds.) Middleware 2003. LNCS, vol. 2672, Springer, Heidelberg (2003)
Broder, A., Mitzenmacher, M.: Network Applications of Bloom Filters: A Survey. In: Proc. of the 40th Annual Allerton Conference on Communication, Control, and Computing, pp. 636–646 (2002)
Dillinger, P.C., Manolios, P.: Bloom Filters in Probabilistic Verification. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, Springer, Heidelberg (2004)
Dillinger, P.C., Manolios, P.: Fast and Accurate Bitstate Verification for SPIN. In: Graf, S., Mounier, L. (eds.) Model Checking Software. LNCS, vol. 2989, pp. 57–75. Springer, Heidelberg (2004)
Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 311–320 (1997)
Shi, S., Yang, G., Wang, D., Yu, J., Qu, S., Chen, M.: Making peer-to-peer keyword searching feasible using multi-level partitioning. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, p. 2. Springer, Heidelberg (2005)
Liu, L., Ryu, K.D., Lee, K.-W.: Keyword fusion to support efficient keyword-based search in peer-to-peer file sharing. In: CCGRID 2004, pp. 269–276 (2004)
Chou, J.C.Y., Huang, T.-Y., Huang, K.-L., Chen, T.-Y.: SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol, pp. 419–433
Gnawali, O.D.: A Keyword-Set Search System for Peer-to-Peer Networks, Master’s Thesis, Department of Computer Science, Massachusetts Institute of Technology (June 2002)
Liang, Z., Fu-tai, Z., Fan-yuan, M.: KRBKSS: A Keyword Relationship Based Keyword-set Search System for Peer-to-peer Networks, Journal of Zhejiang University Science, 6A(6) (2005)
Gulati, A., Ranjan, S.: Efficient Keyword Search using Multicast Trees in Structured p2p Networks. Middleware, 2005 (submitted)
Tang, C., Mahalingam, M., Xu, Z.: psearch: Information retrieval in structured overlays (October 20, 2002)
Tang, C., Dwarkadas, S.: Hybrid Global-Local Indexing for Efficient Peer-to-Peer Information Retrieval. In: Proceedings of the Symposium on Networked Systems Design and Implementation (NSDI) (June 2004)
The Chord Simulator, http://pdos.csail.mit.edu/chord/sim.html and http://cvs.pdos.csail.mit.edu/cvs/~checkout~sfsnet/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, B., Kim, K. (2007). Distance-Based Bloom Filter for an Efficient Search in Mobile Ad Hoc Networks. In: Smith, M.J., Salvendy, G. (eds) Human Interface and the Management of Information. Methods, Techniques and Tools in Information Design. Human Interface 2007. Lecture Notes in Computer Science, vol 4557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73345-4_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-73345-4_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73344-7
Online ISBN: 978-3-540-73345-4
eBook Packages: Computer ScienceComputer Science (R0)