Distance-Based Bloom Filter for an Efficient Search in Mobile Ad Hoc Networks

详细信息    查看全文

• 作者：Byungryong Kim ; Kichang Kim
• 刊名：Lecture Notes in Computer Science
• 出版年：2007
• 出版时间：2007
• 年：2007
• 卷：4557
• 期：1
• 页码：471-479
• 全文大小：216 KB
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349

文摘

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.