A SCHEDULING POLICY FOR DENSE AND HIGHLY MOBILE AD HOC NETWORKS
01 January 2002
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. Indeed, such enhancements are achievable as the node mobility provides a sort of multi-user diversity. 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. Moreover, simulation results to show the benefit of mobility on the network capacity are provided.