Distribution of the Maximum Waiting time of a Hello Message in Ad hoc Networks

Abstract

This paper is a contribution to the mathematical modeling of an important element in Ad hoc networks: Hello message. A queuing system is introduced to model the hello message receptions at given node. Here, the customers are the Hello messages and the service is defined as the processing of these messages. The modeling in question allows us to study the maximum waiting time of Hello messages before their treatment in the reception node. Under the hypothesis that Hello messages arrive according to a Poisson process and by using the theory of random walks, we obtain the closed form expression of the maximum waiting time. We validate our approach by the simulation study.

A Novel Dynamic Link Connectivity Strategy Using Hello Messaging for Maintaining Link Stability in MANETs

“…It is important to mention here that a CH transmits periodic Hello messages to its neighbors after every Δ interval to indicate its presence in the neighborhood [32]. This small Δ interval is mapped to the interarrival time between the consecutive Hello messages, given by (11).…”