English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

The performances of the routing protocols are important since they computethe primary path between source and destination. In addition, routing protocolsneed to detect failure within a short period of time when nodes move to startupdating the routing table in order to find a new primary path to thedestination. Meantime, loss of packets and end-to- end delays will increasethereby reducing throughput and degrading the performance of the network. Thispaper proposes a new algorithm, DBRT (Driven Backup Routing Table), to improvethe existing proactive protocols such as DSDV (Destination Sequenced DistanceVector) protocol by creating a backup routing table to provide multiplealternative routes. The DBRT algorithm identifies adjacent nodes for each nodein the same range and then selects one of these as a backup next hop accordingto the available path to the destination. The results show that loss of datapackets, throughput and end-to-end delay times between source and destinationare improved. The results show that the new protocol does not degrade thenetwork's performance despite sending extra messages to construct and updatethe new backup routing table. Simulations (using an NS2 simulator) areundertaken to demonstrate the difference between using a DSDV protocol with orwithout the proposed schema.

A Driven Backup Routing Table to Find Alternative Dijoint Path in Ad Hoc Wireless