In this paper we analyze the Hamiltonian properties of
faulty random networks.
This consideration is of interest when considering wireless
broadcast networks.
A random geometric network is a graph whose vertices
correspond to points
uniformly and independently distributed in the unit square,
and whose edges
connect any pair of vertices if their distance is below some
specified bound.
A faulty random geometric network is a random geometric
network whose vertices
or edges fail at random. Algorithms to find Hamiltonian
cycles in faulty random
geometric networks are presented.Postprint (published version
