Mobility Friendly Publish/Subscribe

S. Baehni, Chirdeep Singh Chhabra, Rachid GuerraouiInfoscience 2004

Abstract

This paper describes an event dissemination algorithm that implements a topic-based publish/subscribe abstraction in mobile ad-hoc networks (MANETs). Our algorithm relies on (1) the mobility of the processes and (2) the validity period of the events to ensure the reliability of the dissemination (under reasonable conditions) with a thrifty usage of the memory. The algorithm is inherently portable and does not assume any specific routing protocol. Old events are collected to save the memory and the energy consumption is, in some sense, related to the size of the event scope a subscriber is interested in. We give simulation results in different mobility models and highlight the advantages/drawbacks of our approach as well as we expose some interesting relations between validity periods and reliability.

1.

Introduction

In Mobile Ad-hoc Networks (MANETs), nodes move unpredictably, possess limited battery and memory, and lack fixed infrastructure. Implementing a publish/subscribe (pub/sub) system—where publishers produce data and subscribers receive only relevant information—is notoriously difficult. Traditional approaches often suffer from either excessive flooding, which drains battery and clogs the network, or complex routing maintenance, where paths frequently break as nodes move. This research proposes a "mobility-friendly" middle ground that ensures high reliability while remaining resource-efficient.

Architecture and Methodology

The proposed algorithm introduces a topic-based pub/sub layer that sits directly between the Application layer and the MAC (Medium Access Control) layer. By bypassing the traditional network routing protocol, the system avoids the overhead of maintaining complex routing tables in a highly dynamic environment.

Comparison of traditional (a) and proposed (b) network stacks.

Core Mechanisms

  1. Neighborhood Detection via Heartbeats: Nodes periodically broadcast "heartbeat" messages containing their ID, current subscriptions, and speed. Nodes maintain a neighborhood table only for peers sharing at least one common interest, effectively filtering out irrelevant network "noise."
  2. Interest-Based Exchange: Before transmitting full events, nodes exchange short lists of event identifiers. This ensures that data is only sent to nodes that need it and haven't already received it.
Neighborhood detection and interest exchange between nodes.
  1. Mobility-Driven Dissemination: Instead of active pathfinding, the algorithm leverages node mobility. As nodes move into new neighborhoods, they check if new neighbors require any valid events currently in their cache.
  2. Collision Avoidance: Back-off timers are used to prevent "broadcast storms." If a node hears another node broadcasting an event it was about to send, it cancels its own transmission.
  3. Garbage Collection: Events are assigned a "validity period" (TTL). A garbage collection function prunes the event cache, prioritizing the removal of expired events or those that have been widely forwarded.

Evaluation and Results

The algorithm was evaluated using the Qualnet (3.7) simulator across two mobility models: Random Waypoint (random movement) and City Section (constrained movement based on the EPFL campus map).

Key Findings

  • Mobility as a Catalyst: Higher mobility in the Random Waypoint model correlates with higher reliability, as nodes encounter more unique peers within an event's validity window.
  • The Validity Lever: The validity period is the primary determinant of reliability. Longer validity allows more opportunities for data "infection" as nodes move.
  • City Model Performance: In the more realistic City Section model, reliability reached nearly 60% for events with a 150-second validity when only 20% of nodes were interested, jumping to ~77% when all nodes were interested. Constrained movement (e.g., following paths) actually improved dissemination by creating "hot spots" for node encounters.
  • Heartbeat Tuning: A heartbeat interval of approximately 1 second was found to balance reliability and message overhead effectively.

Discussion and Limitations

The research demonstrates that mobility can be treated as a feature rather than a hurdle. By using physical movement as a transport mechanism, the system achieves "delay-tolerant" dissemination suitable for news or sensor data.

However, limitations remain:

  • Network Density: The algorithm struggles in sparse networks where inter-encounter times exceed event validity.
  • Latency: It is unsuitable for ultra-low-latency applications due to its reliance on physical movement.
  • Scalability: While memory-efficient, extreme increases in topic diversity or event frequency could still pressure local caches.

Future work includes dynamic heartbeat optimization and further scaling tests.

Summary updated

Abstract

This paper describes an event dissemination algorithm that implements a topic-based publish/subscribe abstraction in mobile ad-hoc networks (MANETs). Our algorithm relies on (1) the mobility of the processes and (2) the validity period of the events to ensure the reliability of the dissemination (under reasonable conditions) with a thrifty usage of the memory. The algorithm is inherently portable and does not assume any specific routing protocol. Old events are collected to save the memory and the energy consumption is, in some sense, related to the size of the event scope a subscriber is interested in. We give simulation results in different mobility models and highlight the advantages/drawbacks of our approach as well as we expose some interesting relations between validity periods and reliability. 1.
BibTeX
@inproceedings{baehni2004mobility,
  author = {S. Baehni and Chirdeep Singh Chhabra and Rachid Guerraoui},
  title = {{Mobility Friendly Publish/Subscribe}},
  booktitle = {Infoscience},
  year = {2004},
}
Figure