Improved algorithms in directional wireless sensor networks

Recent advances in wireless sensor networks (WSNs) allow directional antennas to be used instead of omni-directional antennas. However, the problem of maintaining (symmetric) connectivity in directional wireless sensor networks is significantly harder. Contributing to this field of research, in this paper, we study two problems in WSNs equipped with k directional antennas ( $$3 \le k \le 4$$ 3 ≤ k ≤ 4 ). The first problem, called antenna orientation (AO) is that given a set S of nodes equipped with omni-directional antennas of unit range, the goal is to replace omni-directional antennas by directional antennas with beam-width $$\theta \ge 0$$ θ ≥ 0 and to find a way to orient them such that the required range to yield a symmetric connected communication graph (SCCG) is minimized. For this problem, we propose an $$O(n \log n)$$ O ( n log n ) time algorithm yielding $$r = 2sin\left( \frac{180^\circ }{k}\right) $$ r = 2 s i n 180 ∘ k . The second problem, called antenna orientation and power assignment (AOPA) is to determine for each node u an orientation of its antennas and a range $$r_u$$ r u in order to induce an SCCG such that the total power assignment $$\sum _u r_u^\beta $$ ∑ u r u β is minimized, where $$\beta $$ β is a distant-power gradient. We show that our solution for the AO problem also induces an O(1)-approximation algorithm for the AOPA problem. Simulation results demonstrate that our algorithms have better performance than previous approaches, especially in case $$k = 3$$ k = 3 .