Capacity and delay scaling for broadcast transmission in highly mobile wireless networks

Abstract

We study broadcast capacity and minimum delay scaling laws for highly mobile wireless networks, in which each node has to disseminate or broadcast packets to all other nodes in the network. In particular, we consider a cell partitioned network under the simplifed independent and identically distributed (IID) mobility model, in which each node chooses a new cell at random every time slot. We derive scaling laws for broadcast capacity and minimum delay as a function of the cell size. We propose a simple first-come-firstserve (FCFS) flooding scheme that nearly achieves both capacity and minimum delay scaling. Our results show that high mobility does not improve broadcast capacity, and that both capacity and delay improve with increasing cell sizes. In contrast to what has been speculated in the literature we show that there is (nearly) no tradeoff between capacity and delay. Our analysis makes use of the theory of Markov Evolving Graphs (MEGs) and develops two new bounds on ooding time in MEGs by relaxing the previously required expander property assumption. Keywords: Mobile ad hoc networks, Wireless networks, Broadcast, Throughputdelay tradeoff, Scaling laws, Flooding time, Markov evolving graphNational Science Foundation (U.S.) (Grant CNS-1217048)National Science Foundation (U.S.) (Grant CNS-1713725)National Science Foundation (U.S.) (Grant AST-1547331