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 条
[21]   Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata [J].
Brazdil, Tomas ;
Krcal, Jan ;
Kretinsky, Jan ;
Kucera, Antonin ;
Rehak, Vojtech .
HSCC 11: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON HYBRID SYSTEMS: COMPUTATION AND CONTROL, 2011, :33-42
[22]   Continuous-Time Stochastic Games of Fixed Duration [J].
Levy, Yehuda .
DYNAMIC GAMES AND APPLICATIONS, 2013, 3 (02) :279-312
[23]   Markov Chain Model Approach for Traffic Incident Length Prediction [J].
Rapant, Lukas .
2017 INTERNATIONAL CONFERENCE ON E-SOCIETY, E-EDUCATION AND E-TECHNOLOGY (ICSET 2017), 2015, :63-67
[24]   Case for First Courses on Finite Markov Chain Modeling to Include Sojourn Time Cycle Chart [J].
Awoniyi, Samuel ;
Wheaton, Ira .
SIAM REVIEW, 2019, 61 (02) :347-360
[25]   A Distributed Continuous-Time Algorithm for Nonsmooth Constrained Optimization [J].
Chen, Gang ;
Yang, Qing ;
Song, Yongduan ;
Lewis, Frank L. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2020, 65 (11) :4914-4921
[26]   Continuous-time reinforcement learning approach for portfolio management with time penalization [J].
Garcia-Galicia, Mauricio ;
Carsteanu, Alin A. ;
Clempner, Julio B. .
EXPERT SYSTEMS WITH APPLICATIONS, 2019, 129 :27-36
[27]   Modeling QoS Parameters of VoIP Traffic with Multifractal and Markov Models [J].
Toral-Cruz, Homero ;
Pathan, Al-Sakib Khan ;
Ramirez-Pacheco, Julio C. .
ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PT II, 2011, 7017 :255-265
[28]   STATIONARY AVERAGING FOR MULTISCALE CONTINUOUS TIME MARKOV CHAINS USING PARALLEL REPLICA DYNAMICS [J].
Wang, Ting ;
Plechac, Petr ;
Aristoff, David .
MULTISCALE MODELING & SIMULATION, 2018, 16 (01) :1-27
[29]   A Markov chain model for IEEE 802.15.4 in time critical wireless sensor networks under periodic traffic with reneging packets [J].
Hossein Hadadian Nejad Yousefi ;
Yousef Kavian ;
Alimorad Mahmoudi .
Journal of Ambient Intelligence and Humanized Computing, 2022, 13 :2253-2268
[30]   A Markov chain model for IEEE 802.15.4 in time critical wireless sensor networks under periodic traffic with reneging packets [J].
Hadadian Nejad Yousefi, Hossein ;
Kavian, Yousef ;
Mahmoudi, Alimorad .
JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2022, 13 (04) :2253-2268