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 …

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

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 …

Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the
tremendous growth in the field, over the past two decades. Through contributions from …

We propose a novel localized algorithm that constructs a bounded degree and planar
spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only …

It has long been known that d-dimensional Euclidean point sets admit (1+ ε)-stretch
spanners with lightness WE= ε-O (d), that is the total edge weight is at most WE times the …

In the current chapter, we consider geometric networks and two important quality measures
of such networks; namely, dilation and detour. A geometric network is an undirected graph …

A t-spanner is a graph on a set of points S with the following property: Between any pair of
points there is a path in the spanner whose total length is at most t times the actual distance …

Beaconless georouting algorithms are fully reactive and work without prior knowledge of
their neighbors. However, existing approaches can either not guarantee delivery or they …

Given a set S of n points in the plane, we give an O (n log n)-time algorithm that constructs a
plane t-spanner for S, with t≈ 10, such that the degree of each point of S is bounded from …