Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

Perkins, Charles E.; Bhagwat, P.

doi:10.1145/190314.190336

Cited by 3,202 publications

(1,894 citation statements)

References 3 publications

Supporting

Mentioning

1,797

Contrasting

Unclassified

Order By: Relevance

“…The disadvantage of this protocol is that it requires time synchronization which results in more control overhead. Also, its dependency on GPS system makes it unusable when such service is not available [14], [15].…”

Section: E Associativity-based Routing (Abr)mentioning

confidence: 99%

“…The following are some of the most important protocols like CEDAR, ZRP, and ZHLS. [14], [15] Core Extraction Distributed Ad Hoc Routing (CEDAR) protocol [1], [6] establishes a core nodes in the network which is used to transmit packets. The routing establishment uses reactive routing scheme and which performed by core nodes.…”

Section: Hybrid Routing Protocolsmentioning

confidence: 99%

“…If a path is broken between two nodes node n and node u, node n send a notification to the source node, starts re-computation of a route from itself to destination, and drops every subsequent packet that it receives until the re-computation gets completed. Once source node receive the notification, it stops transmitting immediately and starts reinitiating the route establishing from itself to the destination [14], [15] .…”

Section: Hybrid Routing Protocolsmentioning

confidence: 99%

See 2 more Smart Citations

A Survey of Routing Protocols for Ad Hoc Networks Based on Update Mechanism

Alsabah¹,

Al-Sabbag²,

Alzorghani³

2015

IJFCC

View full text Add to dashboard Cite

Abstract-An essential matter for ad hoc networks is routing protocol design which is a major technical challenge due to the mobility of the nodes. Routing problem becomes more complex and challengeable, and it probably is the most addressed and studied problem in ad hoc networks. There are several classifications of Routing protocols are used to perform routing the information from source to destination. Classification methods help researchers and designers to understand distinct characteristics of a routing protocol and find its relationship with others. The main aim of this paper is to explore and to compare the concept of all routing protocol based on update mechanism. This classification divided into Table-Driven (Proactive), On-demand (Reactive), Hybrid routing protocols. Also, the comparison is provided based on the routing mechanism and information used to make routing decisions. Also this paper presents an overview of routing issues in different cases as well as a detailed discussion of and their relative performance. To compare and analyze an ad hoc network routing protocols, appropriate classification methods are important.

show abstract

Section: E Associativity-based Routing (Abr)mentioning

confidence: 99%

Section: Hybrid Routing Protocolsmentioning

confidence: 99%

Section: Hybrid Routing Protocolsmentioning

confidence: 99%

See 1 more Smart Citation

A Survey of Routing Protocols for Ad Hoc Networks Based on Update Mechanism

Alsabah¹,

Al-Sabbag²,

Alzorghani³

2015

IJFCC

View full text Add to dashboard Cite

show abstract

“…In this case, the protocol is considered proactive, which is also known as table driven. Examples of proactive routing protocols include destination sequenced distance vector (DSDV) [8] and OLSR [9]. On the other hand, if nodes in the network do not always maintain routing information, when a node receives data from the upper layer for a given destination, it must first find out about how to reach the destination.…”

Section: Related Workmentioning

confidence: 99%

An Enhanced Light-weight Proactive Source Routing Protocol using BFS and DFS for MANET

Dewangan¹,

Dewangan²

2014

IJETT

View full text Add to dashboard Cite

Abstract-MANET is a self organized and self configurable network without existing infrastructure. It consists of several mobile wireless nodes. A routing protocol provides an efficient route between mobile nodes within the network. The discovery and maintenance of route should consume minimum overhead and bandwidth. In this paper, we introduce a novel Proactive Source Routing protocol that has a very small communication overhead. The proposed work is an efficient and improved light-weight proactive source routing protocol for MANETs that utilizes two common searching algorithms, called breadth first search (BFS) and depth first search (DFS) to discover the route. In such method, every node of the wireless network contains a neighbour table. Such table contains each node and its neighbours with distance between them. Therefore, each node has a full topology of the wireless network which is useful to discover the route. Periodic information exchange is used to update such table. We analyze the solution of routing in MANET and evaluate its performance using Network Simulator-2 (NS-2) under different network parameters.

show abstract

“…Table-driven algorithms, such as e.g. Destination-Sequenced Distance-Vector Routing (DSDV) [36], are purely proactive: all nodes try to maintain routes to all other nodes at all times. This means that they need to keep track of all topology changes, which can become difficult if there are a lot of nodes or if they are very mobile.…”

Section: Manet Routingmentioning

confidence: 99%

Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks

Ducatelle

Gambardella

Kurant

et al. 2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in the presence of false and missing alarms. Next, we present two efficient algorithms for mapping an IP network on an optical network in such a way that it is protected against failures at the optical layer. The first algorithm offers a method to formally verify the existence of a solution, contrary to all other heuristics known to date. The second algorithm is a heuristic search that takes capacity constraints in account. Both algorithms are shown to be faster by orders of magnitude than existing solutions. Finally, we develop a new routing algorithm for wireless mobile ad hoc networks, adopting ideas from the Ant Colony Optimization metaheuristic. The routing scheme can adapt to network and traffic changes and uses multipath routing and an efficient local repair mechanism to improve failure resilience.

show abstract

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

Cited by 3,202 publications

References 3 publications

A Survey of Routing Protocols for Ad Hoc Networks Based on Update Mechanism

A Survey of Routing Protocols for Ad Hoc Networks Based on Update Mechanism

An Enhanced Light-weight Proactive Source Routing Protocol using BFS and DFS for MANET

Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks

Contact Info

Product

Resources

About