Connectivity of Graphs Induced by Directional Antennas

Details Connectivity of Graphs Induced by Directional Antennas Connectivity of Graphs Induced by Directional Antennas

2010-08-23

arxiv.org/abs/1008.3889v1

Computer Science

Computational Geometry

8 pages, 10 figures

Scientific paper

This paper addresses the problem of finding an orientation and a minimum radius for directional antennas of a fixed angle placed at the points of a planar set S, that induce a strongly connected communication graph. We consider problem instances in which antenna angles are fixed at 90 and 180 degrees, and establish upper and lower bounds for the minimum radius necessary to guarantee strong connectivity. In the case of 90-degree angles, we establish a lower bound of 2 and an upper bound of 7. In the case of 180-degree angles, we establish a lower bound of sqrt(3) and an upper bound of 1+sqrt(3). Underlying our results is the assumption that the unit disk graph for S is connected.

Affiliated with

Also associated with

No associations

Rating

Connectivity of Graphs Induced by Directional Antennas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Connectivity of Graphs Induced by Directional Antennas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Connectivity of Graphs Induced by Directional Antennas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466288