2007 | OriginalPaper | Buchkapitel
Distance-Based Bloom Filter for an Efficient Search in Mobile Ad Hoc Networks
verfasst von : Byungryong Kim, Kichang Kim
Erschienen in: Human Interface and the Management of Information. Methods, Techniques and Tools in Information Design
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.