A New Combinatorial Approach to the State Space of Cellular Mobile Communication Systems

摘要

We present an analytical method by which details of the state space of a cellular mobile communication system employing dynamic channel assignment can be derived. The approach is taken purely from combinatorics; hence it is exact. It can also be used to compute system performance measures such as call and handover blocking probabilities and mean number of calls in progress in a cell at a particular traffic density. Our method is illustrated on a simple cellular system before it is generalised for a system with arbitrarily many cells and channels. It is found that each cellular system can be uniquely characterised by a generator-polynomial which contains all the information about the state space ofthat system.