Switching to directional antennas with constant increase in radius and hop distance

Authors:
Prosenjit Bose;Paz Carmi;Mirela Damian;Robin Flatland;Matthew J. Katz;Anil Maheshwari
Affiliations:
Carleton University, Ottawa, Canada;Ben-Gurion University, Beer-Sheva, Israel;Villanova University, Villanova, PA;Siena College, Loudonville, NY;Ben-Gurion University, Beer-Sheva, Israel;Carleton University, Ottawa, Canada
Venue:
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Year:
2011

Citing 4
Cited 5

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
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
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

Strong connectivity of sensor networks with double antennae

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Do directional antennas facilitate in reducing interferences?

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Establishing strong connectivity using optimal radius half-disk antennas

Computational Geometry: Theory and Applications
Symmetric connectivity with directional antennas

Computational Geometry: Theory and Applications
Approximation algorithms for the antenna orientation problem

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

For any angle α P of n transceivers using omni-directional antennas of radius 1, can be replaced by a strongly connected communication graph, in which each transceiver in P is equipped with a directional antenna of angle α and radius rdir, for some constant rdir = rdir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c = c(α), with respect to number of hops.