Recent work of Gupta and Kumar (2000) has shown that in a multi-hop wireless network the
throughput capacity per source-destination pair goes to zero as the node density increases …

We study the asymptotic throughput capacity and delay in mobile ad hoc networks following
the 2-hop relaying algorithm proposed by Grossglauser and Tse (2001). We assume the …

There has been significant recent interest within the networking research community to
characterize the impact of mobility on the capacity and delay in mobile ad hoc networks. In …

In this paper, we study the delay and capacity trade-offs for wireless ad hoc networks with
random mobility. We consider some simple distributed scheduling and relaying protocols …

Gupta and Kumar (2000) introduced a random network model for studying the way
throughput scales in a wireless network when the nodes are fixed, and showed that the …

Since the original work of Grossglauser and Tse, which showed that mobility can increase
the capacity of an ad hoc network, there has been a lot of interest in characterizing the delay …

Throughput capacity in mobile ad hoc networks has been studied extensively under many
different mobility models. However, most previous research assumes global mobility, and …

There has been recent interest within the networking research community to understand
how mobility can improve the capacity of mobile ad hoc networks. Of particular interest is the …

Throughput capacity in wireless ad hoc networks has been studied extensively under many
different mobility models such as iid mobility model, Brownian mobility model, random walk …

We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad
hoc network. To reduce delays in the network, each user sends redundant packets along …