Data networks (2nd ed.)
Slotted Aloha as a game with partial information
Computer Networks: The International Journal of Computer and Telecommunications Networking
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 of N interacting queues in random-access systems
IEEE Transactions on Information Theory
Stability and delay of finite-user slotted ALOHA with multipacket reception
IEEE Transactions on Information Theory
Selfish users in energy constrained ALOHA systems with power capture
Wireless Networks
Hi-index | 0.00 |
We address the problem of non-cooperative random access of two nodes randomly transmitting packets to a single common receiver. We assume infinite buffer capacities and consider a general multi-packet reception channel that allows packet captures in the presence of multiple simultaneous transmissions. For separate cases of saturated or possibly emptying packet queues, we specify the random access transmission strategies in cooperative and non-cooperative equilibrium to optimize the achievable or stable throughput rates, transmission energy and delay costs. We follow a game-theoretic approach to compare the non-cooperative performance of selfish nodes with full cooperation in random or scheduled access. Finally, we present extensions to random access with each packet addressed to multiple receivers.