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

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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

    Original languageEnglish
    Title of host publicationAlgorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings
    Pages134-146
    Number of pages13
    DOIs
    StatePublished - 1 Sep 2011
    Event12th International Symposium on Algorithms and Data Structures, WADS 2011 - New York, NY, United States
    Duration: 15 Aug 201117 Aug 2011

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume6844 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference12th International Symposium on Algorithms and Data Structures, WADS 2011
    Country/TerritoryUnited States
    CityNew York, NY
    Period15/08/1117/08/11

    Keywords

    • communication graph
    • directional antennas
    • hop spanner
    • wireless networks

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science

    Fingerprint

    Dive into the research topics of 'Switching to directional antennas with constant increase in radius and hop distance'. Together they form a unique fingerprint.

    Cite this