Ice-creams and wedge graphs

Abstract What is the minimum angle α > 0 such that given any set of α-directional antennas (that is, antennas each of which can communicate along a wedge of angle α), one can always assign a direction to each antenna such that the resulting communication graph is connected? Here two antennas are connected by an edge if and only if each lies in the wedge assigned to the other. This problem was recently presented by Carmi, Katz, Lotker, and Rosén [2] who also found the minimum such α namely α = π 3 . In this paper we give a simple proof of this result. Moreover, we obtain a much stronger and optimal result (see Theorem 1) saying in particular that one can chose the directions of the antennas so that the communication graph has diameter ≤ 4. Our main tool is a surprisingly basic geometric lemma that is of independent interest. We show that for every compact convex set S in the plane and every 0 < α < π, there exist a point O and two supporting lines to S passing through O and touching S at two single points X and Y , respectively, such that |OX| = |OY | and the angle between the two lines is α

Strong connectivity in sensor networks with given number of directional antennae of bounded angle

Given a set S of n sensors in the plane we consider the problem of establishing an ad hoc network from these sensors using directional antennae. We prove that for each given integer 1 ≤ k ≤ 5 there is a strongly connected spanner on the set of points so that each sensor uses at most k such directional antennae whose range differs from the optimal range by a multiplicative factor of at most 2·sin (π/k+1). Moreover, given a minimum spanning tree on the set of points the spanner can be constructed in additional O(n) time. In addition, we prove NP completeness results for k = 2 antennae