A Real-Time Algorithm for Tracking Astray Pilgrim based on in-Memory Data Structures
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 10
Abstract
Large crowd management presents a significant challenge to organizers and for the success of the event and to achieve the set objectives. One of the biggest events and with largest crowd in the world is the Muslim pilgrimage to Mecca that happens every year and lasts for five years. The event hosts over two million people from over 80 countries across the world with men, women, and children of various age groups and many languages. One of the challenges that faces the authorities in Saudi Arabia is that many of the pilgrims become astray during the event due to the relative complexity of the rituals mainly mountainous landscape and the language barrier. This result in them being unable to perform the required rituals on the prescribed time(s) with the possibility to invalidate the whole pilgrimage and jeopardize their once-in-a-life journey. Last year over 20,000 pilgrims went astray during the pilgrimage season. In this paper we present a tracking algorithm to help track, alarm, and report astray pilgrims. The algorithm is implemented on a server that contains pilgrims’ data such as geolocations, time stamp and personal information such as name, age, gender, and nationality. Each pilgrim is equipped with a wearable device to report the geolocations and the timestamp to the centralized server. Pilgrims are organized in groups of 20 persons at maximum. By identifying the distance of the pilgrim to its group’s centroid and whether or not the pilgrim’s geolocation is where it is supposed to be according to the pilgrimage schedule, the algorithm determines if the pilgrim is astray or on a verge of becoming astray. Algorithm complexity analysis is performed. For better performance and shorter real-time time to determine the pilgrim’s status, the algorithm employs an in-memory data structure. The analysis showed that the time complexity is O(n). The algorithm has also been tested using simulation runs based on synthesized data that is randomly generated within a specified geographical zone and according to the pilgrimage plan. The simulation results showed good agreement with the analytical performance analysis.
Authors and Affiliations
Mohammad A. R. Abdeen, Ahmad Taleb
Keywords
Related Articles
- EP ID EP408219
- DOI 10.14569/IJACSA.2018.091057
- Views 94
- Downloads 0
Solving Word Tile Puzzle using Bee Colony Algorithm
In this paper, an attempt has been made to solve the word tile puzzle with the help of Bee Colony Algorithm, in order to find maximum number of words by moving a tile up, down, right or left. Bee Colony Algorithm is a ty...
Improved Discrete Differential Evolution Algorithm in Solving Quadratic Assignment Problem for best Solutions
The combinatorial optimization problems are very important in the branch of optimization or in the field of operation research in mathematics. The quadratic assignment problem (QAP) is in the category of facilities locat...
Intelligent Model Conception Proposal for Adaptive Hypermedia Systems
The context of this article is to study and propose solutions for the major problems of adaptive hypermedia systems. In fact, the works and models proposed for these systems are made according to the tradition of studyin...
Enhanced Mechanism to Detect and Mitigate Economic Denial of Sustainability (EDoS) Attack in Cloud Computing Environments
Cloud computing (CC) is the next revolution in the Information and Communication Technology arena. CC is often provided as a service comparable to utility services such as electricity, water, and telecommunications. Clou...
Formalization of Behavior Change Theories to Accomplish a Health Behavior
The objective of this paper is to study theories behind behavior change and adaptation of behavior. Humans often live according to habitual behavior. Changing an existing behavior or adopting a new (healthier) behavior i...