A Driven Backup Routing Table to Find Alternative Dijoint Path in Ad Hoc Wireless
Radwan abujassar, Mohammed ghanbari

TL;DR
This paper introduces the DBRT algorithm that enhances proactive routing protocols like DSDV by adding a backup routing table, which improves network performance and reduces packet loss and delays in ad hoc wireless networks.
Contribution
The paper proposes a novel backup routing table algorithm (DBRT) that enhances existing proactive routing protocols by providing multiple alternative routes.
Findings
Improved packet delivery and throughput.
Reduced end-to-end delay.
No performance degradation despite additional messaging.
Abstract
The performances of the routing protocols are important since they compute the primary path between source and destination. In addition, routing protocols need to detect failure within a short period of time when nodes move to start updating the routing table in order to find a new primary path to the destination. Meantime, loss of packets and end-to- end delays will increase thereby reducing throughput and degrading the performance of the network. This paper proposes a new algorithm, DBRT (Driven Backup Routing Table), to improve the existing proactive protocols such as DSDV (Destination Sequenced Distance Vector) protocol by creating a backup routing table to provide multiple alternative routes. The DBRT algorithm identifies adjacent nodes for each node in the same range and then selects one of these as a backup next hop according to the available path to the destination. The results…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Wireless Networks and Protocols · Cooperative Communication and Network Coding
