A Real-Time Algorithm for Tracking Astray Pilgrim based on in-Memory Data Structures

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced computer science & applications Vol. 9; no. 10
Main Authors: Abdeen, Mohammad A.R., Taleb, Ahmad
Format: Journal Article
Language:English
Published: West Yorkshire Science and Information (SAI) Organization Limited 2018
Subjects:
Algorithms
Centroids
Complexity
Data structures
Pilgrimages
Pilgrims
Real time
Tracking
Wearable technology
ISSN:2158-107X, 2156-5570
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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.
AbstractList 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.
Author Abdeen, Mohammad A.R.
Taleb, Ahmad
Author_xml – sequence: 1
  givenname: Mohammad A.R.
  surname: Abdeen
  fullname: Abdeen, Mohammad A.R.
– sequence: 2
  givenname: Ahmad
  surname: Taleb
  fullname: Taleb, Ahmad
BookMark eNotkEtPwzAQhC1UJErpL-BiiXOKH_HrGJVXURGIBombZbtuSUnjYieH_ntCw1x2Rhrtar9LMGpC4wG4xmiGc8bV7eK5mK-KGUFYzpDCiIkzMCaY8YwxgUYnLzOMxOcFmKa0Q72oIlzSMSgL-O5NnZXV3sOi3oZYtV97uAkRltG476rZwiK10RzhW1VvY7WH1iS_hqGBVZO9-H2IR3hnWgNXbexc20WfrsD5xtTJT__nBHw83Jfzp2z5-riYF8vMEUHazGLpuRBWKYaJxV4SL_tgLZEKOcSdFBIxK4SkxmFlvMnXglJDLc-dxGs6ATfD3kMMP51Prd6FLjb9SU044znNVa76Fh1aLoaUot_oQ_-GiUeNkT4R1ANB_UdQDwTpL8uFZHs
ContentType Journal Article
Copyright 2018. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2018. This work is licensed under https://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
3V.
7XB
8FE
8FG
8FK
8G5
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
GUQSH
HCIFZ
JQ2
K7-
M2O
MBDVC
P5Z
P62
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.14569/IJACSA.2018.091057
DatabaseName CrossRef
ProQuest Central (Corporate)
ProQuest Central (purchase pre-March 2016)
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
Research Library (Alumni)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central Korea
ProQuest Central Student
ProQuest Research Library
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Research Library
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
Proquest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Publicly Available Content Database
Research Library Prep
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Research Library
ProQuest Central (New)
Advanced Technologies & Aerospace Collection
ProQuest Central Basic
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: ProQuest Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2156-5570
ExternalDocumentID 10_14569_IJACSA_2018_091057
GroupedDBID .DC
5VS
8G5
AAYXX
ABUWG
ADMLS
AFFHD
AFKRA
ALMA_UNASSIGNED_HOLDINGS
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
CITATION
DWQXO
EBS
EJD
GNUQQ
GUQSH
HCIFZ
K7-
KQ8
M2O
OK1
PHGZM
PHGZT
PIMPY
PQGLB
RNS
3V.
7XB
8FE
8FG
8FK
JQ2
MBDVC
P62
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c272t-b18e677b99512b1e82e8b99bb2890c06c87805b7783ac19aea4d733a3b64c81d3
IEDL.DBID P5Z
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000454189600057&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2158-107X
IngestDate Sun Jul 13 05:09:44 EDT 2025
Sat Nov 29 06:19:57 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Issue 10
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c272t-b18e677b99512b1e82e8b99bb2890c06c87805b7783ac19aea4d733a3b64c81d3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
OpenAccessLink https://www.proquest.com/docview/2656434949?pq-origsite=%requestingapplication%
PQID 2656434949
PQPubID 5444811
ParticipantIDs proquest_journals_2656434949
crossref_primary_10_14569_IJACSA_2018_091057
PublicationCentury 2000
PublicationDate 2018-00-00
PublicationDateYYYYMMDD 2018-01-01
PublicationDate_xml – year: 2018
  text: 2018-00-00
