2005
DOI: 10.1007/11562436_37
|View full text |Cite
|
Sign up to set email alerts
|

Epoch Distance of the Random Waypoint Model in Mobile Ad Hoc Networks

Abstract: Abstract. In this paper, we model the epoch distance of the random waypoint model in mobile ad hoc networks. In the random waypoint model, each node selects a target location (i.e., waypoint) to move at a speed selected from an interval. Once the target is reached, the node pauses for a random time and then selects another target with another speed to move again. The movement between two waypoints is referred to as an epoch. In this paper, we derive the probability distribution of the epoch distance for the ra… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2007
2007
2022
2022

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…There have been existing works that analyzes the link availability (see e.g., [35,36,38,39]). However, those analyses are based on particular mobility models that are different from some being considered this work, which is the street mobility.…”
Section: End-to-end Throughput Analysismentioning
confidence: 99%
“…There have been existing works that analyzes the link availability (see e.g., [35,36,38,39]). However, those analyses are based on particular mobility models that are different from some being considered this work, which is the street mobility.…”
Section: End-to-end Throughput Analysismentioning
confidence: 99%
“…4). The complete analytical derivation of this expression can be found in [13,14], where the probability distribution of the distances between two randomly positioned mobile nodes that follow a random waypoint model in a wireless network over a rectangular area is carried out. In both works, they derive the expression applying straightforward geometrical and probabilistic analysis.…”
Section: Probability Distribution Function Of the Distance Between Twmentioning
confidence: 99%
“…4 a)). H is expressed in (14), where N is the number of nodes, W is the size of the squared network and R is the transmission range of the nodes. In this case, the maximum number of hops would be achieved when nodes were arranged in the hypotenuse of the square area, so the number of hops would be √ 2·W/R.…”
Section: Estimation Of Path Error Probability (Pep)mentioning
confidence: 99%
See 1 more Smart Citation