On the Rate and Age of Information for non-preemptive systems with prioritized arrivals and deterministic packet deadlines in IoT networks

Abdollahi, Mehran Pourmohammad; Azarhava, Hosein; Haghrah, Amiraslan; Niya, Javad Musevi

doi:10.1016/j.adhoc.2021.102717

Cited by 5 publications

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Enhancing information freshness in multi-class mobile edge computing systems using a hybrid discipline

Fahim,

Rabia,

Abd El-Malek

et al. 2024

Computing

View full text Add to dashboard Cite

Timely status updating in mobile edge computing (MEC) systems has recently gained the utmost interest in internet of things (IoT) networks, where status updates may need higher computations to be interpreted. Moreover, in real-life situations, the status update streams may also be of different priority classes according to their importance and timeliness constraints. The classical disciplines used for priority service differentiation, preemptive and non-preemptive disciplines, pose a dilemma of information freshness dissatisfaction for the whole priority network. This work proposes a hybrid preemptive/non-preemptive discipline under an M/M/1/2 priority queueing model to regulate the priority-based contention of the status update streams in MEC systems. For this hybrid discipline, a probabilistic discretionary rule for preemption is deployed to govern the server and buffer access independently, introducing distinct probability parameters to control the system performance. The stochastic hybrid system approach is utilized to analyze the average age of information (AoI) along with its higher moments for any number of classes. Then, a numerical study on a three-class network is conducted by evaluating the average AoI performance and the corresponding dispersion. The numerical observations underpin the significance of the hybrid-discipline parameters in ensuring the reliability of the whole priority network. Hence, four different approaches are introduced to demonstrate the setting of these parameters. Under these approaches, some outstanding features are manifested: exploiting the buffering resources efficiently, conserving the aggregate sensing power, and optimizing the whole network satisfaction. For this last feature, a near-optimal low-complex heuristic method is proposed.

show abstract