In this paper, we develop a new class of medium access control protocol, which allows each user to transmit at different data rates chosen randomly from an appropriately determined set of rates. By using successive interference cancellation, multiple packets can be received simultaneously. In slotted Aloha type Gaussian networks, we show that the achievable total throughput of the proposed protocol is at least a constant fraction of the mac sum rate when the number of transmission rates at each node is equal to the number of users in the network. We also study the case when only a limited number of transmission rates is available at each node. Extension to rate splitting is discussed. Simulation results show that the proposed protocol can a...
In this paper, a dynamic access probability adjustment strategy for coded random access schemes base...
Ad hoc networks offer infrastructure free operation, where no entity can provide reliable coordinati...
This paper presents finite-blocklength achievabil- ity bounds for the Gaussian multiple access chann...
Multiuser diversity refers to a type of diversity present across different users in a fading environ...
This paper presents a random access protocol assisted by a set of signal processing tools that signi...
Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research...
Providing ultra-reliable, low-latency and massive access is a technical challenge that demands a red...
In order to improve the throughput performance of Medium Access Control (MAC) schemes in wireless co...
Random access represents possibly the simplest and yet one of the best known approaches for sharing...
Motivated by the analogy between successive interference cancellation and iterative belief-propagati...
We consider a random access network in which K nodes wish to send independent packets to an access p...
8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.This pap...
8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.This pap...
Abstract—We study cross-layer design in random access based fixed wireless multihop networks under a...
In this paper, a dynamic access probability adjustment strategy for coded random access schemes base...
In this paper, a dynamic access probability adjustment strategy for coded random access schemes base...
Ad hoc networks offer infrastructure free operation, where no entity can provide reliable coordinati...
This paper presents finite-blocklength achievabil- ity bounds for the Gaussian multiple access chann...
Multiuser diversity refers to a type of diversity present across different users in a fading environ...
This paper presents a random access protocol assisted by a set of signal processing tools that signi...
Various applications of wireless Machine-to-Machine (M2M) communications have rekindled the research...
Providing ultra-reliable, low-latency and massive access is a technical challenge that demands a red...
In order to improve the throughput performance of Medium Access Control (MAC) schemes in wireless co...
Random access represents possibly the simplest and yet one of the best known approaches for sharing...
Motivated by the analogy between successive interference cancellation and iterative belief-propagati...
We consider a random access network in which K nodes wish to send independent packets to an access p...
8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.This pap...
8th International Workshop on Multiple Access Communications (MACOM2015), Helsinki, Finland.This pap...
Abstract—We study cross-layer design in random access based fixed wireless multihop networks under a...
In this paper, a dynamic access probability adjustment strategy for coded random access schemes base...
In this paper, a dynamic access probability adjustment strategy for coded random access schemes base...
Ad hoc networks offer infrastructure free operation, where no entity can provide reliable coordinati...
This paper presents finite-blocklength achievabil- ity bounds for the Gaussian multiple access chann...