Skip to main content
Log in

Analysis of a mobile-assisted adaptive location management strategy

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Source messages intended for a mobile host can be routed in one of two ways. Either the source knows the direct route to the mobile host, and is informed of all location changes by the mobile host (informed routing), or the source directs messages to a home agent that forwards messages to the mobile host (triangle routing). When the rate at which the mobile host changes location and the rate at which messages are directed to the mobile host are known and fixed, we show that the optimal routing policy is described by a threshold rule that depends on the normalized differential cost of the routing techniques and the ratio of the source messaging to location update rates. Since thiscall to mobility ratio may not be knowna priori or may change slowly with time, we also derive an adaptive policy selection algorithm. The policy is derived from a maximum likelihood estimate of the call to mobility ratio based on observations of message arrivals and location changes. The algorithm is found to work well when there is a clear advantage to either triangle or informed routing. However, when the two routing schemes are relatively close in average cost, the algorithm performance is degraded by repeated policy reversals. For this reason, algorithms which use hysteresis and/or a preset preference (preference threshold) for one routing scheme or another were explored. It was found that neither hysteresis, nor preference threshold techniques alone performed well, but rather a combination of the two resulted in greatly improved performance for a wide range of values of the call to mobility ratio.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. T. Blackwell et al., Secure short-cut routing for mobile IP,USENIX Summer 1994 Technical Conference (June 1994).

  2. F. Teraoka and M. Tokoro, Host migration transparency in IP networks: The VIP approach, ACM Computer Commun. Rev. (Jan. 1993) 45–65.

  3. J. Ionnidis and G.Q. Maguire Jr., The design and implementation of a mobile networking architecture,USENIX Winter 1993 Technical Conference (Jan. 1993) pp. 498–500.

  4. W.A. Simpson, IP mobility support, Mobile IP Working Group, IETF Internet Draft (May 1994).

  5. C. Perkins and Y. Rekhter, Optimal routing for mobile hosts using IPs loose source route option, Internet draft (Oct. 1992).

  6. T. Imielinski and B. Badrinath, Querying in highly mobile environments,18th Proc. VLDB (Aug. 1992).

  7. S. Rajagopalan and B.R. Badrinath, Adaptive location management for Mobile-IP,Proc. 1st ACM Mobicom 95 (Nov. 1995).

  8. S. Rajagopalan, An adaptive location management scheme for mobile internetworking, Master's Thesis, Rutgers University (Jan. 1995).

  9. R. Jain, Y.-B. Lin, C. Lo and S. Mohan, A caching strategy to reduce network impacts of PCS, IEEE J. Select. Areas Commun. 12(8) (1994), 1434–1444.

    Google Scholar 

  10. Y.-B. Lin, Determining the user locations for personal communications services networks, IEEE Trans. Veh. Tech. 43(3) (1994) 466–473.

    Google Scholar 

  11. Y. Huang, P. Sistla and O. Wolfson, Data replication for mobile computers,Proc. ACM-SIGMOD (1994) pp. 13–24.

  12. O. Wolfson and S. Jajodia, Distributed algorithms for dynamic replication of data,Proc. ACM-PODS (1992).

  13. O. Wolfson and S. Jajodia, An algorithm for dynamic data distribution,Proc. 2nd Workshop on Management of Replicated Data (WMRD-II) (1992) pp. 62–65.

  14. P.J. Denning, The working set model for program behavior, Commun. ACM, II(5) (1968) 323–333.

    Google Scholar 

  15. H. Xie, S. Tabbane and D.J. Goodman, Dynamic location area management and performance analysis,Proc. IEEE Vehicular Technology Conference (1993).

  16. A. Bar-Noy and I. Kessler, Tracking mobile users in wireless networks,INFOCOM'93, San Fransisco, CA (March 1993) pp. 1232–1239.

  17. W. Wang, R.N. Saadawi and K-i Aihara, Bandwidth allocation for atm networks,IEEE Int. Conf. on Communications — ICC'90 (1990) pp. 439–442.

  18. C. Rose and R. Yates, Minimizing the average cost of paging under delay constraints, Wireless Networks 1 (1995) 211–219.

    Google Scholar 

  19. C. Rose, State-based paging/registration: A greedy technique, Winlab-TR 92, Rutgers University, submitted to IEEE Trans. Veh. Tech.

  20. C. Rose, Minimization of paging and registration costs through registration deadlines,IEEE/ICC'95, Seattle (1995) pp. 735–739.

  21. C. Rose, Minimizing the average cost of paging and registration: A timer-based method, Wireless Networks 2 (1996) 109–116.

    Google Scholar 

  22. S.M. Ross,Stochastic Processes (Wiley, New York, 1983).

    Google Scholar 

  23. A. Papoulis, Probability,Random Variables, and Stochastic Processes (McGraw-Hill, New York, 3rd ed., 1991).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yates, R., Rose, C., Rajagopalan, S. et al. Analysis of a mobile-assisted adaptive location management strategy. Mobile Netw Appl 1, 105–112 (1996). https://doi.org/10.1007/BF01193331

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01193331

Keywords