Broadcasting in Ad Hoc Multiple Access Channels

Anantharamu, Lakshmi; Chlebus, Bogdan S.

doi:10.1007/978-3-319-03578-9_20

Cited by 6 publications

(10 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Anantharamu and Chlebus [6] considered an ad-hoc multiple access channel, which has an unbounded supply of anonymous stations attached but only the stations activated with injected packets participate in broadcasting. They studied deterministic distributed broadcast algorithms against adversaries that are restricted to be able to activate at most one station per round.…”

Section: Of-rrwmentioning

confidence: 99%

Packet latency of deterministic broadcasting in adversarial multiple access channels

Anantharamu

Chlebus

Kowalski

et al. 2019

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

We study broadcasting in multiple access channels with dynamic packet arrivals and jamming. Communication environments are represented by adversarial models that specify constraints on packet arrivals and jamming. We consider deterministic distributed broadcast algorithms and give upper bounds on the worst-case packet latency and the number of queued packets in relation to the parameters defining adversaries. Packet arrivals are determined by a rate of injections and a number of packets that can be generated in one round. Jamming is constrained by a rate with which an adversary can jam rounds and by a number of consecutive rounds that can be jammed.Keywords: multiple access channel, adversarial queuing, jamming, distributed algorithm, deterministic algorithm, packet latency, queues size. * The results of this paper appeared in a preliminary form in [7] and [8].We consider non-adaptive algorithms for channels without jamming when either collision detec-Conjecture 1 Each non-adaptive algorithm for channels without jamming that provides bounded queues, for injection rate ρ < 1, has its queue bound grow arbitrarily large as a function of injection rate ρ, if ρ approaches 1, for all sufficiently large and fixed numbers of stations n.Adaptive algorithm MBTF for channels without jamming has bounded queues even when ρ = 1, but its packet latency grows unbounded when ρ < 1 approaches 1. We conjecture that this reflects a general property of broadcast algorithms.Conjecture 2 Each broadcast algorithm for channels without jamming that provides bounded packet latency, for injection rate ρ < 1, has its packet-latency bound grow arbitrarily large as a function of injection rate ρ, if ρ approaches 1, for all sufficiently large and fixed numbers of stations n.We show that a non-adaptive algorithm for channels with jamming achieves bounded packet latency for ρ+λ < 1 when an upper bound on jamming burstiness is a part of code. We hypothesize that this is unavoidable and reflects the utmost power of non-adaptive algorithms.Conjecture 3 Each non-adaptive broadcast algorithm for channels with jamming can be made unstable by some adversaries with injection rates ρ and jamming rates λ satisfying ρ + λ < 1, for all sufficiently large and fixed numbers of stations n.Adaptive algorithm C-MBTF for channels with jamming has bounded queues when ρ + λ = 1 but its packet latency increases unbounded when ρ + λ < 1 approaches 1, for a fixed n; see the

show abstract

Section: Of-rrwmentioning

confidence: 99%

Packet latency of deterministic broadcasting in adversarial multiple access channels

Anantharamu

Chlebus

Kowalski

et al. 2019

Journal of Computer and System Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

“…Adversarial communication in multiple-access channels was studied in [8,18,2,4], among others. Bender et al [9] considered the goal of minimizing the number of channel accesses for a constant throughput in the static case of broadcasting when a set of packets is given in advance.…”

Section: Injectionmentioning

confidence: 99%

“…after combining it with the upper bound ρ < k−1 n−1 on injection rates. Bound (4) on packet delay is less than the duration of a continuous segment of rounds of activity of a group of stations determined by (2). This implies that all the packets held by the stations in a group, and accounted for as injected subject to the injection-rate constraint, are heard on the channel when the group becomes active.…”

Section: Energy-oblivious Indirect Routingmentioning

confidence: 99%

Energy Efficient Adversarial Routing in Shared Channels

Chlebus

Hradovich

Jurdziński

et al. 2019

The 31st ACM Symposium on Parallelism in Algorithms and Architectures

Self Cite

View full text Add to dashboard Cite

We investigate routing on networks modeled as multiple access channels, when packets are injected continually. There is an energy cap understood as a bound on the number of stations that can be switched on simultaneously. Each packet is injected into some station and needs to be delivered to its destination station via the channel. A station has to be switched on in order to receive a packet when it is heard on the channel. Each station manages when it is switched on and off by way of a programmable wakeup mechanism, which is scheduled by a routing algorithm. Packet injection is governed by adversarial models that determine upper bounds on injection rates and burstiness. We develop deterministic distributed routing algorithms and assess their performance in the worst-case sense. An algorithm knows the number of stations but does not know the adversary. One of the algorithms maintains bounded queues for the maximum injection rate 1 subject only to the energy cap 3. This energy cap is provably optimal, in that obtaining the same throughput with the energy cap 2 is impossible. We give algorithms subject to the minimum energy cap 2 that have latency polynomial in the total number of stations n for each fixed adversary of injection rate less than 1. An algorithm is k-energy-oblivious if at most k stations are switched on in a round and for each station the rounds when it will be switched on are determined in advance. We give a k-energy-oblivious algorithm that has packet delay O(n) for adversaries of injection rates less than k−1 n−1 , and show that there is no k-energy-oblivious stable algorithm against adversaries with injection rates greater than k n . An algorithm routes directly when each packet makes only one hop from the station into which it is injected straight to its destination. We give a k-energy-oblivious algorithm routing directly that has latency O n 2 k for adversaries of sufficiently small injection rates that are O k 2 n 2 . We develop a k-energy-oblivious algorithm routing directly that is stable for injection rate k(k−1) n(n−1) , and show that no k-energy-oblivious algorithm routing directly can be stable against adversaries with injection rates greater than k(k−1) n(n−1) .

show abstract

“…Adversarial communication in wireless networks was considered by Andrews and Zhang . Stability of broadcast protocols in adversarial multiple‐access channels was studied by Anantharamu et al , Bender et al , and Chlebus et al .…”

Section: Introductionmentioning

confidence: 99%

Stability of adversarial routing with feedback

2015

Self Cite

View full text Add to dashboard Cite

We consider the impact of scheduling disciplines on performance of routing in the framework of adversarial queuing. We propose an adversarial model which reflects stalling of packets due to transient failures and explicitly incorporates feedback produced by a network when packets are stalled. This adversarial model provides a methodology to study stability of routing protocols when flow‐control and congestion‐control mechanisms affect the volume of traffic. We show that any scheduling policy that is universally stable, in the regular model of routing that additionally allows packets to have two priorities, remains stable in the proposed adversarial model. © 2015 Wiley Periodicals, Inc.NETWORKS, Vol. 66(2), 88–97 2015

show abstract

Broadcasting in Ad Hoc Multiple Access Channels

Cited by 6 publications

References 28 publications

Packet latency of deterministic broadcasting in adversarial multiple access channels

Packet latency of deterministic broadcasting in adversarial multiple access channels

Energy Efficient Adversarial Routing in Shared Channels

Stability of adversarial routing with feedback

Contact Info

Product

Resources

About