Power Assignment in Radio Networks with Two Power Levels

    Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

    1 Scopus citations

    Abstract

    We study the power assignment problem in radio networks, where each radio station can transmit in one of two possible power levels, corresponding to two ranges - short and long. We show that this problem is NP-hard, and present a polynomial-time assignment algorithm, such that the number of transmitters that are assigned long range by the algorithm is at most (11/6) times the number of transmitters that are assigned long range by an optimal algorithm.

    Original languageEnglish
    Title of host publicationAlgorithm Theory - SWAT 2004
    Subtitle of host publication9th Scandinavian Workshop on Algorithm Theory
    EditorsTorben Hagerup, Jyrki Katajainen
    PublisherSpringer Verlag
    Pages431-441
    Number of pages11
    ISBN (Electronic)3540223398, 9783540223399
    DOIs
    StatePublished - 1 Jan 2004
    Event9th Scandinavian Workshop on Algorithm Theory, SWAT 2004 - Humlebæk, Denmark
    Duration: 8 Jul 200410 Jul 2004

    Publication series

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

    Conference

    Conference9th Scandinavian Workshop on Algorithm Theory, SWAT 2004
    Country/TerritoryDenmark
    CityHumlebæk
    Period8/07/0410/07/04

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science

    Fingerprint

    Dive into the research topics of 'Power Assignment in Radio Networks with Two Power Levels'. Together they form a unique fingerprint.

    Cite this