No abstract

No abstract

Abstract. Both ubiquitous computing and mobile ad-hoc networks (MANET) have recently attracted a lot of attention in the research community as well as the industry. Both the domains share certain similarities, primarily the fact that both are instances of self-organizing decentralized systems. Distributed hash table (DHT) provides a very effective and reliable search scheme in Both Networks. However, when the search involves query consist of a set of common words, it suffers heavy network traffic due to the passing around of a large inverted list among nodes. In this paper, we suggest a technique based on the concept of distance between keywords that can remove irrelevant indices from the list. It utilizes the concept of distance between keywords in the query and removes those entries in the inverted list that are going to be dropped sooner or later. We prove this prediction is accurate and effective such that it reduces the size of the inverted list.

No abstract

No abstract