Abstract
 An innovative method of accessing connected data sources on the internet is keyword search. We propose to route keywords only relevant in order reduce substantial processing cost search queries throughout all providers. a novel for computing top-k routing plans by considering their propensity contain responses specific query. use summary links between components referencin...

We survey routing problems on xed-connection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, k-relation routing, routing to random destinations , dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems an...

We survey routing problems on xed-connection networks. We consider many aspects of the routing problem and provide known theoretical results for various communication models. We focus on (partial) permutation, k-relation routing, routing to random destinations , dynamic routing, isotonic routing, fault tolerant routing, and related sorting results. We also provide a list of unsolved problems an...

Time-dependent vehicle routing problem (TDVRP) is concerned with vehicle routing optimization in road networks with fluctuant link travel time. Firstly, Time-dependent functions about routing time indicator and routing threat indicator are introduced. Secondly, a time-dependent heuristic function including routing distance indicator, routing time indicator and routing threat indicator is constr...

In this paper, we present the simulation results of the comparative investigation of the performance of the wireless sensor network routing protocols based on different routing objective: energy-aware routing using PROWLER and RMASE. Our simulation results indicate that the energy-aware routing objective increases the network lifetime for the Adaptive Tree, Constrained Flooding and Real-Time ro...

In this paper, a routing protocol which utilizes the characteristics of Bluetooth technology is proposed for Bluetooth-based mobile ad hoc networks. The routing tables are maintained in the master devices and the routing zone radius for each table is adjusted dynamically by using evolving fuzzy neural networks. Observing there exists some useless routing packets which are helpless to build the ...

The design of a routing protocol must be based on the characteristics of its target networks. The diversity of wireless networks motivate the design of different routing metrics, capturing different aspects of wireless communications. The design of routing metrics, however, is not arbitrary since it has a great impact on the proper operation of routing protocols. Combining a wrong type of routi...

One of the notoriously difficult problems in vehicular adhoc networks is to ensure that established paths do not break before the end of data transmission. This is a difficult problem because the network topology is changing constantly and the routing links are inherently unstable due to the high mobility of vehicles. This paper classified the existing routing protocols which are designed for v...

in this paper, an efficient fault-tolerant routing algorithm for mobile ad-hoc networks (manets) is presented. the proposed algorithm increases the network fault-tolerance using natural redundancy of ad-hoc networks. this algorithm is carried out in two stages; 1) the selection of backup nodes 2) the selection of backup route(s). in the first stage, the proposed algorithm chooses nodes with the...

This thesis develops new routing methods for large-scale, packet-switched data networks such as the Internet. The methods developed increase network performance by considering routing approaches that take advantage of more available network resources than do current methods. Two approaches are explored: dynamic metric and multipath routing. Dynamic metric routing provides paths that change dyna...