Graph theory has become a popular tool for modelling the functional connectivity of
landscapes. We conduct a review of studies that use graph theory to model connectivity …

A local algorithm is a distributed algorithm that runs in constant time, independently of the
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …

Graph theory is afundamental branch of mathematicsthat studiesnetworksconsisting of
nodes (vertices) and their connections (edges). Extensive research has been conducted on …

This volume bears on wireless network modeling and performance analysis. The aim is to
show how stochastic geometry can be used in a more or less systematic way to analyze the …

Designing, implementing, and operating a wireless sensor network involves a wide range of
disciplines and many application-specific constraints. To make sense of and take advantage …

The topic of this chapter, Voronoi diagrams, differs from other areas of computational
geometry, in that its origin dates back to the 17th century. In his book on the principles of …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

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 …

We survey the computational geometry relevant to finite element mesh generation. We
especially focus on optimal triangulations of geometric domains in two-and three …

We consider a two-tiered Wireless Sensor Network (WSN) consisting of sensor clusters
deployed around strategic locations and base-stations (BSs) whose locations are relatively …