A probabilistic broadcast algorithm based on the connectivity information of predictable rendezvous nodes in mobile ad hoc networks

In mobile ad hoc networks, node mobility may cause frequent route failures and route rediscoveries, which induce large overhead. Flooding used in a route discovery may cause a large number of unnecessarily redundant forwardings of route request (RREQ) packets, resulting in significant routing overhead. Conventional broadcast schemes, which aim to reduce the overhead in the route discovery by limiting the forwardings of RREQ packets, will also reduce the number of the underlying paths that route discovery can find, thus may miss the stablest path for data packets transmission. In this paper, we propose a novel routing discovery scheme called probabilistic broadcasting algorithm (PBA) based on the connectivity information of predictable rendezvous nodes (PRN) by considering node mobility and link stability in order to predict the possible connection of moving nodes. The PBA can find a stable path while limiting the number of RREQ packets forwardings in the route discovery.