IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v43y1995i1p33-42.html
   My bibliography  Save this article

Modeling Handovers in Cellular Mobile Networks with Dynamic Channel Allocation

Author

Listed:
  • D. L. Pallant

    (University of Adelaide, Adelaide, Australia)

  • P. G. Taylor

    (University of Adelaide, Adelaide, Australia)

Abstract

A model for a cellular mobile network is given which uses the dynamic channel allocation strategy proposed by Everitt and Macfadyen (Everitt, D. E., N. W. Macfadyen. 1983. Analysis of multicellular mobile radiotelephone systems with loss. British Telecom. Tech. J. 1 37–45.). In this model, handovers of calls from one cell to another are explicitly included. The equilibrium distribution of this network is shown to have product form under certain reversibility conditions. The conditions are restrictive and are, perhaps, unlikely to hold in practical models. However, their study does provide insight into the behavior of cellular systems with dynamic channel allocation. Using the product-form equilibrium distribution we are able to express the blocking probability for new calls, and the blocking probability for handover calls in terms of appropriate normalizing constants. The model is also extended to allow directed retry for handovers in which blocked handover attempts may try to gain access via another cell. This provides differential service for handovers. Again, some reversibility conditions ensure product form, and the blocking probabilities for both new and handover calls are given in terms of normalizing constants.

Suggested Citation

  • D. L. Pallant & P. G. Taylor, 1995. "Modeling Handovers in Cellular Mobile Networks with Dynamic Channel Allocation," Operations Research, INFORMS, vol. 43(1), pages 33-42, February.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:1:p:33-42
    DOI: 10.1287/opre.43.1.33
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.1.33
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.1.33?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Richard J. Boucherie & Nico M. van Dijk, 2000. "On a Queueing Network Model for Cellular Mobile Telecommunications Networks," Operations Research, INFORMS, vol. 48(1), pages 38-49, February.
    2. van Dijk, Nico M., 2008. "Error bounds for state space truncation of finite Jackson networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 164-181, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:43:y:1995:i:1:p:33-42. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.