Theory of maximum packing and related channel assignment strategies for cellular radio networks

DOI10.1007/PL00003991zbMath0940.90019MaRDI QIDQ1298727

Rudolf Mathar, Jaakob Kind, Thomas Niessen

Publication date: 25 July 2000

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

Markov processesstationary distributionperfect graphsblocking probabilityasymptotic performanceinterference graphdynamic channel assignmentfixed channel allocation

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Markov and semi-Markov decision processes (90C40)

Related Items (3)

Induced \(H\)-packing \(k\)-partition number for certain nanotubes and chemical graphs ⋮ Induced \(H\)-packing \(k\)-partition problem in certain carbon based nanostructures ⋮ CELLULAR LEARNING AUTOMATA BASED DYNAMIC CHANNEL ASSIGNMENT ALGORITHMS

This page was built for publication: Theory of maximum packing and related channel assignment strategies for cellular radio networks