Analysis of Temporal Robustness in Massive Machine Type Communications

by   Debjani Goswami, et al.

The evolution of fifth generation (5G) networks needs to support the latest use cases, which demand robust network connectivity for the collaborative performance of the network agents, like multi-robot systems and vehicle to anything (V2X) communication. Unfortunately, the user device's limited communication range and battery constraint confirm the unfitness of known robustness metrics suggested for fixed networks, when applied to time-switching communication graphs. Furthermore, the calculation of most of the existing robustness metrics involves non-deterministic polynomial-time complexity, and hence are best-fitted only for small networks. Despite a large volume of works, the complete analysis of a low-complexity temporal robustness metric for a communication network is absent in the literature, and the present work aims to fill this gap. More in detail, our work provides a stochastic analysis of network robustness for a massive machine type communication (mMTC) network. The numerical investigation corroborates the exactness of the proposed analytical framework for temporal robustness metric. Along with studying the impact on network robustness of various system parameters, such as cluster head (CH) probability, power threshold value, network size, and node failure probability, we justify the observed trend of numerical results probabilistically.


On Robustness in Multilayer Interdependent Network

Critical Infrastructures like power and communication networks are highl...

Learning Random Access Schemes for Massive Machine-Type Communication with MARL

In this paper, we explore various multi-agent reinforcement learning (MA...

The Interplay of Spectral Efficiency, User Density, and Energy in Random Access Protocols with Retransmissions

The fifth-generation of wireless communication networks is required to s...

Robustness in Nonorthogonal Multiple Access 5G Networks

The diversity of fifth generation (5G) network use cases, multiple acces...

Tight Bounds for Black Hole Search in Dynamic Rings

In this paper, we start the investigation of distributed computing by mo...

Connectivity jamming game for physical layer attack in peer to peer networks

Because of the open access nature of wireless communications, wireless n...

Please sign up or login with your details

Forgot password? Click here to reset