Mobility management in wireless cellular systems.
by Wing Ho Andy Yuen. === Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. === Includes bibliographical references (leaves 85-[90]). === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Design Issues in Wireless Cellular Systems --- p.1 === Chapter 1.1.1 --- Channel Assignment --- p...
Other Authors: | |
---|---|
Format: | Others |
Language: | English |
Published: |
1997
|
Subjects: | |
Online Access: | http://library.cuhk.edu.hk/record=b5889252 http://repository.lib.cuhk.edu.hk/en/item/cuhk-321939 |
Summary: | by Wing Ho Andy Yuen. === Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. === Includes bibliographical references (leaves 85-[90]). === Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Design Issues in Wireless Cellular Systems --- p.1 === Chapter 1.1.1 --- Channel Assignment --- p.2 === Chapter 1.1.2 --- Handoff --- p.3 === Chapter 1.1.3 --- Multiple Accesses --- p.3 === Chapter 1.1.4 --- Mobility Management --- p.4 === Chapter 1.2 --- Motivation of the thesis --- p.5 === Chapter 1.3 --- Outline of the thesis --- p.6 === Chapter 2 --- Background Studies --- p.9 === Chapter 2.1 --- Current Standards --- p.9 === Chapter 2.2 --- Mobility Models --- p.11 === Chapter 2.2.1 --- Fluid Flow Model --- p.12 === Chapter 2.2.2 --- Markovian model --- p.13 === Chapter 2.3 --- Dynamic versus Static Location Strategy --- p.14 === Chapter 2.4 --- Location Registration Strategies --- p.14 === Chapter 2.4.1 --- Time Based Strategy --- p.15 === Chapter 2.4.2 --- Geographic Based Strategy --- p.17 === Chapter 2.4.3 --- Distance Based Strategy --- p.18 === Chapter 2.4.4 --- Miscellaneous Strategies --- p.19 === Chapter 2.5 --- Summary --- p.20 === Chapter 3 --- Hybrid Bloom Filter Location Update Algorithm --- p.21 === Chapter 3.1 --- Introduction --- p.21 === Chapter 3.2 --- System Model --- p.22 === Chapter 3.3 --- Hybrid Bloom Filter Algorithm --- p.23 === Chapter 3.3.1 --- Location Update Protocol --- p.23 === Chapter 3.3.2 --- Paging Protocol --- p.25 === Chapter 3.4 --- Performance Evaluation --- p.27 === Chapter 3.4.1 --- Comparison of the hybrid and time based Bloom filter algorithms --- p.32 === Chapter 3.5 --- Numerical Studies --- p.33 === Chapter 3.5.1 --- Cost versus mobility --- p.34 === Chapter 3.5.2 --- Cost versus call arrival rate --- p.37 === Chapter 3.6 --- Summary --- p.39 === Chapter 4 --- A Dynamic Location Area Assignment Algorithm --- p.40 === Chapter 4.1 --- Geographic versus Distance Based Strategies --- p.41 === Chapter 4.2 --- System Model --- p.42 === Chapter 4.2.1 --- cell layout --- p.42 === Chapter 4.2.2 --- mobility model --- p.43 === Chapter 4.2.3 --- cost function --- p.44 === Chapter 4.3 --- Dynamic Location Area Assignment Algorithm --- p.45 === Chapter 4.3.1 --- Measurement --- p.46 === Chapter 4.3.2 --- "Computation of (iopt, jopt)" --- p.46 === Chapter 4.3.3 --- Computation of location area size k --- p.51 === Chapter 4.4 --- Numerical Studies --- p.52 === Chapter 4.5 --- Summary --- p.57 === Chapter 5 --- Paging Cost Reduction Using Bloom Filtering As Auxilliary Strategy --- p.64 === Chapter 5.1 --- Introduction --- p.64 === Chapter 5.2 --- A Case Study - Joint DLA-HBF Algorithm --- p.65 === Chapter 5.2.1 --- The Algorithm --- p.65 === Chapter 5.2.2 --- Performance Evaluation --- p.67 === Chapter 5.3 --- Summary --- p.68 === Chapter 6 --- Conclusion --- p.70 === Chapter 6.1 --- Summary of Results --- p.70 === Chapter 6.2 --- Future Research Directions --- p.71 === Appendix --- p.73 === Chapter A --- Optimality of the Hybrid Bloom Filter Algorithm --- p.73 === Chapter B --- Derivation of the Expected First Passage Time ExTi and EyTj --- p.77 === Chapter C --- Optimality of the Dynamic Location Area Algorithm --- p.81 === Bibliography --- p.85 |
---|