2016/12/31 by Lakshmi Anantharamu, Anantharamu, Lakshmi, Bogdan S. Chlebus +6
Computer Science · Engineering · #Cooperative Communication and Network Coding #Distributed #FOS: Computer and information sciences #Parallel #Security in Wireless Sensor Networks #Wireless Communication Security Techniques #and Cluster Computing (cs.DC) #cs.DC
paper · pdf · doi:10.48550/arxiv.1701.00186
openalex publication_date 2016/12/31 · arxiv created 2018/03/28 · arxiv updated 2018/03/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.