Packet latency of deterministic broadcasting in adversarial multiple access channels

作     者：Anantharamu, Lakshmi Chlebus, Bogdan S. Kowalski, Dariusz R. Rokicki, Mariusz A. 

作者机构：Univ Colorado Dept Comp Sci & Engn Denver CO 80217 USA Univ Liverpool Dept Comp Sci Liverpool L69 3BX Merseyside England 

出 版 物：《JOURNAL OF COMPUTER AND SYSTEM SCIENCES》 (计算机与系统科学杂志)

年 卷 期：2019年第99卷

页      面：27-52页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Science Foundation Narodowe Centrum Nauki [UMO-2017/25/B/ST6/02553] Division of Computing and Communication Foundations Direct For Computer & Info Scie & Enginr Funding Source: National Science Foundation 

主　　题：Multiple access channel Adversarial queuing Jamming Distributed algorithm Deterministic algorithm Packet latency Queues size 

摘      要：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.