We study deterministic broadcasting on multiple access channels when packets are injected
continuously. The quality of service is considered in the framework of adversarial queuing …

We consider single-hop radio networks with multiple channels as a model of wireless
networks. There are n stations connected to b radio channels that do not provide collision …

We consider deterministic feasibility and time complexity of two fundamental tasks in
distributed computing: consensus and mutual exclusion. Processes have different labels …

We study broadcast in multiple access channels in dynamic adversarial settings. There is an
unbounded supply of anonymous stations attached to a synchronous channel. There is an …

Contention resolution addresses the challenge of coordinating access by multiple processes
to a shared resource such as memory, disk storage, or a communication channel. Originally …

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 …

We study stability of local packet scheduling policies in a distributed system of n nodes. The
local policies at nodes may only access their local queues, and have no other feedback from …

Multiple access channel is a well-known communication model that deploys properties of
many network systems, such as Aloha multi-access systems, local area Ethernet networks …

In this work we study stability of local memoryless packet scheduling policies in a distributed
system of n nodes/queues under contention. The local policies at nodes may only access …

This paper presents an efficient algorithm for detecting and disseminating information in a
single-hop multi-channel network: k arbitrary nodes have information they want to share with …