Landmark based shortest path detection in alarm system | Zendy

Saad N. Alsaad | Zendy; Nadia Mahmood Hussien | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Landmark based shortest path detection in alarm system

Author(s) -

Saad N. Alsaad,

Nadia Mahmood Hussien

Publication year - 2018

Publication title -

al-mustansiriyah journal of science

Language(s) - English

Resource type - Journals

eISSN - 2521-3520

pISSN - 1814-635X

DOI - 10.23851/mjs.v29i2.276

Subject(s) - alarm , gsm , global positioning system , landmark , arduino , center (category theory) , computer science , phone , shortest path problem , mobile phone , real time computing , android (operating system) , manual fire alarm activation , computer security , engineering , telecommunications , embedded system , operating system , artificial intelligence , electrical engineering , graph , linguistics , chemistry , philosophy , theoretical computer science , crystallography

In this paper, an alarm system for four types of emergency states (explosion, car accident, earthquake and fire) is developed. This system divided in to two parts: transmitted part (Arduino, sensors, GSM, GPS), and emergency part (center site, sub center sites). Center site is included (Android phone, Server), Sub center sites (helping centers) represented the mobile phones of competent authorities like police center or hospital. The alerting in this system as a SMS message is sent by GSM. The system used Haversine formula to determine the nearest sub center from emergency state that receives the SMS alarm message from transmitted part. Also the path is tracked using Google map application.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research