Theory of maximum packing and related channel assignment strategies for cellular radio networks
Jaakob Kind,
Thomas Niessen and
Rudolf Mathar
Mathematical Methods of Operations Research, 1998, vol. 48, issue 1, 16 pages
Abstract:
The maximum packing (MP) policy for dynamic channel assignment in cellular radio communication systems specifies that a new call attempt is admitted whenever there is some way of rearranging channels so that every call can be carried. Otherwise the call is blocked and removed from the system. We investigate the state space of MP and show that its description is in general more complicated than assumed to date. Furthermore, we prove that MP performs better than any fixed channel allocation and any hybrid policy under light traffic conditions. Copyright Springer-Verlag Berlin Heidelberg 1998
Keywords: Key words: Dynamic channel assignment; fixed channel allocation; Markov processes; stationary distribution; blocking probability; interference graph; perfect graphs; asymptotic performance (search for similar items in EconPapers)
Date: 1998
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1007/PL00003991 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:48:y:1998:i:1:p:1-16
Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186
DOI: 10.1007/PL00003991
Access Statistics for this article
Mathematical Methods of Operations Research is currently edited by Oliver Stein
More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().