Applications of k-Local MST for Topology Control and Broadcasting in Wireless Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Theoretical Computer Science
Communication in wireless networks with directional antennas
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Sensor network connectivity with multiple directional antennae of a given angular sum
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Switching to directional antennas with constant increase in radius and hop distance
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
| Hi-index | 0.00 |
Given a set S of points in the plane representing wireless devices, each point equipped with a directional antenna of radius r and aperture angle @a=180^o, our goal is to find orientations and a minimum r for these antennas such that the induced communication graph is strongly connected. We show that r=3 if @a@?[180^o,240^o), r=2 if @a@?[240^o,270^o), r=2sin(36^o) if @a@?[270^o,288^o), and r=1 if @a=288^o suffices to establish strong connectivity, assuming that the longest edge in the Euclidean minimum spanning tree of S is 1. These results are worst-case optimal and match the lower bounds presented in [I. Caragiannis, C. Kaklamanis, E. Kranakis, D. Krizanc, A. Wiese, Communication in wireless networks with directional antennae, in: Proc. of the 20th Symp. on Parallelism in Algorithms and Architectures, 2008, pp. 344-351]. In contrast, r=2 is sometimes necessary when @a