In this paper, two Markov chains are develop to analyze and compare the performance of two promising location update strategies; such as two location algorithm (TLA) and the forwarding and resetting algorithm (FRA). By utilizing the Markov chain, the what-if questions regarding the performance of personal communication service (PCS) networks under various workload conditions are given the answers. It also identify the conditions under which one strategy can perform better than the others.
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Electrical and Electronic Engineering