PublicationDecade 2010
PublicationPlace West Yorkshire
PublicationPlace_xml – name: West Yorkshire
PublicationTitle International journal of advanced computer science & applications
PublicationYear 2018
Publisher Science and Information (SAI) Organization Limited
Publisher_xml – name: Science and Information (SAI) Organization Limited
SSID ssj0000392683
Score 2.035469
Snippet 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...
SourceID proquest
crossref
SourceType Aggregation Database
Index Database
SubjectTerms Algorithms
Centroids
Complexity
Data structures
Pilgrimages
Pilgrims
Real time
Tracking
Wearable technology
Title A Real-Time Algorithm for Tracking Astray Pilgrim based on in-Memory Data Structures
URI https://www.proquest.com/docview/2656434949
Volume 9
WOSCitedRecordID wos000454189600057&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 2156-5570
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000392683
  issn: 2158-107X
  databaseCode: P5Z
  dateStart: 20100101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 2156-5570
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000392683
  issn: 2158-107X
  databaseCode: K7-
  dateStart: 20100101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2156-5570
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000392683
  issn: 2158-107X
  databaseCode: BENPR
  dateStart: 20100101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Publicly Available Content Database
  customDbUrl:
  eissn: 2156-5570
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000392683
  issn: 2158-107X
  databaseCode: PIMPY
  dateStart: 20100101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  customDbUrl:
  eissn: 2156-5570
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000392683
  issn: 2158-107X
  databaseCode: M2O
  dateStart: 20100101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwEB2xHbiwI9bKB44YstV2TihsYlFLxCIVLlHsOFAJ0tIWJP6emSRluXDhEimyZEUztt_z2HkPYAc5Q5i6meHGzwUPRJ7x0ASSm6xpnRy3LUrnpdmEbLdVpxPGdcFtWF-rHK-J5UKd9QzVyPc9JB5BqaVy0H_l5BpFp6u1hcYkTJNKAlk3xM2HrxqLg-AvSiVObCQVU9mphYeQNoT75xfR0U1E17vUHsEmQdRPcPq9NpeAczr_309dgLmaarKoGhuLMGGLJZgf2ziwelYvw23ErpEucvobhEXPj9jV6OmFIZtliGSGauksoorIB4u7z4-D7gsj7MtYr2Ddgrforu4HO05HKbsp1WjfcAu_AnenJ7dHZ7w2W-DGk96Ia1dZIaUOkXJ52rXKswpftKaTSOMIo8j9QEup_NS4YWrTIJO-n_paBAZJr78KU0WvsGvAHC00srSm46dh4FlHaeFmgRXIRPJQC7sOu-MoJ_1KUyOhvQglJamSklBSkiop67A1DnNST7Bh8h3jjb-bN2GW-qqqJlswhXGw2zBj3kfd4aAB04cn7fi6AZOXkuOz5V01yjGELfF5K77_BHJAyzk
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3JTuQwEC2xScxl2DUwDPgANwzZsJ0DGkUsomloIWikvoXYcaAlSEN3z6D-Kb6RqiwsF24cOEaRosT1Uu-5bL8C2EDNECZuarjxM8EDkaU8NIHkJt21TobTFqWzotmEbLVUpxOej8FzfRaGtlXWObFI1GnPUI18x0PhERReKn8fHjl1jaLV1bqFRgmLph094ZRtsNc4wPhuet7RYXv_mFddBbjxpDfk2lVWSKlD1Baedq3yrMILrWnJzTjCKLL511IqPzFumNgkSKXvJ74WgUF15-Nzx2Ey8JWk_6op-WtNx0GxIQrnTyRSck2VncroCGVKuNM4ifYvI9pOpraJpokS35PhRy4oCO5o5rsNzSz8rKQ0i0rsz8GYzedhpm5TwaqstQDtiF2gHOZ02oVFdzf46sPbe4ZqnSFTG1orYBFVfEbsvHt30-_eM-L2lPVy1s35Ge1FHrGDZJiwy8Jt91_fDhbh6ku-bQkm8l5ufwFztNCoQncdPwkDzzpKCzcNrECllYVa2GXYqqMaP5SeITHNtQgEcQmCmEAQlyBYhtU6rHGVQAbxW0xXPr-9DtPH7bPT-LTRav6GH_TcskK0ChM4JvYPTJn_w-6gv1ZglcH1VyPgBVoBIZk
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Real-Time+Algorithm+for+Tracking+Astray+Pilgrim+based+on+in-Memory+Data+Structures&rft.jtitle=International+journal+of+advanced+computer+science+%26+applications&rft.au=Abdeen%2C+Mohammad+A.R.&rft.au=Taleb%2C+Ahmad&rft.date=2018&rft.issn=2158-107X&rft.eissn=2156-5570&rft.volume=9&rft.issue=10&rft_id=info:doi/10.14569%2FIJACSA.2018.091057&rft.externalDBID=n%2Fa&rft.externalDocID=10_14569_IJACSA_2018_091057
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2158-107X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2158-107X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2158-107X&client=summon