Skip to main content
SpringerLink
Log in

Continuous spatial assignment of moving users

  • Regular Paper
  • Published:
The VLDB Journal Aims and scope Submit manuscript

Abstract

Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), there is currently no method for dynamic settings. In this paper, we consider the continuous assignment problem (CAP), where an optimal assignment must be constantly maintained between mobile users and a set of servers. The fact that the users are mobile necessitates real-time reassignment so that the quality of service remains high (i.e., their distance from their assigned servers is minimized). The large scale and the time-critical nature of targeted applications require fast CAP solutions. We propose an algorithm that utilizes the geometric characteristics of the problem and significantly accelerates the initial assignment computation and its subsequent maintenance. Our method applies to different cost functions (e.g., average squared distance) and to any Minkowski distance metric (e.g., Euclidean, L 1 norm, etc.).

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows: Theory, Algorithms, and Applications, 1st edn. Prentice Hall, Englewood Cliffs (1993)

    Google Scholar 

  2. Aurenhammer, F., Hoffman, F., Aronov, B.: Minkowski-type theorems and least-squares partitioning. In: Symposium on Computational Geometry, pp. 350–357 (1992)

  3. Balinski M.: Signature methods for the assignment problem. Oper. Res. 33, 527–537 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bertsekas D.: A new algorithm for the assignment problem. Math. Program. 21(1), 152–171 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bertsekas D.: The auction algorithm: a distributed relaxation method for the assignment problem. Ann. Oper. Res. 14(1), 105–123 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cai, Y., Hua, K.A., Cao, G.: Processing range-monitoring queries on heterogeneous mobile objects. In: MDM, pp. 27–38 (2004)

  7. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  8. Derigs U.: A shortest augmenting path method for solving minimal perfect matching problems. Networks 11(4), 379–390 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gablow H.N., Tarjan R.E.: Faster scaling algorithms for general graph matching problems. J. ACM 38(4), 815–853 (1991)

    Article  Google Scholar 

  10. Gale D., Shapley L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69, 9–15 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  11. Gedik B., Liu L.: Mobieyes: a distributed location monitoring service using moving location queries. IEEE Trans. Mob. Comput. 5(10), 1384–1402 (2006)

    Article  Google Scholar 

  12. Goldberg A.V., Kennedy R.: An efficient cost scaling algorithm for the assignment problem. Math. Program. 71(2), 153–177 (1995)

    Article  MathSciNet  Google Scholar 

  13. Hung M.: A polynomial simplex method for the assignment problem. Oper. Res. 31, 595–600 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  14. Hurley S.: Planning effective cellular mobile radio networks. IEEE Trans. Vehic. Technol. 51(2), 243–253 (2002)

    Article  Google Scholar 

  15. Kalashnikov D.V., Prabhakar S., Hambrusch S.E.: Main memory evaluation of monitoring queries over moving objects. Distrib. Parallel Databases 15(2), 117–135 (2004)

    Article  Google Scholar 

  16. Kang, J.M., Mokbel, M.F., Shekhar, S., Xia, T., Zhang, D.: Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In: ICDE, pp. 806–815 (2007)

  17. Korn, F., Muthukrishnan, S., Srivastava, D.: Reverse nearest neighbor aggregates over data streams. In: VLDB, pp. 814–825 (2002)

  18. Kuhn H.W.: The hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83–97 (1955)

    Article  Google Scholar 

  19. Lee, Y., Kim, K., Choi, Y.: Optimization of ap placement and channel assignment in wireless lans. In: LCN, pp. 831–836 (2002)

  20. Mokbel, M.F., Xiong, X., Aref, W.G.: Sina: Scalable incremental processing of continuous queries in spatio-temporal databases. In: SIGMOD Conference, pp. 623–634 (2004)

  21. Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: SIGMOD Conference, pp. 634–645 (2005)

  22. Mouratidis K., Papadias D., Bakiras S., Tao Y.: A threshold-based algorithm for continuous monitoring of k nearest neighbors. IEEE Trans. Knowl. Data Eng. 17(11), 1451–1464 (2005)

    Article  Google Scholar 

  23. Munkres J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32–38 (1957)

    Article  MATH  MathSciNet  Google Scholar 

  24. Murty K.: Network Programming, 1st edn. Prentice Hall, Englewood Cliffs (1992)

    Google Scholar 

  25. Orlin, J.B., Lee, Y.: Quickmatch: a very fast algorithm for the assignment problem. Working papers 3547-93, Massachusetts Institute of Technology (MIT), Sloan School of Management. Available at http://ideas.repec.org/p/mit/sloanp/2460.html (2003)

  26. Prabhakar S., Xia Y., Kalashnikov D.V., Aref W.G., Hambrusch S.E.: Query indexing and velocity constrained indexing: acalable techniques for continuous queries on moving objects. IEEE Trans. Comput. 51(10), 1124–1140 (2002)

    Article  MathSciNet  Google Scholar 

  27. Raniwala A., Gopalan K., Chiueh T.: Centralized channel assignment and routing algorithms for multi-channel wireless mesh networks. SIGMOBILE Mob. Comput. Commun. Rev. 8(2), 50–65 (2004)

    Article  Google Scholar 

  28. Spivey M.Z., Powell W.B.: The dynamic assignment problem. Transp. Sci. 38(4), 399–419 (2004)

    Article  Google Scholar 

  29. U, L.H., Yiu, M.L., Mouratidis, K., Mamoulis, N.: Capacity constrained assignment in spatial databases. In: SIGMOD (2008)

  30. Wong, R.C.W., Tao, Y., Fu, A.W.C., Xiao, X.: On efficient spatial matching. In: VLDB, pp. 579–590 (2007)

  31. Xia, T., Zhang, D.: Continuous reverse nearest neighbor monitoring. In: ICDE, p. 77 (2006)

  32. Xiong, X., Mokbel, M.F., Aref, W.G.: Sea-cnn: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: ICDE, pp. 643–654 (2005)

  33. Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: ICDE, pp. 631–642 (2005)

  34. Zhang, D., Du, Y., Xia, T., Tao, Y.: Progressive computation of the min-dist optimal-location query. In: VLDB, pp. 643–654 (2006)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong

    Leong Hou U & Nikos Mamoulis

  2. School of Information Systems, Singapore Management University, Singapore, 178902, Singapore

    Kyriakos Mouratidis

Authors
  1. Leong Hou U
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kyriakos Mouratidis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nikos Mamoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kyriakos Mouratidis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

U, L.H., Mouratidis, K. & Mamoulis, N. Continuous spatial assignment of moving users. The VLDB Journal 19, 141–160 (2010). https://doi.org/10.1007/s00778-009-0144-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00778-009-0144-3

Keywords

Search

Navigation