Data networks
Random Multiple Access Algorithms Using a Control Mini-Slot
IEEE Transactions on Computers
A review of contention resolution algorithms for IEEE 802.14 networks
IEEE Communications Surveys & Tutorials
Information theory and communication networks: an unconsummated union
IEEE Transactions on Information Theory
-ary collision resolution algorithms in random-access systems with free or blocked channel access
IEEE Transactions on Information Theory
SICTA Modifications with Single Memory Location and Resistant to Cancellation Errors
NEW2AN '08 / ruSMART '08 Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Conflict-resolving tree algorithm stable to incomplete interference damping
Automation and Remote Control
Improved high maximum stable throughput FCFS tree algorithms with interference cancellation
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
On the maximum stable throughput of tree algorithms with free access
IEEE Transactions on Information Theory
Interference cancellation tree algorithms with κ-signal memory locations
IEEE Transactions on Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.06 |
Tree algorithms are a well studied class of collision resolution algorithms for solving multiple access control problems. Successive interference cancellation, which allows one to recover additional information from otherwise lost collision signals, has recently been combined with tree algorithms with blocked access [Y. Yu, G.B. Giannakis, SICTA: A 0.693 contention tree algorithm using successive interference cancellation, in: INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Miami, USA, 2005, pp. 1908-1916], providing a substantially higher maximum stable throughput (MST): 0.693 for Poisson arrivals, given an infinite number of memory locations for storing signals. We propose a novel tree algorithm for a similar problem, but with two relaxed model assumptions: free access is supported and a single signal memory location suffices. A study of the maximal stable throughput of this algorithm is provided using matrix analytical methods; as a result, an MST of 0.5698 for Poisson arrivals is achieved. Our methodology also allows us to investigate the MST when the multiple access channel is subject to Markovian arrival processes.