Skip to content
Log in
Sponsored Artificial Intelligence: A Modern Approach, Global Edition Artificial Intelligence: A Modern Approach, Global Edition

MARCH 2026: Top 10 Read

S. Dr R. Thamilselvan2 E. Mehraeen Maryam Ahmadi Yousef Mehdipour Tayyebeh Noori E. Mohd Muhd Azhari1 Mudzakkir Mohd Zaw Zaw Hatta1 Htike1 Shoon L. Win V.Radhaa V. Satyanarayanaa Surabhi Upendera .V.K.D.Ramesh Gorrilaa B. Kumara Archana B.Saxena1 Deepti Sharma2 Gilbert M. Talaue1 Ali AlSaad2 Naif AlRushaidan3 Alwaleed AlHugail4 Saad AlFahhad5 Tayfour Abdalla S. Pakiriswamy S. Vaidyanathan
· 0 citations · 102 references

TL;DR

These topologies are compared to demonstrate the advantage of finding shortest path using Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm.

Semantic Scholar
View source

Similar papers

February 2026: Top 10 Read

These topologies are compared to demonstrate the advantage of finding shortest path using Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm.

S. Dr, R. Thamilselvan2, E. Mehraeen et al. · 0 citations

UWL REPOSITORY

A new cache-aware routing scheme for ICN that takes into account the information about the locations of caches in the network and constructs delivery paths for efficient content dissemination and is agnostic of the cached contents.

V. Vassilakis, Mays F. Al-Naday, M. Reed et al. · 0 citations

A Local Coefficient Based Load Sensitive Routing Protocol for Providing QoS

This paper presents detailed algorithm for calculating L-LSR coefficient, and shows that L-LSR algorithm not only performs better than OSPF, but also has verySignificant performance improvement over the other LSR family of algorithms.

A. Tiwari, Anirudha Sahoo · 0 citations
Open access Aug 2026

ESMP: Exploring Efficient and Stable Multicast on Multiple Communication Paths

ESMP, a multi-graph-based heuristic framework for efficient and stable multicast construction over heterogeneous parallel communication links, is presented and it is shown that an aggregate-edge-delay-constrained decision variant of the formulation is NP-hard.

Xin Dong, Qiuling Yang, Deshun Li · 0 citations
Conference Jul 2026

Centrality Aware AODV Routing for FANETs

End-to-end unmanned aerial vehicle networks suffer from overloading of central nodes due to shortest-path routing strategies. This study presents the CA-AODV approach, which integrates distributed eigenvector centrality computation into the AODV routing protocol. The proposed protocol employs a two-phase eigenvector co...

Musa Süslü, T. Sari, Gokhan Secinti · 0 citations
Open access Aug 2026

Event Based Routing Scheme for FANET

Simulation results demonstrate that the proposed protocol significantly minimizes traffic loss and guarantees a stable topology update time independent of timeout configurations, effectively maximizing network efficiency in multi-hop drone swarm operations.

Mihyun Kim, Hyunjun Ahn, Kijin Kim · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.