A Stochastic Process based Routing Algorithm for Wireless Ad Hoc Networks

Ad hoc networks have been a fundamental building block for Machine-to-Machine (M2M) communications that can be often disconnected, intermittent, and limited. The consequent limitations have been addressed and researched. In this paper, we proposed the Multicast Cardinality and Smart Selection (MCSS) scheme for wireless ad hoc networks, based on a modified stochastic branching process, to support data exchange in fast switching topology. A network of smart devices such as drones or vehicles with different velocity is featured in our simulation to replicate more realistic communication scenarios. Our approach aims at balancing reachability, node usage, and average branching factor in multi-hop data dissemination by locally regulating the transmission probability and adaptively selecting neighbor nodes. The performance of the MCSS algorithm for message delivery is evaluated and compared with the flooding and gossip algorithms through numerical simulations.