A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is
2010 IEEE Globecom Workshops
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 networkdoi:10.1109/glocomw.2010.5700106 fatcat:nq7ysiz7crd63md5itnacjyolq