scispace - formally typeset
Search or ask a question
Topic

Destination-Sequenced Distance Vector routing

About: Destination-Sequenced Distance Vector routing is a research topic. Over the lifetime, 20341 publications have been published within this topic receiving 490663 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm, DUAL, and an Ideal Link-state Algorithm.
Abstract: We present the Wireless Routing Protocol (WRP). In WRP, routing nodes communicate the distance and second-to-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford Algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an Ideal Link-state Algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.

1,452 citations

Journal ArticleDOI
TL;DR: A shortest cost path routing algorithm is proposed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes and is amenable to distributed implementation.
Abstract: A routing problem in static wireless ad hoc networks is considered as it arises in a rapidly deployed, sensor based, monitoring system known as the wireless sensor network. Information obtained by the monitoring nodes needs to be routed to a set of designated gateway nodes. In these networks, every node is capable of sensing, data processing, and communication, and operates on its limited amount of battery energy consumed mostly in transmission and reception at its radio transceiver. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver then the energy consumption rate per unit information transmission depends on the choice of the next hop node, i.e., the routing decision. We formulate the routing problem as a linear programming problem, where the objective is to maximize the network lifetime, which is equivalent to the time until the network partition due to battery outage. Two different models are considered for the information-generation processes. One assumes constant rates and the other assumes an arbitrary process. A shortest cost path routing algorithm is proposed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. The algorithm is amenable to distributed implementation. Simulation results with both information-generation process models show that the proposed algorithm can achieve network lifetime that is very close to the optimal network lifetime obtained by solving the linear programming problem.

1,375 citations

Proceedings ArticleDOI
11 Jun 2001
TL;DR: This work proposes an on-demand routing scheme called split multipath routing (SMR) that establishes and utilizes multiple routes of maximally disjoint paths and uses a per-packet allocation scheme to distribute data packets into multiple paths of active sessions.
Abstract: In recent years, routing has been the most focused area in ad hoc networks research On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency Most proposed on-demand routing protocols however, build and rely on a single route for each data session Whenever there is a link disconnection on the active route, the routing protocol must perform a route recovery process In QoS routing for wired networks, multiple path routing is popularly used Multiple routes are however, constructed using link-state or distance vector algorithms which are not well-suited for ad hoc networks We propose an on-demand routing scheme called split multipath routing (SMR) that establishes and utilizes multiple routes of maximally disjoint paths Providing multiple routes helps minimizing route recovery process and control message overhead Our protocol uses a per-packet allocation scheme to distribute data packets into multiple paths of active sessions This traffic distribution efficiently utilizes available network resources and prevents nodes of the route from being congested in heavily loaded traffic situations We evaluate the performance of our scheme using extensive simulation

1,325 citations

Journal ArticleDOI
TL;DR: The properties of direct networks are reviewed, and the operation and characteristics of wormhole routing are discussed in detail, along with a technique that allows multiple virtual channels to share the same physical channel.
Abstract: Several research contributions and commercial ventures related to wormhole routing, a switching technique used in direct networks, are discussed. The properties of direct networks are reviewed, and the operation and characteristics of wormhole routing are discussed in detail. By its nature, wormhole routing is particularly susceptible to deadlock situations, in which two or more packets may block one another indefinitely. Several approaches to deadlock-free. routing, along with a technique that allows multiple virtual channels to share the same physical channel, are described. In addition, several open issues related to wormhole routing are discussed. >

1,307 citations

Journal ArticleDOI
TL;DR: A unified heuristic which is able to solve five different variants of the vehicle routing problem and shown promising results for a large class of vehicle routing problems with backhauls as demonstrated in Ropke and Pisinger.

1,282 citations


Network Information
Related Topics (5)
Wireless ad hoc network
49K papers, 1.1M citations
94% related
Wireless sensor network
142K papers, 2.4M citations
94% related
Key distribution in wireless sensor networks
59.2K papers, 1.2M citations
93% related
Wireless network
122.5K papers, 2.1M citations
93% related
Network packet
159.7K papers, 2.2M citations
93% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202347
2022119
202146
202062
201968
2018141