Abstract

Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end delay, bandwidth utilization, and connection dropping probability. In this paper, we study cost minimization for locating mobile users under delay constraints in mobile wireless networks. Specifically, a new location tracking algorithm is developed to determine the position of mobile terminals under delay constraints, while minimizing the average locating cost based on a unimodal property. We demonstrate that the new algorithm not only results in minimum locating cost, but also has a lower computational complexity compared to existing algorithms. Furthermore, detailed searching procedures are discussed under both deterministic and statistic delay bounds. Numerical results for a variety of location probability distributions show that our algorithm compares favorably with existing algorithms.

Keywords: Wireless networks; Location tracking; Partition; Optimization

Article Outline

1. Introduction

2. Problem formulation

3. Optimal partition under deterministic delay constraints

3.1. Optimal partition into two SAs

3.2. Optimal partition into SAs

4. Optimal partition algorithm under statistic delay constraint

4.1. Location tracking algorithm under statistic delay constraint

4.2. Sequential matching algorithm

5. Performance evaluation

6. Numerical results

6.1. Locating cost and delay for uniform probability distribution

6.2. Locating cost and delay for truncated Gaussian distribution

6.3. Locating cost and delay for irregular probability distribution

6.4. Computation complexity

7. Conclusions

Acknowledgements

References

Vitae