By Topic

Computing call-blocking probabilities in LEO satellite networks: the single-orbit case

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zaim, A.H. ; Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA ; Rouskas, G.N. ; Perros, H.G.

We study the problem of carrying voice calls over a low-Earth-orbit satellite network and present an analytical model for computing call-blocking probabilities for a single orbit of a satellite constellation. We have devised a method to solve the corresponding Markov process efficiently for orbits of up to five satellites. For orbits consisting of a larger number of satellites, we have developed an approximate decomposition algorithm to compute the call-blocking probabilities by decomposing the system into smaller subsystems and iteratively solving each subsystem in isolation using the exact Markov process. Our approach can capture blocking due to handoffs for both satellite-fixed and Earth-fixed constellations. Numerical results demonstrate that our method is accurate for a wide range of traffic patterns and for orbits with a number of satellites that is representative of commercial satellite systems

Published in:

Vehicular Technology, IEEE Transactions on  (Volume:51 ,  Issue: 2 )