Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Dolev, Seth Gilbert, R. Guerraoui, Calvin Newport (2007)
Gossiping in a Multi-channel Radio Network
Adi Ros (2002)
A Note on Models for Non-Probabilistic Analysis of Packet-Switching Networks
V. Cholvi, J. Echagüe (2007)
Stability of FIFO networks under adversarial models: State of the artComput. Networks, 51
R. Gallager (1984)
A perspective on multiaccess channelsIEEE Trans. Inf. Theory, 31
Lakshmi Anantharamu, Bogdan Chlebus, D. Kowalski, Mariusz Rokicki (2010)
Deterministic Broadcast on Multiple Access Channels2010 Proceedings IEEE INFOCOM
Bogdan Chlebus, D. Kowalski, Mariusz Rokicki (2006)
Adversarial queuing on the multiple-access channel
A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, David Williamson (2001)
Adversarial queuing theoryJ. ACM, 48
M. Andrews, Lisa Zhang (2004)
Routing and scheduling in multihop wireless networks with time-varying channels
R. Metcalfe (1988)
Ethernet: distributed packet switching for local computer networks
G. Marco, D. Kowalski (2013)
Contention Resolution in a Non-synchronized Multiple Access Channel2013 IEEE 27th International Symposium on Parallel and Distributed Processing
A. Rosén, Michael Tsirkin (2004)
On Delivery Times in Packet Networks under Adversarial TrafficTheory of Computing Systems, 39
G. Marco, M. Pellegrini, G. Sburlati (2005)
Faster deterministic wakeup in multiple access channels
D. Kowalski (2005)
On selection problem in radio networks
J Håstad, FT Leighton, B Rogoff (1996)
Analysis of backoff protocols for multiple access channelsSIAM J. Comput., 25
Marcin Bienkowski, M. Klonowski, M. Korzeniowski, D. Kowalski (2010)
Dynamic sharing of a multiple access channelArXiv, abs/1001.3044
A. Clementi, A. Monti, R. Silvestri (2002)
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks
M. Andrews, B. Awerbuch, Antonio Fernández, F. Leighton, Zhiyong Liu, J. Kleinberg (2001)
Universal-stability results and performance bounds for greedy contention-resolution protocolsJ. ACM, 48
a node receives a feedback from the channel
Lakshmi Anantharamu, Bogdan Chlebus, D. Kowalski, Mariusz Rokicki (2011)
Medium Access Control for Adversarial Channels with Jamming
P. Raghavan, E. Upfal (1995)
Stochastic contention resolution with short delaysSIAM J. Comput., 28
R Bhattacharjee, A Goel, Z Lotker (2005)
Instability of FIFO at arbitrarily low rates in the adversarial queueing modelSIAM J. Comput., 34
A. Rosén (2002)
A note on models for non-probabilistic analysis of packet switching networksInf. Process. Lett., 84
M. Bender, Jeremy Fineman, Seth Gilbert, Maxwell Young (2016)
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
B. Awerbuch, A. Richa, C. Scheideler (2008)
A jamming-resistant MAC protocol for single-hop wireless networks
L. Gąsieniec, A. Pelc, D. Peleg (2000)
The Wakeup Problem in Synchronous Broadcast SystemsSIAM J. Discret. Math., 14
(2009)
Adversarial multiple access channel with individual injection rates
Carme Àlvarez, M. Blesa, M. Serna (2004)
The impact of failure management on the stability of communication networksProceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004.
Seth Gilbert, R. Guerraoui, Calvin Newport (2006)
Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks
M. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés Martínez, Agustín Santos, M. Serna, Christopher Thraves (2005)
Adversarial Queueing Model for Continuous Network DynamicsTheory of Computing Systems, 44
R. Bhattacharjee, Ashish Goel, Zvi Lotker (2003)
Instability of FIFO at arbitrarily low rates in the adversarial queuing model44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
Zvi Lotker, B. Patt-Shamir, A. Rosén (2002)
New stability results for adversarial queuingSIAM J. Comput., 33
M. Bender, Martín Farach-Colton, Simai He, Bradley Kuszmaul, C. Leiserson (2005)
Adversarial contention resolution for simple channels
J. Håstad, F. Leighton, B. Rogoff (1987)
Analysis of backoff protocols for multiple access channelsProceedings of the nineteenth annual ACM symposium on Theory of computing
J. Czyzowicz, L. Gąsieniec, D. Kowalski, A. Pelc (2009)
Consensus and Mutual Exclusion in a Multiple Access ChannelIEEE Transactions on Parallel and Distributed Systems, 22
Bogdan Chlebus (2017)
Randomized Communication in Radio NetworksArXiv, abs/1801.00074
L. Goldberg, M. Jerrum, Sampath Kannan, M. Paterson (2004)
A bound on the capacity of backoff and acknowledgment-based protocolsSIAM J. Comput., 33
J. Komlos, A. Greenberg (1985)
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channelsIEEE Trans. Inf. Theory, 31
Lakshmi Anantharamu, Bogdan Chlebus (2013)
Broadcasting in ad hoc multiple access channelsTheor. Comput. Sci., 584
M. Andrews, Lisa Zhang (1998)
Stability results for networks with input and output blocking
There are no transmissions in a round: nodes receive silence from the channel as feedback
M. Andrews, Lisa Zhang (2001)
Achieving stability in networks of input-queued switchesProceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 3
There is one transmission in a round: the message is heard by all the nodes in the same round
L. Goldberg, P. MacKenzie, M. Paterson, A. Srinivasan (2000)
Contention resolution with constant expected delayJ. ACM, 47
Bogdan Chlebus, D. Kowalski, A. Lingas (2006)
Performing work in broadcast networksDistributed Computing, 18
Carme Àlvarez, M. Blesa, J. Díaz, M. Serna, Antonio Fernández (2003)
Adversarial models for priority‐based networksNetworks, 45
N. Abramson (1985)
Development of the ALOHANETIEEE Trans. Inf. Theory, 31
A. Greenberg, S. Winograd (1985)
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channelsJ. ACM, 32
S. Dolev, Seth Gilbert, R. Guerraoui, F. Kuhn, Calvin Newport (2009)
The wireless synchronization problem
Bogdan Chlebus, D. Kowalski, Mariusz Rokicki (2017)
Maximum throughput of multiple access channels in adversarial environmentsDistributed Computing, 22
Seth Gilbert, R. Guerraoui, D. Kowalski, Calvin Newport (2009)
Interference-Resilient Information ExchangeIEEE INFOCOM 2009
M Andrews, L Zhang (2003)
Achieving stability in networks of input-queued switchesIEEE/ACM Trans. Netw., 11
T. Jurdzinski, Grzegorz Stachowiak (2002)
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
We study deterministic distributed broadcasting in synchronous multiple-access channels. Packets are injected into n nodes by a window-type adversary that is constrained by a window w and injection rates individually assigned to all nodes. We investigate what queue size and packet latency can be achieved with the maximum aggregate injection rate of one packet per round, depending on properties of channels and algorithms. We give a non-adaptive algorithm for channels with collision detection and an adaptive algorithm for channels without collision detection that achieve O ( min ( n + w , w log n ) ) ${\mathcal {O}}(\min (n+w,w\log n))$ packet latency. We show that packet latency has to be either Ω(wmax(1,logw n)), when w ≤ n, or Ω(w + n), when w > n, as a matching lower bound to these algorithms. We develop a non-adaptive algorithm for channels without collision detection that achieves O ( n + w ) ${\mathcal {O}}(n+w)$ queue size and O ( nw ) ${\mathcal {O}}(nw)$ packet latency. This is in contrast with the adversarial model of global injection rates, in which non-adaptive algorithms with bounded packet latency do not exist (Chlebus et al. Distrib. Comput. 22(2), 93–116 2009). Our algorithm avoids collisions produced by simultaneous transmissions; we show that any algorithm with this property must have Ω(n w) packet latency.
Theory of Computing Systems – Springer Journals
Published: Nov 28, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.