Broadcasting in Ad Hoc Multiple Access Channels

DOI10.1007/978-3-319-03578-9_20zbMath1406.68011arXiv1306.6109OpenAlexW2571390079MaRDI QIDQ2868648

Lakshmi Anantharamu, Bogdan S. Chlebus

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.6109

zbMATH Keywords

stabilitydeterministic algorithmmultiple access channelpacket latencydistributed broadcastadversarial queuing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Related Items (1)

Scalable wake-up of multi-channel single-hop radio networks

Cites Work

• On delivery times in packet networks under adversarial traffic
• Upper bound on the capacity of a random multiple-access system
• Ergodicity of a slotted ALOHA system
• Maximum throughput of multiple access channels in adversarial environments
• Adversarial queuing theory
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels
• DYNAMIC SHARING OF A MULTIPLE ACCESS CHANNEL
• Adversarial Queuing on the Multiple Access Channel
• A perspective on multiaccess channels
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Stochastic Contention Resolution With Short Delays
• A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
• Analysis of Backoff Protocols for Multiple Access Channels
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Contention resolution with constant expected delay

This page was built for publication: Broadcasting in Ad Hoc Multiple Access Channels