Abstract
In this paper we address the problem of efficiently routing queries among peers in a mobile ad-hoc network. Peers possess a local database and can pose queries to other peers, forming a distributed peer database application. In contrast to traditional networking, routing a query involves its delivery to as many as possible peers that are relevant to the query while at the same time minimizing the number of non-relevant peers involved in the process, therefore economizing on the limited network resources. To tackle this problem, we propose two novel protocols, namely TDP-ECT and CTPD-ECT. The new protocols utilize dominant pruning to distribute queries while at the same time incorporate application layer specifics in order to minimize the cost of routing. The proposed protocols are evaluated through extensive simulations and are proved suitable for wireless mobile environments.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
