TY - GEN
T1 - Broadcasting in ad hoc multiple access channels
AU - Anantharamu, Lakshmi
AU - Chlebus, Bogdan S.
N1 - Funding Information:
This work was supported by the NSF Grant 1016847 .
PY - 2013
Y1 - 2013
N2 - We study dynamic broadcasting in multiple access channels in adversarial settings. There is an unbounded supply of anonymous stations attached to the channel. There is an adversary who injects packets into stations to be broadcast on the channel. The adversary is restricted by the injection rate, burstiness, and by how many passive stations can be simultaneously activated by injecting packets into their empty queues. We consider deterministic distributed broadcast algorithms, which are further categorized by their properties. We investigate for which injection rates can algorithms attain bounded packet latency, when adversaries are restricted to be able to activate at most one station per round. The rates of algorithms we present make the increasing sequence 1/3, 3/8 and 1/2 reflecting the additional features of algorithms. We show that no injection rate greater than 3/4 can be handled with bounded packet latency.
AB - We study dynamic broadcasting in multiple access channels in adversarial settings. There is an unbounded supply of anonymous stations attached to the channel. There is an adversary who injects packets into stations to be broadcast on the channel. The adversary is restricted by the injection rate, burstiness, and by how many passive stations can be simultaneously activated by injecting packets into their empty queues. We consider deterministic distributed broadcast algorithms, which are further categorized by their properties. We investigate for which injection rates can algorithms attain bounded packet latency, when adversaries are restricted to be able to activate at most one station per round. The rates of algorithms we present make the increasing sequence 1/3, 3/8 and 1/2 reflecting the additional features of algorithms. We show that no injection rate greater than 3/4 can be handled with bounded packet latency.
KW - Adversarial queuing
KW - Deterministic algorithm
KW - Distributed broadcast
KW - Multiple access channel
KW - Packet latency
KW - Stability
UR - http://www.scopus.com/inward/record.url?scp=84893007120&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893007120&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-03578-9_20
DO - 10.1007/978-3-319-03578-9_20
M3 - Conference contribution
AN - SCOPUS:84893007120
SN - 9783319035772
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 237
EP - 248
BT - Structural Information and Communication Complexity - 20th International Colloquium, SIROCCO 2013, Revised Selected Papers
T2 - 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013
Y2 - 1 July 2013 through 3 July 2013
ER -