International Journal of Computer and Communication Technology


The Peer to peer architecture run over internet are widely used in unstructured topology. Random walk based and control flooding resource query algorithms are widely used in peer to peer network. In this paper we consider searching of file in ad hoc network. We propose Enhanced Selective Dynamic Query algorithm. The main aim of this algorithm is to minimize traffic cost and response latency for resource query response. When user want to search a query first history table is referred. If query is present in history table next searching is not required otherwise optimal combination of integer TTL value and set of neighbor for next query round is calculated in network by using knapsack for next query. This algorithm tries to achieve best tradeoff between traffic cost and response latency.





To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.