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 条
  • [31] Simple examples of continuous-time Markov-chain models for reactions
    Iain L. MacDonald
    Reaction Kinetics, Mechanisms and Catalysis, 2023, 136 : 1 - 11
  • [32] Analysis of Fast and Secure Protocol Based on Continuous-Time Markov Chain
    Zhou Conghua
    Cao Meiling
    CHINA COMMUNICATIONS, 2013, 10 (08) : 137 - 149
  • [33] Modeling of Learning Processes Using Continuous-Time Markov Chain for Virtual-Reality-Based Surgical Training in Laparoscopic Surgery
    Lee, Seunghan
    Shetty, Amar Sadanand
    Cavuoto, Lora A.
    IEEE TRANSACTIONS ON LEARNING TECHNOLOGIES, 2024, 17 : 462 - 473
  • [34] A new definition of hitting time and an embedded Markov chain in continuous-time quantum walks
    Ruiz-Ortiz, Miguel A.
    Martin-Gonzalez, Ehyter M.
    Santiago-Alarcon, Diego
    Venegas-Andraca, Salvador E.
    QUANTUM INFORMATION PROCESSING, 2023, 22 (05)
  • [35] Discussion on: "On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain"
    Shi, Peng
    Liu, Ming
    EUROPEAN JOURNAL OF CONTROL, 2011, 17 (04) : 355 - 356
  • [36] WHOLE-PLANT MODELING - A CONTINUOUS-TIME MARKOV (CTM) APPROACH
    OLSON, RL
    SHARPE, PJH
    WU, HI
    ECOLOGICAL MODELLING, 1985, 29 (1-4) : 171 - 187
  • [37] A new definition of hitting time and an embedded Markov chain in continuous-time quantum walks
    Miguel A. Ruiz-Ortiz
    Ehyter M. Martín-González
    Diego Santiago-Alarcon
    Salvador E. Venegas-Andraca
    Quantum Information Processing, 22
  • [38] Filtering of Continuous-Time Markov Chains
    Aggoun, L.
    Benkherouf, L.
    Tadj, L.
    Mathematical and Computer Modelling (Oxford), 26 (12):
  • [39] On continuous-time Markov processes in bargaining
    Houba, Harold
    ECONOMICS LETTERS, 2008, 100 (02) : 280 - 283
  • [40] Perturbations of continuous-time Markov chains
    Li, Pei-Sen
    STATISTICS & PROBABILITY LETTERS, 2017, 125 : 17 - 24