In mobile communications networks, a location management scheme is responsible for tracking mobile users. Typically, a location management scheme consists of a location update scheme and a paging scheme. Gau and Haas first proposed the concurrent search(CS) approach that could simultaneously locate a number of mobile users in mobile communications networks. We propose to use the theory of the discrete-time Markov chain to analyze the performance of the concurrent search approach. In particular, we concentrate on the worst case in which each mobile user appears equally likely in all the cells of the network. We analyze the average paging delay, the call blocking probability and the system size. We show that our analytical results are consistent with the simulation results of the concurrent search.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0724104-144720 |
| Date | 24 July 2004 |
| Creators | Chen, Hsin-chou |
| Contributors | Wei-Kuang Lai, Chun-Hung Richard Lin, Tsang-Ling Sheu, Rung-Hung Gau |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0724104-144720 |
| Rights | unrestricted, Copyright information available at source archive |
Page generated in 0.0028 seconds