نتایج جستجو برای: query forwarding
تعداد نتایج: 63062 فیلتر نتایج به سال:
A quasi-optimal query propagation algorithm Bi-Filtered Forwarding (BFF) for quickly routing a query throughout a wireless sensor network is proposed in this paper. BFF is implemented in a limited flooding manner for guaranteeing quick query propagation and low message consumption in wireless sensor networks. The experimental results show that in comparison with the flooding algorithm, BFF can ...
Location-based routing protocols are stateless since they rely on position information in forwarding decisions. However, their efficiency depends on performance of location services which provide the position information of the desired destination node. Although several location service schemes have been proposed, their main goal is merely to find the location of the destination node. Seldom th...
SUMMARY When referring to genes, authors often use synonyms instead of the official gene symbols. In order to accurately retrieve as many relevant documents as possible, we have developed GeneE, a web application that expands a gene query to include all known synonyms, and adds disambiguation information for ambiguous terms, before forwarding the query to either PubMed, Google or Jane. The quer...
We propose an auxiliary strategy, called per-user forwarding, for locating users who move from place to place while using Personal Communications Services (PCS). The forwarding strategy augments the basic location strategy proposed in existing standards such as GSM and IS-41, with the objective of reducing network signalling and database loads in exchange for increased CPU processing and memory...
Many services have recently been offered based on a peer-to-peer (P2P) communication model. The robustness of the P2P network against frequent peer failure must be considered. Replication of the content is one of the most useful techniques to increase robustness. However, the overall effectiveness of replication is heavily dependent on the topology of the logical network. As topology of network...
In this paper we present the main features of the H-LINK semantic routing mechanism we are developing to combine ontology-based peer contexts and ontology matching techniques for providing P2P query forwarding on a real semantic basis. H-LINK defines a semantic overlay network where each edge represents a semantic link between two peers having similar contexts. Semantic links are exploited to a...
Location tracking operations in a personal communications services (PCS’s) network are expensive. A location tracking algorithm called pointer forwarding has been proposed to reduce the location update cost. The key observation behind forwarding is that if users change PCS registration areas (RA’s) frequently, but receive calls relatively infrequently, it should be possible to avoid registratio...
DHT based peer to peer network system is a general range of query scheme. These schemes can support the range of query without modifying the underlying DHTs and they cannot guarantee to return the query results with bounded delay. The query delay in these schemes depends on both the scale of the system and the size of the query space. This paper, proposed Armada, an efficient range of query pro...
Efficient search is a challenging task in unstructured peer-to-peer networks. In this paper, Knowledge and Cache based Adaptive Query Searching (KCAQS) is proposed that adaptively performs a query searching through either directed flooding or biased random walk based on the number of hop counts in query message. In addition, knowledge intended forwarding is deployed for forwarding a query to th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید