Multiuser Detection
On the throughput, capacity, and stability regions of random multiple access
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Stability, fairness, and performance: a flow-level study on nonconvex and time-varying rate regions
IEEE Transactions on Information Theory
Delay minimization in multiple access channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Stability of N interacting queues in random-access systems
IEEE Transactions on Information Theory
The stability region of the finite-user slotted ALOHA protocol
IEEE Transactions on Information Theory
Stability and delay of finite-user slotted ALOHA with multipacket reception
IEEE Transactions on Information Theory
Random Access Broadcast: Stability and Throughput Analysis
IEEE Transactions on Information Theory
Delay Optimal Transmission Policy in a Wireless Multiaccess Channel
IEEE Transactions on Information Theory
On the stability of interacting queues in a multiple-access system
IEEE Transactions on Information Theory - Part 1
Queue proportional scheduling via geometric programming in fading broadcast channels
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper, we investigate the stability and delay issues of a two-user multi-access channel at the bit level. The two users, have the option to transmit at a higher instantaneous rate separately, or to transmit simultaneously but at a lower individual instantaneous rate due to interference caused by concurrent transmissions. Traffic burstiness is considered by modeling random arrivals at the users, and the stability region in terms of bits/slot is derived. Further, we determine the condition under which the maximum stability region is achieved when the users always transmit if their queues are non-empty; in this case, the stability region is shown to be convex. Subsequently, we study the minimum delivery time problem where each user is allocated an initial amount of traffic volume to be sent to the destination. For any initial queue size vector, we explicitly characterize the optimal policy that empties the two users' queues within the shortest time.