Lower Bounds for Structuring Unreliable Radio Networks

In this paper, the authors study lower bounds for randomized solutions to the Maximal Independent Set (MIS) and Connected Dominating Set (CDS) problems in the dual graph model of radio networks - a generalization of the standard graph-based model that now includes unreliable links controlled by an adversary. They begin by proving that a natural geographic constraint on the network topology is required to solve these problems efficiently (i.e., in time polylogarthmic in the network size).