z-logo
Premium
Satellite handover techniques for LEO networks
Author(s) -
Papapetrou E.,
Karapantazis S.,
Dimitriadis G.,
Pavlidou F.N.
Publication year - 2004
Publication title -
international journal of satellite communications and networking
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.388
H-Index - 39
eISSN - 1542-0981
pISSN - 1542-0973
DOI - 10.1002/sat.783
Subject(s) - handover , computer science , satellite , computer network , call blocking , communications satellite , satellite constellation , low earth orbit , service (business) , constellation , it service continuity , exploit , blocking (statistics) , real time computing , telecommunications , computer security , aerospace engineering , physics , economy , astronomy , engineering , economics
Abstract Low earth orbit satellite constellations could play an important role in future mobile communication networks due to their characteristics, such as global coverage and low propagation delays. However, because of the non‐stationarity of the satellites, a call may be subjected to handovers, which can be cell or satellite handovers. Quite many techniques have been proposed in the literature dealing with the cell handover issue. In this paper, a satellite handover procedure is proposed, that investigates and exploits the partial satellite diversity (namely, the existing common coverage area between contiguous satellites) in order to provide an efficient handover strategy, based always on a tradeoff of blocking and forced termination probabilities for a fair treatment of new and handover calls. Three different criteria were examined for the selection of a satellite. Each one of them could be applied either to new or handover calls, therefore we investigated nine different service schemes. A simulation tool was implemented in order to compare the different service schemes and simulation results are presented at the end of the paper. Copyright © 2004 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here