Throughput and Delay in Random Wireless Networks With Restricted Mobility

Abstract

Grossglauser and Tse (2001) introduced a mobile random network model where each node moves independently on a unit disk according to a stationary uniform distribution and showed that a throughput of Θ(1) is achievable. El Gamal, Mammen, Prabhakar and Shah (2004) showed that the delay associated with this throughput scales as Θ (n log n), when each node moves according to an independent random walk. In a later work, Diggavi, Grossglauser and Tse (2002) considered a random network on a sphere with a restricted mobility model, where each node moves along a randomly chosen great circle on the unit sphere. They showed that even with this one-dimensional restriction on mobility, constant throughput scaling is achievable. Thus, this particular mobility restriction does not affect the throughput scaling. This raises the question whether this mobility restriction affects the delay scaling.This paper studies the delay scaling at Θ(1) throughput for a random network with restricted mobility. First, a variant of the scheme presented by Diggavi, Grossglauser and Tse (2002) is presented and it is shown to achieve Θ(1) throughput using different (and perhaps simpler) techniques. The exact order of delay scaling for this scheme is determined, somewhat surprisingly, to be of Θ(n log n), which is the same as that without the mobility restriction. Thus, this particular mobility restriction does not affect either the maximal throughput scaling or the corresponding delay scaling of the network. This happens because under this 1-D restriction, each node is in the proximity of every other node in essentially the same manner as without this restriction.

Delay Guarantees for Throughput-Optimal Wireless Link Scheduling

“…There has been some recent interesting work on characterizing the delay performance of scheduling algorithms, or formulating scheduling and routing policies in random networks that attain order-optimal delay [6], [7], [20], [14], [16], [17]. Most of these works do not consider queuing delay, and focus on attaining order-optimal packet delivery delay in presence of node mobility.…”

Capacity and delay of hybrid wireless broadband access networks

“…In the literature, there are some works ( [2], [8], [9], [15], [19], [20]) about the trade-off between capacity and delay in mobile ad hoc networks. They show that by using mobility to increase the capacity of the network, the delay will also be increased.…”

“…[2], [8], [10], [15], [19], and [20] propose to utilize nodes' mobility to deliver packets. Each packet is only relayed for very few times before arriving at the destination.…”

Delay and Capacity in Ad Hoc Mobile Networks with f-Cast Relay Algorithms

“…Later, Gamal et al [2] showed that the Θ(1) throughput is also achievable under a random walk model, but which comes at the price of a Θ(n log n) delay. Mammen et al [3] proved that the same throughput and delay scaling are also achievable even with a variant of the Grossglauser-Tse 2-hop relay and a restricted mobility model. The delay and throughput trade-off has been further widely studied under different mobility models, like the i.i.d.…”