Packet latency of deterministic broadcasting in adversarial multiple access channels

被引：19
|
作者：
Anantharamu, Lakshmi [1 ]
Chlebus, Bogdan S. [1 ]
Kowalski, Dariusz R. [2 ]
Rokicki, Mariusz A. [2 ]
机构：
[1] Univ Colorado, Dept Comp Sci & Engn, Denver, CO 80217 USA
[2] Univ Liverpool, Dept Comp Sci, Liverpool L69 3BX, Merseyside, England
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2019年 / 99卷
基金：
美国国家科学基金会;
关键词：
Multiple access channel; Adversarial queuing; Jamming; Distributed algorithm; Deterministic algorithm; Packet latency; Queues size; CONTENTION-RESOLUTION; WIRELESS NETWORKS; STABILITY; PROTOCOLS; BACKOFF;
D O I：
10.1016/j.jcss.2018.07.001
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码：27 / 52
页数：26
相关论文
共 50 条
  • [1] Broadcasting on Adversarial Multiple Access Channels
    Aldawsari, Bader A.
    Chlebus, Bogdan S.
    Kowalski, Dariusz R.
    2019 IEEE 18TH INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA), 2019, : 327 - 330
  • [2] Deterministic Broadcast on Multiple Access Channels
    Anantharamu, Lakshmi
    Chlebus, Bogdan S.
    Kowalski, Dariusz R.
    Rokicki, Mariusz A.
    2010 PROCEEDINGS IEEE INFOCOM, 2010,
  • [3] Multiple Access Channels with Adversarial Users
    Sangwan, Nara
    Bakshi, Mayank
    Dey, Bikash Kurnar
    Prahliakaran, Vinod M.
    2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 435 - 439
  • [4] Broadcasting in ad hoc multiple access channels
    Anantharamu, Lakshmi
    Chlebus, Bogdan S.
    THEORETICAL COMPUTER SCIENCE, 2015, 584 : 155 - 176
  • [5] Deterministic Patterns for Multiple Access With Latency and Reliability Guarantees
    Kotaba, Radoslaw
    Vehkalahti, Roope
    Stefanovic, Cedomir
    Tirkkonen, Olav
    Popovski, Petar
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2025, 73 (03) : 1741 - 1755
  • [6] Faster deterministic wakeup in multiple access channels
    De Marco, G
    Pellegrini, M
    Sburlati, G
    THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3701 : 196 - 204
  • [7] Faster deterministic wakeup in multiple access channels
    De Marco, Gianluca
    Pellegrini, Marco
    Sburlati, Giovanni
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (08) : 898 - 903
  • [8] THROUGHPUT OF PACKET BROADCASTING CHANNELS
    ABRAMSON, N
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (01) : 117 - 128
  • [9] Adversarial Multiple Access Channels with Individual Injection Rates
    Lakshmi Anantharamu
    Bogdan S. Chlebus
    Mariusz A. Rokicki
    Theory of Computing Systems, 2017, 61 : 820 - 850
  • [10] Maximum throughput of multiple access channels in adversarial environments
    Chlebus, Bogdan S.
    Kowalski, Dariusz R.
    Rokicki, Mariusz A.
    DISTRIBUTED COMPUTING, 2009, 22 (02) : 93 - 116
12345