Throughput and delay analysis of an opportunistic tree algorithm

DOI10.1080/15326349.2015.1069202MaRDI QIDQ2803401zbMATH OpenOpenAlexFDO

Authors Richard F. Block, Benny Van Houdt

Publication date 4 May 2016

Published in Stochastic Models (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/10067/1339240151162165141

zbMATH Keywords

delayrandom accesscognitive radiotree algorithmsmaximum stable throughput

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Recommendations

• Modeling and analysis for opportunistic spectrum access
• Opportunistic spectrum access in self-similar primary traffic
• Performance analysis of cognitive network with primary and secondary channels
• High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
• Performance analysis of binary exponential backoff MAC protocol for cognitive radio in the IEEE 802.16e/m network

Cites work

• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
• Information theory and communication networks: an unconsummated union
• NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
• On the Maximum Stable Throughput of Tree Algorithms With Free Access
• Performance evaluation of a production/inventory system with periodic review and endogenous lead times
• STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
• Solving nonlinear matrix equations arising in tree-like stochastic processes.
• Splitting protocols in presence of capture
• The quasi-birth-death type markov chain with a tree structure
• Tree algorithms for packet broadcast channels

This page was built for publication: Throughput and delay analysis of an opportunistic tree algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803401)