A Renewal Theory Based Analytical Model for Multi-Channel Random Access in IEEE 802.11ac/ax

2019 ◽  
Vol 18 (5) ◽  
pp. 1000-1013 ◽  
Author(s):  
Sami Khairy ◽  
Mengqi Han ◽  
Lin X. Cai ◽  
Yu Cheng ◽  
Zhu Han
2007 ◽  
Vol 17 (1) ◽  
pp. 135-144 ◽  
Author(s):  
Milan Markovic ◽  
Milos Ivic ◽  
Norbert Pavlovic ◽  
Sladjana Jankovic

In this paper the idea of treating the operational service workers as the elements of technique systems is suggested and the renewal theory is used to forecast the number of accidents caused by human factor. The analytical model is presented and limitations for its application are quoted. Furthermore, the simulation model is developed and the conditions for its use are given. The model observes each worker separately and establishes the exact time of arisen failures, the number of failures at some moment t, time tn, to the nth failure, inconsistency of failure number and total number of failures of the observed population. The model is tested on the sample of 348 engine drivers in PE "Serbian Railways" who have made at leas one accident, in order to research the parameters necessary for using the renewal theory and simulation. .


2008 ◽  
Vol 7 (6) ◽  
pp. 2340-2349 ◽  
Author(s):  
Xinhua Ling ◽  
Yu Cheng ◽  
J.W. Mark ◽  
Xuemin Shen

2007 ◽  
Vol 43 (19) ◽  
pp. 1034 ◽  
Author(s):  
J. He ◽  
Z. Tang ◽  
D. Kaleshi ◽  
A. Munro

2021 ◽  
Author(s):  
Md. Mizanur Rahman

This dissertation presents a new approach for achieving group rendezvous with a coordinator node towards forming a Cognitive Personal Area Network (CPAN) by an arbitrary number of nodes. We propose a protocol for the time to form CPAN in which the nodes join the coordinator simultaneously instead of sequentially. Specifically, we develop an analytical model and derive the distribution of time to form CPAN under the considerations of random arrivals of nodes and their random times to rendezvous with coordinator. We also investigate the CPAN formation time by considering the random activity of primary user (PU). Besides operating in a CPAN, the nodes may have traffic destined to the nodes of other CPAN. In this dissertation, we also propose a bridging protocol in which a shared (bridge) node routes the inter-CPAN traffic between two CPANs. As the bridge node shares its time between two CPANs, the bridge traffic gets priority over that of ordinary nodes in both CPANs. We consider a single, unidirectional bridge because the traffic in the opposite direction can easily be accommodated by having another bridge node. We develop an analytical model based on probabilistic modeling and queueing theory to evaluate the performance of the bridging protocol. We validate the network performance by analyzing the waiting time of local and non-local packets and how the node or bridge transmission is affected by the collision with primary source activity. Finally, we propose a low-overhead two-way bridging scheme for two-hop CPANs, which is more realistic and can be used a basis for routing inter-CPAN traffic in a multihop network. In this advance bringing protocol, the bridge switches between the CPANs without any predefined arrangement, which resulted in simplified bridge scheduling and increased fairness for all nodes. We also analyze its performance through probabilistic analysis and renewal theory. We show that the CPANs are indeed decoupled in terms of synchronization, however the performance of both local and non-local traffic in either CPAN depends on the traffic intensity in both CPANs as well as on the portion of traffic targeting non-local destinations


2016 ◽  
Vol 55 (4S) ◽  
pp. 04ED06 ◽  
Author(s):  
Hiroshi Fuketa ◽  
Shin-ichi O’uchi ◽  
Koichi Fukuda ◽  
Takahiro Mori ◽  
Yukinori Morita ◽  
...  

2014 ◽  
Vol 61 (9) ◽  
pp. 3166-3171 ◽  
Author(s):  
Shaoli Lv ◽  
He Wang ◽  
Jinyu Zhang ◽  
Jun Liu ◽  
Lingling Sun ◽  
...  

Sensors ◽  
2019 ◽  
Vol 19 (14) ◽  
pp. 3237 ◽  
Author(s):  
Sergio Martiradonna ◽  
Giuseppe Piro ◽  
Gennaro Boggia

NarrowBand IoT (NB-IoT) is emerging as a promising communication technology offering a reliable wireless connection to a large number of devices employed in pervasive monitoring scenarios, such as Smart City, Precision Agriculture, and Industry 4.0. Since most of the NB-IoT transmissions occur in the uplink, the random access channel (that is the primary interface between devices and the base station) may usually become the main bottleneck of the entire system. For this reason, analytical models and simulation tools able to investigate its behavior in different scenarios are of the utmost importance for driving current and future research activities. Unfortunately, scientific literature partially addresses the current open issues by means of simplified and, in many cases, not standard-compliant approaches. To provide a significant step forward in this direction, the contribution of this paper is three-folded. First, it presents a flexible, open-source, and 3GPP-compliant implementation of the NB-IoT random access procedure. Second, it formulates an analytical model capturing both collision and success probabilities associated with the aforementioned procedure. Third, it presents the cross-validation of both the analytical model and the simulation tool, by taking into account reference applications scenarios of sensor networks enabling periodic reporting in monitoring infrastructures. Obtained results prove the remarkable accuracy, demonstrating a well-calibrated instrument, which will be also useful for future research activities.


2021 ◽  
Author(s):  
Md. Mizanur Rahman

This dissertation presents a new approach for achieving group rendezvous with a coordinator node towards forming a Cognitive Personal Area Network (CPAN) by an arbitrary number of nodes. We propose a protocol for the time to form CPAN in which the nodes join the coordinator simultaneously instead of sequentially. Specifically, we develop an analytical model and derive the distribution of time to form CPAN under the considerations of random arrivals of nodes and their random times to rendezvous with coordinator. We also investigate the CPAN formation time by considering the random activity of primary user (PU). Besides operating in a CPAN, the nodes may have traffic destined to the nodes of other CPAN. In this dissertation, we also propose a bridging protocol in which a shared (bridge) node routes the inter-CPAN traffic between two CPANs. As the bridge node shares its time between two CPANs, the bridge traffic gets priority over that of ordinary nodes in both CPANs. We consider a single, unidirectional bridge because the traffic in the opposite direction can easily be accommodated by having another bridge node. We develop an analytical model based on probabilistic modeling and queueing theory to evaluate the performance of the bridging protocol. We validate the network performance by analyzing the waiting time of local and non-local packets and how the node or bridge transmission is affected by the collision with primary source activity. Finally, we propose a low-overhead two-way bridging scheme for two-hop CPANs, which is more realistic and can be used a basis for routing inter-CPAN traffic in a multihop network. In this advance bringing protocol, the bridge switches between the CPANs without any predefined arrangement, which resulted in simplified bridge scheduling and increased fairness for all nodes. We also analyze its performance through probabilistic analysis and renewal theory. We show that the CPANs are indeed decoupled in terms of synchronization, however the performance of both local and non-local traffic in either CPAN depends on the traffic intensity in both CPANs as well as on the portion of traffic targeting non-local destinations


Sign in / Sign up

Export Citation Format

Share Document