Given a set of points in the plane, we show that the θ-graph with 5 cones is a geometric
spanner with spanning ratio at most 50+ 22 5≈ 9.960. This is the first constant upper bound …

Let G=(V (G), E (G)) be a graph and uvεE. A subset D⊆ V of vertices is a dominating set if
every vertex in V− D is adjacent to at least one vertex of D. The domination number is the …

Given a point set $ S\subset\mathbb {R}^ d $, the $\theta $-graph of $ S $ is as follows: for
each point $ s\in S $, draw cones with apex at $ s $ and angle $\theta $% fix a line through …

Greedy Forwarding algorithm is an important geometric routing algorithm for wireless
networks. However, it can fail if the network topologies contain voids, in which a packet …

Abstract\varTheta _6-graphs are important geometric graphs that have many applications
especially in wireless sensor networks. They are equivalent to Delaunay graphs where …

$\Theta_6 $-Graphs graphs are important geometric graphs that have many applications
especially in wireless sensor networks. They are equivalent to Delaunay graphs where …

Consider a network linking the points of a rate-1 Poisson point process on the plane. Write
Ψave (s) for the minimum possible mean length per unit area of such a network, subject to …

Greedy Forwarding algorithm is a widely-used routing algorithm for wireless networks.
However, it can fail if the wireless network topologies contain voids, where a packet cannot …

Construir y mantener una estructura de red eficiente es una tarea muy importante en todas
aquellas redes de sensores inalámbricos. En lo que se refiere a consumo eléctrico, uno de …