Optimal Meeting Point Notification for Moving groups of Users In Network Region

Authors

  • Vishal Pawar  KJEI's Trinity Academy of Engineering, Pune, Maharashtra, India
  • Hrishikesh Nikam  KJEI's Trinity Academy of Engineering, Pune, Maharashtra, India
  • Suraj Agarkar  KJEI's Trinity Academy of Engineering, Pune, Maharashtra, India
  • Snehal Jadhav  KJEI's Trinity Academy of Engineering, Pune, Maharashtra, India

Keywords:

Query processing, spatial databases, Shape, Processor, Architecture, Servers, Mobile Processor, Parallel Architecture.

Abstract

In Efficient notification of the meeting points for moving groups of user required time to call everyone to finalize the meeting point. This is the time consuming and costly process. They won’t be an essential need to call everyone for finalize the meeting point. User finds the meeting location exactly. Due to his particular safe region, with the help of Trilateration and Haversine algorithm brings to find location. Circular safe region of algorithm widely helps to find the user current location. The notification sends to all groups of users and users check the meeting point. After getting the alert from an application, particular user will be ready to reach that destination i.e. meeting point which is optimal in nature. Thus, to minimizing the communication frequency and also reducing the unnecessary computational work load at server.

References

  1. D. Papadias, Q. Shen, Y. Tao, and K. Mouratidis, Group nearest neighbor queries, in Proc. IEEE Int. Conf. Data Eng., 2004M. Young, The Technical Writer’s Handbook. Mill Valley, CA: University Science, 1989.
  2. R. Nicole, “Title of paper with only first word capitalized,” J. Name Stand. Abbrev., in press. H. G. Elmongui, M. F. Mokbel, and W. G. Aref, Continuous aggregate nearest neighbor queries, GeoInformatica, vol. 17, pp. 6395, 2011.
  3. M. A. Cheema, L. Brankovic, X. Lin, W. Zhang, and W. Wang, Multi-guarded safe zone: An effective technique to monitor moving circular range queries, in Proc. IEEE Int. Conf. Data Eng., 2010, pp. 189200.
  4. X. Yu, K. Q. Pu, and N. Koudas, Monitoring k-nearest neighbor queries over moving objects, in Proc. IEEE Int. Conf. Data Eng., 2005, pp. 631642.
  5. Y. Tao, D. Papadias, and Q. Shen, Continuous nearest neighbor search, in Proc. 28th Int. Conf. Very Large Data Bases, 2002, pp. 287298.
  6. M. L. Yiu, L. H. U, S. Saltenis, and K. Tzoumas, Efficient proximity detection among mobile users via self-tuning policies, Proc. VLDB Endowment, vol. 3, no. 1, 2010, pp. 985996.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2017-06-30

Issue

Volume 2, Issue 3, May-June-2017

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Vishal Pawar, Hrishikesh Nikam, Suraj Agarkar, Snehal Jadhav, " Optimal Meeting Point Notification for Moving groups of Users In Network Region, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 2, Issue 3, pp.124-126, May-June-2017.