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 …

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 …

Availability of cheap positioning instruments like GPS receivers makes it possible for routing
algorithms to use the position of nodes in an ad hoc mobile network. Regular position based …

This survey concerns the role of data structures for compactly storing and representing
various types of information in a localized and distributed fashion. Traditional approaches to …

Slime mould Physarum polycephalum is a monstrous single cell well known for its task-
solving abilities solves computational geometry and logical problems, navigates robots and …

A closed curve in the plane is weakly simple if it is the limit (in the Fréchet metric) of a
sequence of simple closed curves. We describe an algorithm to determine whether a closed …

抄録< jats: p> Geographic routing algorithms use position information for making packet
forwarding decisions. Unlike topological routing algorithms, they do not need to exchange …

Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph,
in which the weight of every edge is its length. It has long been conjectured that the stretch …

Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds
on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected …

We present a routing algorithm for the Θ4-graph that computes a path between any two
vertices s and t having length at most 17 times the Euclidean distance between s and t. To …