Theoretical analysis of beaconless geocast protocols in 1D

2025-12-02

Workshop on Analytic Algorithmics and Combinatorics

AI Summary

This work addresses the network load issue in beaconless geographic broadcast protocols for one-dimensional mobile ad hoc networks. Method: We conduct the first formal theoretical analysis of six representative protocols, employing probabilistic modeling and rigorous mathematical derivation to precisely characterize upper bounds on the expected number of message receptions per node. Contribution/Results: In contrast to prior simulation-based studies, our approach establishes a verifiable theoretical framework that quantifies and compares the asymptotic load bounds across protocols, thereby validating the correctness of existing simulation results. The analysis reveals fundamental differences in load characteristics among the protocols and provides analytically tractable, comparable criteria for protocol selection and optimization. This work fills a critical gap in the formal analysis of beaconless geographic broadcasting in 1D mobile networks.

Technology Category

• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Search and Optimization: Evaluation and Analysis
• Multiagent Systems: Other Foundations of Multi Agent Systems

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Systems and Infrastructure for Web, Mobile and WoT: Web performance, measurement, and characterization
• Security and Privacy: Large-scale security measurements

Abstract

Beaconless geocast protocols are routing protocols used to send messages in mobile ad-hoc wireless networks, in which the only information available to each node is its own location. Messages get routed in a distributed manner: each node uses local decision rules based on the message source and destination, and its own location. In this paper we analyze six different beaconless geocast protocols, focusing on two relevant 1D scenarios. The selection of protocols reflects the most relevant types of protocols proposed in the literature, including those evaluated in previous computer simulations. We present a formal and structured analysis of the maximum number of messages that a node can receive, for each protocol, in each of the two scenarios. This is a measure of the network load incurred by each protocol. Our analysis, that for some of the protocols requires an involved probabilistic analysis, confirms behaviors that had been observed only through simulations before.

Problem

• Analyzes beaconless geocast protocols in 1D scenarios
• Compares maximum message load per node across six protocols
• Provides formal probabilistic analysis to validate simulation results

Innovation

• Analyzes beaconless geocast protocols in 1D scenarios
• Evaluates maximum message reception to measure network load
• Uses formal probabilistic analysis to confirm simulation behaviors