
234 Simulation Technologies in Networking and Communications
reached). In each of the algorithm’s steps, the condition of the equal probability of choosing edges
from the set of all possible edges in the graph is satised.
Other methods add edges with the probability that is the function of the distance between the
vertices. The Waxman method [10] assumes the arrangement of the graph within the square plane
with the length of the side p (Figure 9.1). This method denes the probability of the existence of the
edge between the vertices u and v as
L
=
−
α
β
where d is the Euclidean distance between vertices u and v, whereas
=
is the ma ...