Theoretical results on flooding performance in mobile ad hoc networks

We investigate the performance of flooding in mobile ad hoc networks when the relay set is a set of nodes uniformly dispatched with density D. We give some bounds on the conditions under which a flooding will actually spread (or percolates) when the relay set density is above a certain threshold that depends on traffic density