SPEARS: Smart Phone Emergency and Accident Reporting System Using Social Network Service and Dijkstra’s Algorithm on Android

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 310)

Abstract

This paper presents research results on an efficient tool for emergency and accident reporting on Android smart phones with social network services. We have developed a location-aware Smart Phone Emergency and Accident Reporting System (SPEARS) for Facebook and Twitter users including agencies responsible for handling emergency situations and accidents. Agencies (e.g., police, fire departments, and hospitals) can store their locations via SPEARS, so that users involved in an emergency situation can retrieve the shortest path from the point of alert to the point of care, e.g. a hospital. On the other hand, agencies can retrieve the current location of the emergency via GPS and send help immediately. The shortest path is calculated by applying an improved Dijkstra’s algorithm and displayed on Google maps in appropriate scaling. Moreover, SPEARS supports the collection and statistical presentation of emergency and accident data for further analysis.

Keywords

Emergency Response System Android smart phone Dijkstra’s shortest path algorithm 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bresciani, S., Schmeil, A.: Social media platforms for social good. In: Proceedings of the 2012 6th IEEE International Conference on Digital Ecosystems and Technologies (DEST), Campione d’Italia, Italy, June 18-20 (2012)Google Scholar
  2. 2.
    Zach, L., Heverin, T.: Twitter for City Department Information Sharing (2010), http://www.asis.org/asist2010/proceedings/proceedings/ASIST_AM10/submissions/277_Final_Submission.pdf
  3. 3.
    Panahi, S., Delavar, M.R.: A GIS-based Dynamic Shortest Path Determination in Emergency Vehicles (2008), http://www.idosi.org/wasj/wasj3_(supplement%201)/14.pdfGoogle Scholar
  4. 4.
  5. 5.
    Machado, M.F.T., Nascimento, B.S., Vivacqua, A.S., Borges, M.R.S.: JEMF: A Framework for the Development of Mobile Systems for Emergency Management. In: Baloian, N., Burstein, F., Ogata, H., Santoro, F., Zurita, G. (eds.) CRIWG 2014. LNCS, vol. 8658, pp. 239–254. Springer, Heidelberg (2014)Google Scholar
  6. 6.
    Yu, L., Piyawongwisal, P., Handa, S., Liu, Y.: Going Beyond Citizen Data Collection with Mapster: A Mobile+Cloud Real-Time Citizen Science Experiment (2011), http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6130723
  7. 7.
    Okazaki, M., Sakaki, T., Matsuo, Y.: Earthquake Shakes Twitter User: Real-time Event Detection by Social Sensors (2010), http://ymatsuo.com/papers/www2010.pdf
  8. 8.
    Kanchanasut, K., Tunpan, A., Abdul Awal, M., Kumar Das, D., Wongsaardsakul, T., Tsuchimoto, Y.: DUMBONET: a multimedia communication system for collaborative emergency response operations in disaster-affected areas. International Journal of Emergency Management 4, 670–681 (2007)CrossRefGoogle Scholar
  9. 9.
    Meissner, A., Wang, Z., Putz, W., Grimmer, J.: MIKoBOS: A mobile information and communication system for emergency response. In: Proc. 3rd International ISCRAM Conference, Newark, New Jersey (2006)Google Scholar
  10. 10.
    Monares, A., Ochoa, S.F., Pino, J.A., Herskovic, V., Neyem, A.: MobileMap: A Collaborative Application to Support Emergency Situations in Urban Areas. In: Proc. of 13th International Conference on Computer Supported Cooperative Work in Design (CSCWD 2009), pp. 565–570. IEEE Press, Los Alamitos (2009)Google Scholar
  11. 11.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)MATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 303–318. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung, vol. 22, pp. 219–230. IfGI (2004)Google Scholar
  15. 15.
    Möhring, R.H., Schilling, H., Schütz, B., Wagner, D., Willhalm, T.: Partitioning graphs to speed up Dijkstra’s algorithm. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 189–202. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Department of Computer Science and Information Technology, Faculty of ScienceNaresuan UniversityPhitsanulokThailand
  2. 2.Department of Educational Technology and Communication, Faculty of EducationNaresuan UniversityPhitsanulokThailand

Personalised recommendations