Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1206.1918

Routing Protocols for Mobile and Vehicular Ad-Hoc Networks: A Comparative Analysis

Preetida Vinayakray-Jani·Sugata Sanyal
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present comparative analysis of MANET (Mobile Ad-Hoc Network) and VANET (Vehicular Ad-Hoc Network) routing protocols, in this paper. The analysis is based on various design factors. The traditional routing protocols of AODV (Ad hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), and DSDV (Destination-Sequenced Distance-Vector) of MANET are utilizing node centric routing which leads to frequent breaking of routes, causing instability in routing. Usage of these protocols in high mobility environment like VANET may eventually cause many packets to drop. Route repairs and failures notification overheads increase significantly leading to low throughput and long delays. Such phenomenon is not suitable for Vehicular Ad hoc Networks (VANET) due to high mobility of nodes where network can be dense or sparse. Researchers have proposed various routing algorithms or mechanism for MANET and VANET. This paper describes the relevant protocols, associated algorithm and the strength and weakness of these routing protocols.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Preetida Vinayakray-Jani, Sugata Sanyal. 2012-06-09. Routing Protocols for Mobile and Vehicular Ad-Hoc Networks: A Comparative Analysis. https://arxiv.org/abs/1206.1918

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Formal Abstractions for Packet Scheduling

Early programming models for software-defined networking (SDN) focused on basic features for controlling network-wide forwarding paths, but more recent work has considered richer features, such as packet scheduling and queueing, that affect performance. In particular, PIFO trees, proposed by Sivaraman et al., offer a flexible and efficient primitive for programmable packet scheduling. Prior work has shown that PIFO trees can express a wide range of practical algorithms including strict priority, weighted fair queueing, and hierarchical schemes. However, the semantic properties of PIFO trees are not well understood. This paper studies PIFO trees from a programming language perspective. We formalize the syntax and semantics of PIFO trees in an operational model that decouples the scheduling policy running on a tree from the topology of the tree. Building on this formalization, we develop compilation algorithms that allow the behavior of a PIFO tree written against one topology to be realized using a tree with a different topology. Such a compiler could be used to optimize an implementation of PIFO trees, or realize a logical PIFO tree on a target with a fixed topology baked into the hardware. To support experimentation, we develop a software simulator for PIFO trees, and we present case studies illustrating its behavior on standard and custom algorithms.

cs.NI↗
arXiv2026

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $η_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks.

cs.NI↗
arXiv2026

Toward Composable Network Digital Twins: A Subgraph-Based Latency Prediction Study

Modern networks must support changing topologies, configurations, and performance objectives, motivating fast and reliable performance estimation. Network digital twins (NDTs) enable what-if analysis for performance estimation in such network scenarios, however, existing machine learning-based NDT approaches often rely on entire topology representations, which are inherently monolithic and lack reusability under topological or traffic changes in the network. This paper introduces a composable NDT approach that decomposes networks into subgraphs represented by reusable unit twins that capture subgraph structure, configuration and traffic behaviours. A lightweight composer aggregates unit twin combinations to create NDTs that predict per-route end-to-end latency through an overall topology. Evaluation across controlled synthetic topologies and diverse traffic scenarios, real-world Topology Zoo topologies, and a public NDT challenge dataset demonstrates that the composable NDTs achieve high in-distribution accuracy while remaining stable under out-of-distribution scenarios. Comparison with monolithic full topology NDTs demonstrates that our composable approach achieves reusability, while achieving comparable or superior accuracy.

cs.NI↗