A scheduling policy for dense and highly mobile ad hoc networks

Abstract

Recent publications in information theory demonstrated that mobility can increase the capacity of wireless ad hoc networks. More precisely, the throughput per source-destination pair can be kept constant as the density of nodes increases. Considering an analytical study as a starting point, in this paper we propose and evaluate a distributed scheduling policy for dense and highly mobile ad hoc networks. This policy takes advantage of mobility in order to reduce the relaying traffic in such a network. Simulation results are provided to show the bene t of mobility on the network throughput and the optimal transmission range is derived from an analytical study.