Modeling Emergency Traffic Using a Continuous-Time Markov Chain

被引:0
|
作者
El Fawal, Ahmad Hani [1 ,2 ]
Mansour, Ali [1 ]
El Ghor, Hussein [2 ]
Ismail, Nuha A.
Shamaa, Sally [3 ]
机构
[1] ENSTA Bretagne, Lab STICC, UMR 6285, CNRS, F-29806 Brest, France
[2] Modern Univ Business & Sci, CS Dept, POB 14-6495, Beirut, Lebanon
[3] Ctr Res Appl Math & Stat CRAMS, POB 14-6495, Beirut, Lebanon
关键词
machine-to-machine; human-to-human; Internet of Things; Markov chains; RESOURCE-ALLOCATION; M2M COMMUNICATIONS;
D O I
10.3390/jsan13060071
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper aims to propose a novel call for help traffic (SOS) and study its impact over Machine-to-Machine (M2M) and Human-to-Human (H2H) traffic in Internet of Things environments, specifically during disaster events. During such events (e.g., the spread COVID-19), SOS traffic, with its predicted exponential increase, will significantly influence all mobile networks. SOS traffic tends to cause many congestion overload problems that significantly affect the performance of M2M and H2H traffic. In our project, we developed a new Continuous-Time Markov Chain (CTMC) model to analyze and measure radio access performance in terms of massive SOS traffic that influences M2M and H2H traffic. Afterwards, we validate the proposed CTMC model through extensive Monte Carlo simulations. By analyzing the traffic during an emergency case, we can spot a huge impact over the three traffic types of M2M, H2H and SOS traffic. To solve the congestion problems while keeping the SOS traffic without any influence, we propose to grant the SOS traffic the highest priority over the M2M and H2H traffic. However, by implementing this solution in different proposed scenarios, the system becomes able to serve all SOS requests, while only 20% of M2M and H2H traffic could be served in the worst-case scenario. Consequently, we can alleviate the expected shortage of SOS requests during critical events, which might save many humans and rescue them from being isolated.
引用
收藏
页数:20
相关论文
共 50 条
  • [1] Modeling Virtual Machine Migration as a Security Mechanism by using Continuous-Time Markov Chain Model
    Kandoussi, El Mehdi
    El Mir, Iman
    Hanini, Mohamed
    Haqiq, Abdelkrim
    PROCEEDINGS OF 2019 IEEE 4TH WORLD CONFERENCE ON COMPLEX SYSTEMS (WCCS' 19), 2019, : 235 - 240
  • [2] Efficient Continuous-Time Markov Chain Estimation
    Hajiaghayi, Monir
    Kirkpatrick, Bonnie
    Wang, Liangliang
    Bouchard-Cote, Alexandre
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 32 (CYCLE 1), 2014, 32
  • [3] The deviation matrix of a continuous-time Markov chain
    Coolen-Schrijner, P
    van Doorn, EA
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2002, 16 (03) : 351 - 366
  • [4] A Continuous-time Markov Chain Approach for Modeling of Poverty Dynamics: Application to Mozambique
    Rabta, Boualem
    van den Boom, Bart
    Molini, Vasco
    AFRICAN DEVELOPMENT REVIEW-REVUE AFRICAINE DE DEVELOPPEMENT, 2016, 28 (04): : 482 - 495
  • [5] A continuous-time Markov chain modeling cancer-immune system interactions
    Burini, Diletta
    De Angelis, Elena
    Lachowicz, Miroslaw
    COMMUNICATIONS IN APPLIED AND INDUSTRIAL MATHEMATICS, 2018, 9 (02) : 106 - 118
  • [6] Feedback Particle Filter for a Continuous-Time Markov Chain
    Yang, Tao
    Mehta, Prashant G.
    Meyn, Sean P.
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (02) : 556 - 561
  • [7] DISTRIBUTION OF A BOUNDLESS MARKOV-CHAIN WITH CONTINUOUS-TIME
    ALIYEV, TM
    IZVESTIYA AKADEMII NAUK AZERBAIDZHANSKOI SSR SERIYA FIZIKO-TEKHNICHESKIKH I MATEMATICHESKIKH NAUK, 1981, (01): : 16 - 21
  • [8] Application of a continuous-time markov chain to a preclinical study
    al-Khalidi H.R.
    Schnell D.J.
    Drug information journal : DIJ / Drug Information Association, 1997, 31 (2): : 607 - 613
  • [9] Feedback Particle Filter for a Continuous-time Markov Chain
    Yang, Tao
    Mehta, Prashant G.
    Meyn, Sean P.
    2013 AMERICAN CONTROL CONFERENCE (ACC), 2013, : 6772 - 6777
  • [10] A CONTINUOUS-TIME MARKOV-CHAIN FOR EARLY SELECTIONS
    MAGNUSSEN, S
    FOREST SCIENCE, 1993, 39 (04) : 845 - 850