Analysis of sliding frame R-ALOHA protocol for real-time distributed wireless networks

In this article, performance of sliding frame (SF) R-ALOHA protocols for real-time distributed wireless networks is investigated analytically and by simulation. First, a discrete Markov chain and Monte Carlo modeling are constructed to evaluate dynamic behavior of the protocol in transient state including distribution of the system stabilization time (SST) and the average number of successful terminals. Furthermore, a hierarchical decomposition is conducted to simplify steady state analysis, thus generating two one-dimensional Markov chains for closed-form performance of SF R-ALOHA under local wireless environment. Terminals with Poisson message arrivals and Poisson message length are analyzed. Consequently, performance indices, such as throughput, the average message delay, and packet dropping probability, are derived from the proposed analytic models. Capture effects on the SF R-ALOHA system in the presence of multipath and shadowing are also obtained by the Markov chain analysis. The numerical results from the analytic models are compared with that from simulation and equilibrium point analysis, proving correctness, accuracy, and scalability of the decomposition. The results also reveal performance characteristics of the SF R-ALOHA system.