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

Prosenjit Bose; Paz Carmi; Mirela Damian; Robin Flatland; Matthew J. Katz; Anil Maheshwari

doi:10.1007/s00453-012-9739-y

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

Prosenjit Bose, Paz Carmi, Mirela Damian, Robin Flatland, Matthew J. Katz, Anil Maheshwari

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

For any angle α<2π, we show that any connected communication graph that is induced by a set 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 r _dir, for some constant r _dir=r _dir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c=c(α), with respect to number of hops.

Original language	English
Pages (from-to)	397-409
Number of pages	13
Journal	Algorithmica
Volume	69
Issue number	2
DOIs	https://doi.org/10.1007/s00453-012-9739-y
State	Published - 1 Jan 2014

Keywords

Communication graph
Directional antennas
Hop spanner
Wireless networks

ASJC Scopus subject areas

General Computer Science
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s00453-012-9739-y

Cite this

@article{ee35341b4c3b4c399065dc57323d329e,

title = "Switching to directional antennas with constant increase in radius and hop distance",

abstract = "For any angle α<2π, we show that any connected communication graph that is induced by a set 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 r dir, for some constant r dir=r dir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c=c(α), with respect to number of hops.",

keywords = "Communication graph, Directional antennas, Hop spanner, Wireless networks",

author = "Prosenjit Bose and Paz Carmi and Mirela Damian and Robin Flatland and Katz, {Matthew J.} and Anil Maheshwari",

note = "Funding Information: Bose{\textquoteright}s and Maheshwari{\textquoteright}s research is partially supported by NSERC. Carmi{\textquoteright}s research is partially supported by grant 2240-2100.6/2009 from the German Israeli Foundation for scientific research and development (GIF). Damian{\textquoteright}s research is partially supported by NSF grant 1218814. Katz{\textquoteright}s research is partially supported by grant 1045/10 from the Israel Science Foundation, and by the Israel Ministry of Industry, Trade and Labor (consortium CORNET). ",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/s00453-012-9739-y",

language = "English",

volume = "69",

pages = "397--409",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

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

AU - Bose, Prosenjit

AU - Carmi, Paz

AU - Damian, Mirela

AU - Flatland, Robin

AU - Katz, Matthew J.

AU - Maheshwari, Anil

N1 - Funding Information: Bose’s and Maheshwari’s research is partially supported by NSERC. Carmi’s research is partially supported by grant 2240-2100.6/2009 from the German Israeli Foundation for scientific research and development (GIF). Damian’s research is partially supported by NSF grant 1218814. Katz’s research is partially supported by grant 1045/10 from the Israel Science Foundation, and by the Israel Ministry of Industry, Trade and Labor (consortium CORNET).

PY - 2014/1/1

Y1 - 2014/1/1

N2 - For any angle α<2π, we show that any connected communication graph that is induced by a set 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 r dir, for some constant r dir=r dir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c=c(α), with respect to number of hops.

AB - For any angle α<2π, we show that any connected communication graph that is induced by a set 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 r dir, for some constant r dir=r dir(α). Moreover, the new communication graph is a c-spanner of the original graph, for some constant c=c(α), with respect to number of hops.

KW - Communication graph

KW - Directional antennas

KW - Hop spanner

KW - Wireless networks

UR - http://www.scopus.com/inward/record.url?scp=84897560154&partnerID=8YFLogxK

U2 - 10.1007/s00453-012-9739-y

DO - 10.1007/s00453-012-9739-y

M3 - Article

AN - SCOPUS:84897560154

SN - 0178-4617

VL - 69

SP - 397

EP - 409

JO - Algorithmica

JF - Algorithmica

IS - 2

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this