MARCH 2026: Top 10 Read

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.

UWL REPOSITORY

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.

ESMP: Exploring Efficient and Stable Multicast on Multiple Communication Paths

Modern communication networks may provide several heterogeneous links between the same pair of devices, including Wi-Fi, 5G, Bluetooth, and SparkLink. Existing multicast schemes often use simple-graph abstractions and therefore cannot distinguish these parallel links. We present ESMP, a multi-graph-based heuristic framework for efficient and stable multicast construction over heterogeneous parallel communication links. ESMP represents parallel channels as edges with delay and stability attributes. We show that an aggregate-edge-delay-constrained decision variant of the formulation is NP-hard. The framework includes six polynomial-time heuristics: delay-based DMA and DSMA, stability-based SMA and SDMA, and stability-delay-ratio-based RMA and MRMA. Each algorithm derives a metric-specific graph from the original multi-graph and constructs a tree according to its delay-stability preference. We also develop local adjustment strategies for vertex joins, vertex exits, and link dynamics. Experiments on connected synthetic multi-graphs reveal distinct metric preferences. Delay-oriented methods reduce delay, stability-oriented methods improve stability, and ratio-based methods provide stability-aware trade-offs at relatively low delay. In particular, RMA favors low delay, whereas MRMA uses pair-level average stability-delay information and shows comparatively favorable stability preservation and tree compactness in the evaluated scenarios. These findings characterize heuristic behavior in the evaluated synthetic settings and do not establish general optimality.

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 computation mechanism, RREQ (Route Request) buffering for best-path selection, and a centrality-based link cost function to divert traffic away from central nodes. Simulation results conducted with OMNeT++ on a 50-node UAV network demonstrate that CA-AODV achieves up to %3.7 improvement in packet delivery ratio, up to %25.3 reduction in end-to-end delay, and %3.5 increase in sum rate compared to standard AODV under high traffic loads.

Event Based Routing Scheme for FANET

This paper proposes an event-driven AODV routing optimization for highly dynamic Flying Ad hoc Networks (FANETs). Standard AODV relies on active route timeouts, leading to high packet loss and inefficient resource usage when network topologies rapidly change. To address this, we design an extended HELLO message to diminish RREQ flooding overhead and introduce a novel RDISC(Route Discovery) control message. The RDISC mechanism allows nodes to proactively trigger route updates upon link recovery events while maintaining ongoing sessions. 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.