Mobile wireless networks

The throughput capacity of wireless ad-hoc networks is limited because concurrent transmissions create mutual interference. In fact in seminal work, Gupta and Kumar (IEEE Trans. IT, March 2000) have recently shown that as the number of nodes n per unit area increases, the throughput per node goes to zero for a fixed ad hoc network. However, some data services, such as email, paging, or database synchronization, possess very loose delay constraints (on the order of minutes to hours). Recent work (Grossglauser and Tse, INFOCOM 2001), showed that such delay-tolerant applications can exploit node mobility to increase capacity through a new type of multiuser diversity. Specifically, the main result shows that if nodes are mobile, the average long-term throughput per node can be kept constant even as the number of nodes n increases.

This dramatic result relied on a strong assumption on node mobility: the trajectory of each node is an independent, stationary and ergodic random process with a uniform stationary distribution on the unit disk. Intuitively, the sample path of each node ``fills the space over time'', which is unrealistic in many practical settings. A natural question is then how strongly the achievable throughput depends on the assumptions on node mobility.

We therefore consider a model in which the nodes follow a much more limited mobility pattern: all the nodes are on a unit sphere, but each node is constrained to move on a great circle. These great circles are random, but remain fixed over time. Each node moves randomly along its own circle. The mobility process is therefore not symmetric in all the users. Our main result is that if the locations of the great circles are chosen randomly and independently, then for almost all configurations of such great circles, the average long-term throughput per node can be kept constant as the number of nodes increase. Thus, although each node is restricted to move in its own one-dimensional space, the same asymptotic performance is achieved as in the case when they can move in the entire 2-D region. We focus on the unit sphere instead of the unit disk to avoid edge effects, but the results should also be valid for nodes moving along line segments within the unit disk.


  1. Download: gc.pdf 
    This paper studies the scaling capacity of asymptotically large wireless networks. It shows that even restricted one-dimensional mobility allows the total capacity of the wireless network scales linearly with the number of nodes. This implies that per-node capacity scales as a constant, demonstrating that even restricted mobility can be used to provide non-diminishing throughput for large-scale wireless networks. This is demonstrated by utilizing the multi-user diversity which is instantiated through node-mobility.
  2. S. N. Diggavi, M. Grossglauser, and D. N. C. Tse, "Even one-dimensional mobility increases capacity of wireless adhoc networks," in Proc. IEEE International Symposium on Information Theory (ISIT), Lausanne, 2002, p. 352.