Performance analysis of dynamic and fixed channel allocation techniques in a LEO constellation with an "Earth-fixed cell" system

Boukhatem, Lila; Beylot, André‐Luc; Gaïti, Dominique; Pujolle, Guy

doi:10.1109/glocom.2000.891316

Cited by 5 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If additionally the handoff traffic is zero, we again obtain the Erlang-e forrnula. From (8) and (9) we can derive the following relation between both probabilities: (10) Usually the total number of voice channels available in the satellite is relatively !arge, leading to numerical difficulties in the evaluation of the perforrnance measures. Thus, it is necessary to introduce recursive procedures in order to avoid overflow problems caused by the direct computation of large powers and factorials.…”

Section: Waiting Probability Of New Callsmentioning

confidence: 99%

“…One way to support voice comrhunications with mobile and personal terminals is by means of a cellular wireless network implemented as a constellation of LEO (Low Earth Orbit) satellites [7][8][9][10][11]. In essence, these systems are sirnilar to the terrestrial ones, but they have to cope with the specific problems that arise when base stations are orbiting at a non-fixed apparent position around the earth.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Computing Call Dropping and Waiting Probabilities in LEO Satellite Systems for Voice Communications

Galmés

Puigjaner

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper we propose and analyze a call management architecture for a cell in a satellite cellular network, where handoff arrivals are prioritized by using a number of guard channels and only new calls are temporarily buffered if necessary. The idea behind this is to avoid any extra delay during handoff procedures, in addition to the intrinsic round trip propagation time, since it might cause severe user dissatisfaction. The analysis is based on a Markov chain model of a single spot (cell) and yields exact expressions for the dropping and waiting probabilities of handoff and new arrivals respectively. Then, we derive an efficient algorithm to evaluate these probabilities, which is based on the well-known Erlang-B formula and its recursion. Finally, we use the expressions for the waiting and dropping probabilities to formulate and solve an optimization problern in the context of network planning. Numerical results are provided.

show abstract

Section: Waiting Probability Of New Callsmentioning

confidence: 99%