2 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 2 / 2
Yayın Resource allocation in the finite blocklength regime under PAoI and delay violation constraints(IEEE, 2023-08-27) Kartal, Özkan Tuğberk; Kaya, Onur; Uysal, ElifURLLC (Ultra-reliable low-latency communication) is one of the more challenging modes for 5G for resource allocation (RA). Most of the previous studies for RA for wireless access in URLLC assumed known packet arrival processes, and focused on maximizing average rates or throughput. The objective of this paper is to present a formulation of allocating resource blocks, modulation and coding rates to multiple short packet machine-type information flows to provide information age and delay violation guarantees. The scenario is motivated by the scheduling of URLLC flows among users served by a common 5G base station. The problem involves the selections of frequency allocation policy and modulation and coding scheme (MCS) under estimated CSI. Moreover, the sensitivity of the information packet size on the choice of modulation and coding parameters as well as the number of resource blocks and the choice of the number of pilot symbols is demonstrated. The results of this formulation are compared with resource allocation algorithms in the literature.Yayın Optimizing peak age under intermittent satellite connectivity and store-and-forward(IEEE Computer Society, 2025-10-29) Arı, Çağrı; Kartal, Özkan Tuğberk; Munari, Andrea; Badia, Leonardo; Uysal, Elif; Kaya, OnurWe consider a real-time task-oriented application operating over an intermittently available satellite-based communication network, aiming to collect status updates generated by a remote sensing device. The system is modeled as a scheduling problem over a finite horizon, corresponding to the duration of the task, to minimize the peak Age of Information at the destination. The number of updates that can be transmitted is constrained by a transmission budget. Moreover, the status updates are subject to delays caused by the store-and-forward operation of the satellites, which may vastly vary depending on the network conditions. We investigate three levels of awareness regarding the connectivity conditions of the satellite network: (i) scheduling without any information about connectivity conditions, (ii) scheduling based solely on the current conditions, and (iii) scheduling based on full connectivity knowledge. The first case admits a relatively simple structure, for which a periodic transmission strategy is adopted. The latter two cases are formulated as semi-Markov decision processes and solved to obtain the optimal transmission scheduling policy. Simulation results demonstrate the impact of connectivity awareness on the application performance at the destination. Through a simple modeling approach, we provide first insights into the practically relevant setting of store-and-forward satellite architectures.
