Citation Context

... the energy of the nonfaulty nodes at a higher rate than that of the faulty nodes. Most of the theoretical work on the design of efficient MAC protocols has focused on random backoff protocols (e.g., =-=[3, 6, 10, 9, 15, 22]-=-) that do not take jamming activity into account and therefore are not robust against it. MAC protocols have also been designed in the context of broadcasting (e.g., [7]) and clustering (e.g., [14]). ...

Citation Context

... systems, it is surprising that many aspects of backoff are not yet understood. Backoff strategies have typically been analyzed by making statistical assumptions on the distribution of problem inputs =-=[12, 13, 16, 20, 35]-=-. Although these analyses provide valuablesinsights into the efficacy of exponential backoff and its variants, it is dangerous to neglect the worst case by assuming statistical arrivals because bursty...

Citation Context

...ntrated on scenarios when packets are injected subject to statistical constraints. See [12] for an overview of early research; recent work includes the papers of Goldberg et al. [16], Goldberg et al. =-=[17]-=-, H˚astad, Leighton and Rogoff [19], and Raghavan and Upfal [30]. Adversarial queuing was introduced by Borodin et al. [6], as a framework to study stability of routing protocols under worst-case traf...

Citation Context

...rotocol, like the one considered in our work. In the theory community, work on MAC protocols has mostly focused on efficiency. Many of these protocols are random backoff or tournament-based protocols =-=[4,7,17,18,25,34]-=- that do not take jamming activity into account and, in fact, are not robust against it (see [2] for more details). The same also holds for many MAC protocols that have been designed in the context of...

Citation Context

...ts an acknowledgement based protocol which is recurrent in the infinitely-many users model with Poisson arrivals. This was answered in the affirmative by Goldberg, MacKenzie, Paterson, and Srinivasan =-=[50]-=-, who developed a protocol with a constant expected delay, and hence strongly stable, for arrival rates smaller than 1/e. We give an overview of the protocol. There is a conceptual tree of infinitely ...

Citation Context

...story of its transmissions.) Thus, the state space is countable and forms a partial order with respect to the subset inclusion relation ⊆ (for multisets). We say that a protocol is deletion resilient =-=[8]-=- if its Markov chain is monotonic with respect to the subset-inclusion partial order. Observation 4. Every acknowledgment-based protocol is deletion resilient. Proof. Consider the states x and x ′ wit...

Citation Context

...ass of protocols that include backoff protocols, if the total arrival rate λ is less than some fixed constant λ1 < 1, then the delay must be Ω(n). Using a more sophisticated protocol, Goldberg et al. =-=[20]-=- are able to show a constant expected delay for arrival rate up to 1/e. This protocol is practical if one assumes that the clocks of the stations are synchronized. If not, it is shown that O(1) delay ...

Citation Context

...e edge e. Examples of existing static scheduling algorithms generate schedules of length O(I · log n) or O(I + log2 n) with high probability for the respective interference measure I. In related work =-=[23, 36, 39]-=- typically a protocol for dynamic injection is built by repeatedly running a static algorithm for a suitably long time. In our case this does not have the desired effect in general. For example, when ...

Citation Context

...then the basic problem is to have stable protocols, which do not make the channel clogged eventually. Recent work in that direction includes the papers of Goldberg, MacKenzie, Paterson and Srinivasan =-=[1-=-6], Hastad, Leighton and Rogo [20], and Raghavan and Upfal [31]; see also the survey of Gallager [15] for an account of the early research and that of Chlebus [6] for recent developments. Static probl...