Strong connectivity in sensor networks with given number of directional antennae of bounded angle
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
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
Strong orientations of planar graphs with bounded stretch factor
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Strongly connected orientations of plane graphs
Discrete Applied Mathematics
Establishing strong connectivity using optimal radius half-disk antennas
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We investigate the problem of converting sets of sensors into strongly connected networks of sensors using multiple directional antennae. Consider a set S of n points in the plane modeling sensors of an ad hoc network. Each sensor uses a fixed number, say 1 ≤ k ≤ 5, of directional antennae modeled as a circular sector with a given spread (or angle) and range (or radius). We give algorithms for orienting the antennae at each sensor so that the resulting directed graph induced by the directed antennae on the nodes is strongly connected. We also study trade-offs between the total angle spread and range for maintaining connectivity.