The Random Waypoint Mobility Model with Uniform Node Spatial Distribution

In this paper, we solve a long standing open problem by presenting two versions of the well-known random waypoint mobility model in bounded regions generating a uniform steadystate node spatial distribution. In the first version, named temporal-RWP, we exploit the temporal dimension of node mobility and achieve uniformity by continuously changing the speed of a mobile node as a function of its location and of the density function of trajectories in the movement region R. In the second version, named spatial-RWP, we instead exploit the spatial dimension and achieve uniformity by selecting waypoints according to a suitably defined mix of probability density functions. Both proposed models can be easily incorporated in wireless network simulators, and are thus of practical use. The RWP models presented in this paper allow for the first time completely removing the well-known border effect causing possible inaccuracies in mobile network simulation, thus completing the picture of a "perfect" simulation methodology drawn in existing literature

The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks

The random waypoint model is a commonly used mobility model in the simulation of ad hoc networks. It is known that the spatial distribution of nodes moving according to this model is in general non-uniform. However, an in-depth investigation and a closed-form expression of this distribution is still missing. This fact impairs the accuracy of the current simulation methodology of ad hoc networks and makes it impossible to relate simulation results to analytical results on the properties of adhoc networks. To overcome these problems, we present a detailed analytical study of the node distribution resulting from random waypoint mobility. More specifically, we consider a generalization of the model, in which the pause time of the mobile nodes is chosen arbitrarily in each waypoint and a fraction of nodes may remain static for the entire simulation time. We show that the structure of the resulting distribution is the weighted sum of three independent components: the static, pause, and mobility component. This division enables us to understand how the model\u27s parameters influence the distribution. By describing mobility as a stochastic process, we derive an exact equation of the asymptotically stationary distribution for movement on a line segment, and an accurate approximation for a square area. The good quality of this approximation is validated through simulations with various settings of the mobility parameters

Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs

What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is to define both an environment with obstacles and a mobility model for the stations in such an environment. The present paper focuses on a new way of considering the mobility within environments with obstacles, while keeping the core ideas of the well-known Random WayPoint mobility model (a.k.a RWP). Based on a mesh-partitioning of the space, we propose a new model called RSP-O-G for which we compute the spatial distribution of stations and analyse how the presence of obstacles impacts this distribution compared to the distribution when no obstacles are present. Coupled with a simple model of radio propagation, and according to the density of stations in the environment, we study the mean degree of the connection graphs corresponding to such mobile ad hoc networks

Spatial networks with wireless applications

Many networks have nodes located in physical space, with links more common between closely spaced pairs of nodes. For example, the nodes could be wireless devices and links communication channels in a wireless mesh network. We describe recent work involving such networks, considering effects due to the geometry (convex,non-convex, and fractal), node distribution, distance-dependent link probability, mobility, directivity and interference.Comment: Review article- an amended version with a new title from the origina

Performance evaluation of an efficient counter-based scheme for mobile ad hoc networks based on realistic mobility model

Flooding is the simplest and commonly used mechanism for broadcasting in mobile ad hoc networks (MANETs). Despite its simplicity, it can result in high redundant retransmission, contention and collision in the network, a phenomenon referred to as broadcast storm problem. Several probabilistic broadcast schemes have been proposed to mitigate this problem inherent with flooding. Recently, we have proposed a hybrid-based scheme as one of the probabilistic scheme, which combines the advantages of pure probabilistic and counter-based schemes to yield a significant performance improvement. Despite these considerable numbers of proposed broadcast schemes, majority of these schemes’ performance evaluation was based on random waypoint model. In this paper, we evaluate the performance of our broadcast scheme using a community based mobility model which is based on social network theory and compare it against widely used random waypoint mobility model. Simulation results have shown that using unrealistic movement pattern does not truly reflect on the actual performance of the scheme in terms of saved-rebroadcast, reachability and end to end delay

STEPS - an approach for human mobility modeling

In this paper we introduce Spatio-TEmporal Parametric Stepping (STEPS) - a simple parametric mobility model which can cover a large spectrum of human mobility patterns. STEPS makes abstraction of spatio-temporal preferences in human mobility by using a power law to rule the nodes movement. Nodes in STEPS have preferential attachment to favorite locations where they spend most of their time. Via simulations, we show that STEPS is able, not only to express the peer to peer properties such as inter-ontact/contact time and to reflect accurately realistic routing performance, but also to express the structural properties of the underlying interaction graph such as small-world phenomenon. Moreover, STEPS is easy to implement, exible to configure and also theoretically tractable

Optimal Non-uniform Deployments in Ultra-Dense Finite-Area Cellular Networks

Network densification and heterogenisation through the deployment of small cellular access points (picocells and femtocells) are seen as key mechanisms in handling the exponential increase in cellular data traffic. Modelling such networks by leveraging tools from Stochastic Geometry has proven particularly useful in understanding the fundamental limits imposed on network coverage and capacity by co-channel interference. Most of these works however assume infinite sized and uniformly distributed networks on the Euclidean plane. In contrast, we study finite sized non-uniformly distributed networks, and find the optimal non-uniform distribution of access points which maximises network coverage for a given non-uniform distribution of mobile users, and vice versa.Comment: 4 Pages, 6 Figures, Letter for IEEE Wireless Communication