Mobility modeling in wireless networks: categorization, smooth movement, and border effects
By Christian Bettstetter. MOCO, 2001
550 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/10b8c53ca036872ecf1e6d40ccc1ec2edfb6ab33
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Thrasyvoulos Spyropoulos
- Konstantinos Psounis
- Cauligi S. Raghavendra
- Paolo Santi
- Christian Bettstetter
- V. Naumov
- Thomas R. Gross
- Philippe Nain
Citations in the corpus
- Performance analysis of mobility-assisted routing (2006, methodology): “However, numerous recent studies based on mobility traces from real networks (e.g. university cam-puses, conferences, etc.) have demonstrated that these two assumptions rarely hold in real-life situations [4,18–20 , In this paper, we analyze the hitting times for a number of popular mobility models ”
- On the Levy-Walk Nature of Human Mobility (2008, methodology): “Commonly used mobility models in computer networking research are random way point (RWP) [1]–[3] or random walk models such as Brownian motion (BM) [4]–[6] and Markovian mobility [7], [8].”
- Performance modeling of epidemic routing (2006, background): “As noted earlier, [6] showed that the pairwise meeting time between nodes is nearly exponentially distributed, if nodes move in a limited region (of area A) according to common mobility models (such as the random waypoint or random direction model [2]) and if their transmission range (d) is small co”
- Properties of random direction models (2005, background): “Two of the more popular are the random waypoint model, [6], and the random direction model, [3].”
- Stochastic Properties of the Random Waypoint Mobility Model (2004, unknown): “1 shows the spatial node distribution fX(x) of such an RWP movement process obtained through a long–running simulation in a square system area of size 1000 × 1000m2 as well as on a disk of radius a = 500m [3, 6].”
- On the minimum node degree and connectivity of a wireless multihop network (2002, background): “Let us discuss the applicability of two common random mobility models in more detail (see also [26]).”
- The message delay in mobile ad hoc networks (2005, methodology): “When a node reaches a boundary it is either reflected[1] or the area wraps around so that the node reappears on the other side [1].”
- The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks (2003, background): “As we have shown in [2] and [26], the simple product, yields an approximation of the distribution f XY (cid:133) x; y (cid:134) .”
- On the Connectivity of Ad Hoc Networks (2004, methodology): “Although typically a uniform spatial node distribution fX(x, t = 0) over A is used at the initialization of a simulation, the RWP movement changes this distribution into a non-uniform distribution as time goes on [6, 16].”
- Topology control in wireless ad hoc and sensor networks (2005, methodology): “A similar model is the random direction model [Bettstetter 2001; Royer et al. 2001] in which nodes move with the direction chosen uniformly in the interval [0, 2p] and the velocity chosen uniformly at random in the interval [vmin, vmax].”
- An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces (2006, background): “The literature shows that the results of performance studies of ad hoc network depend heavily on the chosen mobility model [8, 4, 43].”