TY - GEN
T1 - Joint estimation and contention-resolution protocol for wireless random access
AU - Stefanovic, Cedomir
AU - Trillingsgaard, Kasper Fløe
AU - Kiilerich Pratas, Nuno
AU - Popovski, Petar
PY - 2013
Y1 - 2013
N2 - We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation of the number of users and resolution of their transmissions. The users independently access the wireless link on a slot basis with a predefined probability, resulting in a distribution of user transmissions over slots, based on which the estimation and contention resolution are performed. Specifically, the contention resolution is performed using successive interference cancellation which, coupled with the use of the optimized access probabilities, enables throughputs that are substantially higher than the traditional slotted ALOHA-like protocols. The key feature of the proposed protocol is that the round durations are not a priori set and they are terminated when the estimation/contention-resolution performance reach the satisfactory levels.
AB - We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation of the number of users and resolution of their transmissions. The users independently access the wireless link on a slot basis with a predefined probability, resulting in a distribution of user transmissions over slots, based on which the estimation and contention resolution are performed. Specifically, the contention resolution is performed using successive interference cancellation which, coupled with the use of the optimized access probabilities, enables throughputs that are substantially higher than the traditional slotted ALOHA-like protocols. The key feature of the proposed protocol is that the round durations are not a priori set and they are terminated when the estimation/contention-resolution performance reach the satisfactory levels.
KW - access protocols;interference suppression;radio access networks;radio links;contention-based random-access protocol;contention-resolution protocol;equal-duration slot;estimation-contention-resolution performance;interference cancellation;slotted ALOHA-lik
U2 - 10.1109/ICC.2013.6655070
DO - 10.1109/ICC.2013.6655070
M3 - Article in proceeding
SN - 978-1-4673-3122-7
T3 - I E E E International Conference on Communications
SP - 3382
EP - 3387
BT - Communications (ICC), 2013 IEEE International Conference on
PB - IEEE
T2 - 2013 IEEE International Conference on Communications (ICC)
Y2 - 9 June 2013 through 13 June 2013
ER -