25 citations · 70 across the 60 of their papers we have counts for
Showing 2022 · cs.ITShow all
2 papers · 2 filters
cs.IT2022
On d-ary tree algorithms with successive interference cancellation
Yash Deshpande, Cedomir Stefanovic, H. Murat Gürsu +1
In this paper, we outline the approach for the derivation of the length of the collision resolution interval for d-ary tree algorithms (TA) with gated access and successive interfe…
cs.IT2022
Deterministic Patterns for Multiple Access with Latency and Reliability Guarantees
Radosław Kotaba, Roope Vehkalahti, Čedomir Stefanović +2
We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shar…