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]   Distributed Continuous-Time Algorithms for Time-Varying Constrained Convex Optimization [J].
Sun, Shan ;
Xu, Jie ;
Ren, Wei .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2023, 68 (07) :3931-3946
[32]   Event-Triggered Stabilization for Continuous-Time Stochastic Systems [J].
Li, Fengzhong ;
Liu, Yungang .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2020, 65 (10) :4031-4046
[33]   Reliability analysis and redundancy optimization of k-out-of-n systems with random variable k using continuous time Markov chain and Monte Carlo simulation [J].
Oszczypala, Mateusz ;
Konwerski, Jakub ;
Ziolkowski, Jaroslaw ;
Malachowski, Jerzy .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2024, 242
[34]   Performance Analysis of Continuous-Time Random Access System in Internet of Things [J].
Ding Hongwei ;
Zhao Dongfeng ;
Zhao Yifan ;
Liu Zhenggang ;
Ma Xiaohui .
2011 INTERNATIONAL CONFERENCE ON FUTURE COMPUTER SCIENCE AND APPLICATION (FCSA 2011), VOL 2, 2011, :266-269
[35]   Continuous-Time Algorithm For Distributed Constrained Optimization Over Directed Graphs [J].
Yang, Qiang ;
Chen, Gang ;
Ren, Jianghong .
2019 IEEE 15TH INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION (ICCA), 2019, :1020-1025
[36]   Distributed continuous-time algorithm for a general nonsmooth monotropic optimization problem [J].
Li, Xiuxian ;
Xie, Lihua ;
Hong, Yiguang .
INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, 2019, 29 (10) :3252-3266
[37]   Continuous-Time Constrained Stochastic Games under the Discounted Cost Criteria [J].
Zhang, Wenzhao .
APPLIED MATHEMATICS AND OPTIMIZATION, 2018, 77 (02) :275-296
[38]   Mathematical Modeling of Manufacturing Lines with Distribution by Process: A Markov Chain Approach [J].
Perez-Lechuga, Gilberto ;
Venegas-Martinez, Francisco ;
Martinez-Sanchez, Jose Francisco .
MATHEMATICS, 2021, 9 (24)
[39]   Markov Chain Modeling of Initiation and Demand: The Case of the US Cocaine Epidemic [J].
Jonathan P. Caulkins ;
Doris A. Behrens ;
Claudia Knoll ;
Gernot Tragler ;
Doris Zuba .
Health Care Management Science, 2004, 7 (4) :319-329
[40]   MODELING THE GENETIC ALGORITHM BY A NONHOMOGENEOUS MARKOV CHAIN: WEAK AND STRONG ERGODICITY [J].
Campos, V. S. M. ;
Pereira, A. G. C. ;
Rojas Cruz, J. A. .
THEORY OF PROBABILITY AND ITS APPLICATIONS, 2013, 57 (01) :144-U208