Loading...
Please wait, while we are loading the content...
An Optimal Partition Algorithm for Minimization of Paging Costs
| Content Provider | CiteSeerX |
|---|---|
| Author | Akyildiz, Ian E. Wang, Wenye Stuber, Gordon L. |
| Abstract | Abstract- A novel paging scheme under delay bounds is proposed for personal communication systems. This paging scheme is independent of the location probability distributions of the mobile users and satisfies the delay bounds, while minimizing the amount of bandwidth used for locating a mobile user. The proposed paging scheme includes the optimal partition algorithm and paging procedure with respect to paging costs and average delays. The numerical results demonstrate that our proposed scheme is very effective in the minimization of the paging costs for location probability conditions such as uniform and non-uniform distributions. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Location Probability Distribution Paging Cost Numerical Result Paging Scheme Personal Communication System Paging Procedure Average Delay Mobile User Delay Bound Optimal Partition Algorithm Non-uniform Distribution Location Probability Condition |
| Content Type | Text |
| Resource Type | Article |
