Email this article 
Open Access
Subscription or Fee Access
Enabling Volunteered Geographic Service Sharing for Emergency
Abstract
We provide techniques that enable the users to get a solution regarding issue based on their location and time they consume based on so-called Volunteered Geographic Services system. With this system user can clear their issue or doubts with the help of other user who are near and willing to answer user’s query. System needs user’s location to achieve this; so that other users can view the user’s query. And a user can remove the query from the system once they got solution regarding it. User can extend the area with time if they didn’t get a proper or satisfied solution. User can block the responding user if they found the as a fake. To achieve this we develop a admin module, who monitor the process and can remove the fake user from the system. Then query users need only notify the system when they exit their current safe zone. Existing safe-zone models fall short in the papers setting. The paper covers underlying concepts, properties, and algorithms, and it covers applications in VGS tracking and presents findings of empirical performance studies. User need to get the permission from the admin to get into the system. Timer will be set once the user upload a query and is passed to the entire user who is available in a covered area and the willing user can answer the query. The covered area will be enlarged for no response so that some other volunteer can answer for user’s query and time also increased. Once the response is received from the volunteer user can communicate with that particular user. If user found any fake responses from volunteer or volunteer found any fake responses from the user can block the respective person.
Keywords
References
K. Zheng, Y. Zheng, X. Xie, and X. Zhou, “Reducing uncertainty of low-sampling-rate trajectories,” in ICDE, 2012.
D. Pfoser and C. Jensen, “Capturing the uncertainty of moving-object representations,” in Advances in Spatial Databases, 1999.
R. Cheng, D. Kalashnikov, and S. Prabhakar, “Evaluating probabilistic queries over imprecise data,” SIGMOD, 2003.
X. Lian and L. Chen, “Efficient processing of probabilistic reverse nearest neighbor queries over uncertain data.” VLDBJ, 2009.
M. A. Cheema, X. Lin, W. Wang, W. Zhang, and J. Pei, “Probabilistic reverse nearest neighbor queries on uncertain data.” TKDE, 2010.
J. Xu and B. Zheng, “Energy efficient index for querying location dependent data in mobile broadcast environments,” ICDE, 2003.
S. Nutanong, R. Zhang, E. Tanin, and L. Kulik, “The V*-Diagram: a query-dependent approach to moving knn queries,” VLDB, 2008.
G. Albers et al, “Voronoi diagrams of moving points,” Intl. Journal on Computational Geometry and Applications, 1998.
C. Li, Y. Gu, J. Qi, G. Yu, R. Zhang, and Y. Wang, “Processing moving knn queries using influential neighbor sets,” PVLDB, 2015.
D. Wu, M. L. Yiu, C. S. Jensen, and G. Cong, “Efficient continuously moving top-k spatial keyword query processing,” ICDE, 2011.
D. Wu, M. L. Yiu, and C. S. Jensen, “Moving spatial keyword queries: Formulation, methods, and analysis,” TODS, 2013.
W. Huang, G. Li, K.-L. Tan, and J. Feng, “Efficient safe-region construction for moving top-k spatial keyword queries,” CIKM, 2012.
M. Kolahdouzan and C. Shahabi, “Voronoi-based k nearest neighbor search for spatial network databases,” in In VLDB, 2004, pp. 840–851.
A. Okabe, B. Boots, K. Sugihara, and S. Chiu, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, 2nd ed. Wiley, 2000.
G. Cong, C. S. Jensen, and D. Wu, “Efficient retrieval of the top-k most relevant spatial web objects,” PVLDB, 2009.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.