Results of neighborhood graphs are surveyed. Properties, bounds on the size, algorithms,
and variants of the neighborhood graphs are discussed. Numerous applications including …

As the field of communications networks continues to evolve, the challenging area of
wireless sensor networks is rapidly coming of age. Recent advances have made it possible …

Several localized routing protocols guarantee the delivery of the packets when the
underlying network topology is a planar graph. Typically, relative neighborhood graph …

Several localized routing protocols (see Bose, P. and Morin, P., Proc. 10th Annual Int. Symp.
on Algorithms and Computation ISAAC, 1999) guarantee the delivery of packets when the …

Due to the limited resources available in the wireless ad hoc networking nodes, the
scalability is crucial for network operations. One effective approach is to maintain only a …

The problem of" Shortest Connectivity", which is discussed here, has a long and convoluted
history. Many scientists from many fields as well as laymen have stepped on its stage …

We consider how to construct power efficient wireless ad hoc networks. We propose two
different methods combining several well-known proximity graphs including the Gabriel …

In this paper, we review some new distributed algorithms that construct sparse subgraphs
with bounded degree of the unit disk graph efficiently for wireless ad hoc networks. They …

We present an overview of the recent progress of applying computational geometry
techniques to solve some questions, such as topology construction and broadcasting, in …

The notion of distance is fundamental to many aspects of computational geometry. A classic
approach to characterize the distance properties of planar (and high-dimensional) point sets …