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 条
  • [11] Throughput Analysis of Dense WLANs Using Continuous-Time Markov Chain Model
    Lei, Tao
    Jiang, Shan
    Wen, Xiangming
    Lu, Zhaoming
    Guo, Lingchao
    2017 IEEE GLOBECOM WORKSHOPS (GC WKSHPS), 2017,
  • [12] Estimating animal utilization densities using continuous-time Markov chain models
    Wilson, Kenady
    Hanks, Ephraim
    Johnson, Devin
    METHODS IN ECOLOGY AND EVOLUTION, 2018, 9 (05): : 1232 - 1240
  • [13] Optimal consumption and insurance: A continuous-time Markov chain approach
    Kraft, Holger
    Steffensen, Mogens
    ASTIN BULLETIN, 2008, 38 (01): : 231 - 257
  • [14] THE FREQUENCY COUNT OF A MARKOV-CHAIN AND THE TRANSITION TO CONTINUOUS-TIME
    GOOD, IJ
    ANNALS OF MATHEMATICAL STATISTICS, 1961, 32 (01): : 41 - 48
  • [15] EXACT INFERENCE FOR CONTINUOUS-TIME MARKOV-CHAIN MODELS
    GEWEKE, J
    MARSHALL, RC
    ZARKIN, GA
    REVIEW OF ECONOMIC STUDIES, 1986, 53 (04): : 653 - 669
  • [16] FREQUENCY COUNT OF A MARKOV-CHAIN AND TRANSITION TO CONTINUOUS-TIME
    GOOD, IJ
    ANNALS OF MATHEMATICAL STATISTICS, 1961, 32 : 41 - &
  • [17] Bayesian selection of continuous-time Markov chain evolutionary models
    Suchard, MA
    Weiss, RE
    Sinsheimer, JS
    MOLECULAR BIOLOGY AND EVOLUTION, 2001, 18 (06) : 1001 - 1013
  • [18] Distributed Content Replacement in Small Cell Networks Using Continuous-Time Markov Chain
    Teng, Wei
    Sheng, Min
    Guo, Kun
    Qiu, Zhiliang
    ICC 2019 - 2019 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2019,
  • [19] On the Filtering Problem for Continuous-Time Markov Jump Linear Systems with no Observation of the Markov Chain
    do Valle Costa, Oswaldo Luiz
    Fragoso, Marcelo Dutra
    Todorov, Marcos Garcia
    EUROPEAN JOURNAL OF CONTROL, 2011, 17 (04) : 339 - 354
  • [20] Continuous Time Markov Chain Traffic Model for Urban Environments
    Oumaima, El Joubari
    Jalel, Ben Othman
    Veronique, Veque
    2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,