Connections management strategies in satellite cellular networks /

• Κύριοι συγγραφείς: Benslama, Malek (Συγγραφέας), Kiamouche, Wassila (Συγγραφέας)
• Άλλοι συγγραφείς: Batatia, Hadj (Επιμελητής έκδοσης)
• Μορφή: Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: London : Hoboken, NJ : ISTE ; Wiley, 2015.
• Σειρά: Networks and telecommunications series.
• Θέματα: Artificial satellites in telecommunication.; Telecommunication systems.; TECHNOLOGY & ENGINEERING / Telecommunications; Electronic books.

This book provides a novel method based on advantages ofmobility model of Low Earth Orbit Mobile Satellite System LEO MSSwhich allows the evaluation of instant of subsequent handover of aMS even if its location is unknown. This method is then utilized topropose two prioritized handover schemes, Pseu...

Πίνακας περιεχομένων:

• Cover; Title Page; Copyright; Contents; Preface; Abbreviations; General Introduction; 1: Foundations of Satellite Networks; 1.1. Introduction; 1.2. Satellite orbits; 1.2.1. Characteristics of the ellipse; 1.2.2. Kepler's laws; 1.2.3. Orbital parameters for earth satellites; 1.2.4. Orbital perturbations; 1.2.5. Maintaining and surviving an orbit; 1.3. Time, time variation and coverage; 1.3.1. Geometric data; 1.3.2. Approximation of coverage; 1.3.3. Time interval between two successive intersatellite transfers; 1.3.4. Time and time variation; 1.4. Orbital paths; 1.4.1. GEO-type systems
• 1.4.2. Elliptical systems1.4.3. MEO-type systems; 1.4.4. LEO-type systems; 1.5. Characteristics of cellular satellite systems; 1.6. The advantages of LEO systems; 1.7. Handover in LEO satellite networks; 1.7.1. Link-layer handover; 1.7.2. Network-layer handover; 2: An Introduction to Teletraffic; 2.1. Introduction; 2.2. The history of teletraffic theory and technique; 2.2.1. Queuing theory; 2.2.2. Teletraffic theory; 2.3. Basic concepts; 2.3.1. The birth-death process; 2.3.2. Poisson process; 2.4. Erlang-B and Erlang-C models; 2.4.1. Blocking probability and the Erlang-B formula
• 2.4.2. Queuing probability and the Erlang-C formula3: Channel Allocation Strategies and the Mobility Model; 3.1. Introduction; 3.2. Channel allocation techniques; 3.2.1. Fixed channel allocation techniques; 3.2.2. Dynamic channel allocation techniques; 3.3. Spotbeam handover and priority strategies; 3.3.1. Spotbeam handover; 3.3.2. Priority strategies for handover requests; 3.3.2.1. Concepts of guaranteed handover; 3.3.2.2. Concepts of guaranteed priority to handover; 3.4. Mobility model; 3.5. Analysis of the mobility model; 4: Evaluation Parameters Method; 4.1. Introduction
• 4.2. The advantages of the LEO MSS mobility model4.3. Evaluation parameters method; 4.3.1. Position of the MU in the cell; 4.3.2. The moment the next handover request initializes; 4.3.3. Maximum queuing time; 4.4. Pseudo-last useful instant queuing strategy; 4.4.1. Putting handover requests in a queue; 4.4.2. Handover request management; 4.4.3. LUI queuing strategy; 4.4.4. Pseudo-LUI queuing strategy; 4.5. Guard channel strategy: dynamic channel reservation-like; 4.5.1. Dynamic channel reservation technique [DEL 95, KIA 11]; 4.5.2. Dynamic channel reservation DCR-like technique
• 5: Analytical Study5.1. Introduction; 5.2. An analysis of FCA-QH with different queuing strategies; 5.3. Analytical study of FCR and FCR-like; 5.3.1. An analysis of FCR; 5.3.2. An analysis of FCR-like; 6: The Rescuing System; 6.1. Introduction; 6.2. Fuzzy logic; 6.2.1. Definition of fuzzy subsets; 6.2.2. Decisions in the fuzzy environment; 6.3. The problem; 6.4. Rescuing system [DEL 99]; 7: Results and Simulation; 7.1. Introduction; 7.2. The (folded) simulated network; 7.3. Simulation results