An Energy Efficient Risk Notification Message Dissemination Protocol for Vehicular Ad hoc Networks

Natarajan Meghanathan; Gordon Skelton

Home/Archive/arXiv

arXiv · 1412.2168

An Energy Efficient Risk Notification Message Dissemination Protocol for Vehicular Ad hoc Networks

Natarajan Meghanathan·Gordon Skelton

View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose the design and development of an energy-efficient Risk Notification Message Dissemination Protocol (RNMDP) for vehicular ad hoc networks (VANETs). RNMDP propagates Risk Notification Messages (RNMs) from their location of origin (called the Risk Zone) to vehicles approaching the Risk Zone. RNMDP assumes each node is aware of its current location in the network. The protocol works as follows: A RNM is broadcast in the neighborhood of the Risk Zone. A node receiving the RNM from another node waits for a Rebroadcast-Wait-Time before deciding to rebroadcast the message. The Rebroadcast-Wait-Time for a node is modeled based on the ratio of the distance between the node and the immediate sender of the RNM and the direction of movement of the node. Priority for rebroadcast is given for nodes farthest away from the sender and traveling towards the Risk Zone. Nodes that are traveling in lanes in direction away from the Risk Zone are also considered for rebroadcast, albeit with a larger Rebroadcast-Wait-Time. During the Rebroadcast-Wait-Time, if a node hears the same RNM again rebroadcast in the neighborhood, then the node stops from further broadcasting the message. If a node does not hear the RNM in its neighborhood during the RebroadcastWait-Time, the node broadcasts the message in its neighborhood. A RNM is considered to have been delivered to all the vehicles in the road, if the message reaches the Target Zone. The performance of RNMDP has been compared with that of the commonly used flooding strategy through extensive simulations conducted for highway networks with different number of lanes and lane density. Simulation results indicate that with a slightly larger delay (i.e., no more than 35% of the delay incurred for flooding), RNMDP can achieve the same message delivery ratio attained by flooding, but at a relatively much lower energy loss compared to flooding.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Natarajan Meghanathan, Gordon Skelton. 2014-12-05. An Energy Efficient Risk Notification Message Dissemination Protocol for Vehicular Ad hoc Networks. https://arxiv.org/abs/1412.2168

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↗