Restricted Mobility Improves Delay-Throughput Trade-offs in Mobile Ad-Hoc Networks

In this paper we revisit two classes of mobility models which are widely used to repre-sent users ’ mobility in wireless networks: Random Waypoint (RWP) and Random Direction (RD). For both models we obtain systems of partial differential equations which describe the evolution of the users ’ distribution. For the RD model, we show how the equations can be solved analytically both in the stationary and transient regime adopting standard mathematical techniques. Our main contributions are i) simple expressions which relate the transient dura-tion to the model parameters; ii) the definition of a generalized random direction model whose stationary distribution of mobiles in the physical space corresponds to an assigned distribution

Impact of Correlated Mobility on Delay-Throughput Performance in Mobile Ad-Hoc Networks

Abstract—We extend the analysis of the scaling laws of wireless ad hoc networks to the case of correlated nodes movements, which are commonly found in real mobility processes. We consider a simple version of the Reference Point Group Mobility model, in which nodes belonging to the same group are constrained to lie in a disc area, whose center moves uniformly across the network according to the i.i.d. model. We assume fast mobility conditions, and take as primary goal the maximization of pernode throughput. We discover that correlated node movements have huge impact on asymptotic throughput and delay, and can sometimes lead to better performance than the one achievable under independent nodes movements. I. INTRODUCTION AND RELATED WORK In the last few years the store-carry-forward communication paradigm, which allows nodes to physically carry buffered dat

Throughput Scaling of Wireless Networks With Random Connections

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a common distribution. Transmitting nodes are subject to an on-off strategy, and receiving nodes employ conventional single-user decoding. The following results are proven: 1) For a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by $O(n^{1/3})$ for single-hop schemes, and $O(n^{1/2})$ for two-hop (and multihop) schemes. 2) The $\Theta (n^{1/2})$ throughput scaling is achievable for a specific connection model by a two-hop opportunistic relaying scheme, which employs full, but only local channel state information (CSI) at the receivers, and partial CSI at the transmitters. 3) By relaxing the constraints of finite mean and variance of the connection model, linear throughput scaling $\Theta (n)$ is achievable with Pareto-type fading models.Comment: 13 pages, 4 figures, To appear in IEEE Transactions on Information Theor

Scaling Laws for Vehicular Networks

Equipping automobiles with wireless communications and networking capabilities is becoming the frontier in the evolution to the next generation intelligent transportation systems (ITS). By means of vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communications, information generated by the vehicle-borne computer, vehicle control system, on-board sensors, or roadside infrastructure, can be effectively disseminated among vehicles/infrastructure in proximity or to vehicles/infrastructure multiple hops away, known as vehicular networks (VANETs), to enhance the situational awareness of vehicles and provide motorist/passengers with an information-rich travel environment. Scaling law for throughput capacity and delay in wireless networks has been considered as one of the most fundamental issues, which characterizes the trend of throughput/delay behavior when the network size increases. The study of scaling laws can lead to a better understanding of intrinsic properties of wireless networks and theoretical guidance on network design and deployment. Moreover, the results could also be applied to predict network performance, especially for the large-scale vehicular networks. However, map-restricted mobility and spatio-temporal dynamics of vehicle density dramatically complicate scaling laws studies for VANETs. As an effort to lay a scientific foundation of vehicular networking, my thesis investigates capacity scaling laws for vehicular networks with and without infrastructure, respectively. Firstly, the thesis studies scaling law of throughput capacity and end-to-end delay for a social-proximity vehicular network, where each vehicle has a restricted mobility region around a specific social spot and services are delivered in a store-carry-and-forward paradigm. It has been shown that although the throughput and delay may degrade in a high vehicle density area, it is still possible to achieve almost constant scaling for per vehicle throughput and end-to-end delay. Secondly, in addition to pure ad hoc vehicular networks, the thesis derives the capacity scaling laws for networks with wireless infrastructure, where services are delivered uniformly from infrastructure to all vehicles in the network. The V2V communication is also required to relay the downlink traffic to the vehicles outside the coverage of infrastructure. Three kinds of infrastructures have been considered, i.e., cellular base stations, wireless mesh backbones (a network of mesh nodes, including one mesh gateway), and roadside access points. The downlink capacity scaling is derived for each kind of infrastructure. Considering that the deployment/operation costs of different infrastructure are highly variable, the capacity-cost tradeoffs of different deployments are examined. The results from the thesis demonstrate the feasibility of deploying non-cellular infrastructure for supporting high-bandwidth vehicular applications. Thirdly, the fundamental impact of traffic signals at road intersection on drive-thru Internet access is particularly studied. The thesis analyzes the time-average throughput capacity of a typical vehicle driving through randomly deployed roadside Wi-Fi networks. Interestingly, we show a significant throughput gain for vehicles stopping at intersections due to red signals. The results provide a quick and efficient way of determining the Wi-Fi deployment scale according to required quality of services. In summary, the analysis developed and the scaling laws derived in the thesis provide should be very useful for understanding the fundamental performance of vehicular networks

Throughput Scaling Laws for Wireless Networks with Fading Channels

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading (i) the maximum throughput scales like $\log n$ (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a decentralized link activation strategy is proposed and analyzed.Comment: Submitted to IEEE Transactions on Information Theory (Revised