Lower bounds for clear transmissions in radio networks

Martín Farach-Colton, Rohan J. Fernandes, Miguel A. Mosteiro

    Research output: Chapter in Book/Report/Conference proceedingConference contribution


    We show new lower bounds for collision-free transmissions in Radio Networks. Our main result is a tight lower bound of Ω(log n log(1/ε)) on the time required by a uniform randomized protocol to achieve a clear transmission with success probability 1 - ε in a one-hop setting. This result is extended to non-uniform protocols as well. A new lower bound is proved for the important multi-hop setting of nodes distributed as a connected Random Geometric Graph. Our main result is tight for a variety of problems.

    Original languageEnglish (US)
    Title of host publicationLATIN 2006
    Subtitle of host publicationTheoretical Informatics - 7th Latin American Symposium, Proceedings
    Number of pages8
    StatePublished - 2006
    EventLATIN 2006: Theoretical Informatics - 7th Latin American Symposium - Valdivia, Chile
    Duration: Mar 20 2006Mar 24 2006

    Publication series

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


    OtherLATIN 2006: Theoretical Informatics - 7th Latin American Symposium


    • Ad-hoc network
    • Broadcast
    • Contention resolution
    • Dominating set
    • Leader election
    • Lower bound
    • Maximal independent set
    • Radio network
    • Random geometric graphs
    • Sensor network
    • Station selection
    • Wake up
    • Weak Sensor Model. ACM-class: F.2.2

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • General Computer Science


    Dive into the research topics of 'Lower bounds for clear transmissions in radio networks'. Together they form a unique fingerprint.

    Cite this