Browsing by Author "Gökcesu, Hakan"

Now showing 1 - 2 of 2

Open Access
Deep learning-based QoE prediction for streaming services in mobile networks
(IEEE, 2022-11-15) Huang, Gan; Erçetin, Özgür; Gökcesu, Hakan; Kalem, Gökhan
Video streaming accounts for the most of the global Internet traffic and providing a high user Quality of Experience (QoE) is considered an essential target for mobile network operators (MNOs). QoE strongly depends on network Quality of Service (QoS) parameters. In this work, we use real-world network traces obtained from a major cellular operator in Turkey to establish a mapping from network side parameters to the user QoE. To this end, we use a model-aided deep learning method for first predicting channel path loss, and then, employ this prediction for predicting video streaming MOS. The experimental results demonstrate that the proposed model-aided deep learning model can guarantee higher prediction accuracy compared to predictions only relying on mathematical models. We also demonstrate that even though a trained model cannot be directly transferred from one geographical area to another, they significantly reduce the volume of required training when used for prediction in a new area.
Open Access
A novel method for scheduling of wireless ad hoc networks in polynomial time
(IEEE, 2020-09-28) Köse, A.; Gökcesu, Hakan; Evirgen, N.; Gökcesu, K.; Médard, M.
In this article, we address the scheduling problem in wireless ad hoc networks by exploiting the computational advantage that comes when scheduling problems can be represented by claw-free conflict graphs where we consider a wireless broadcast medium. It is possible to formulate a scheduling problem of broadcast transmissions as finding the maximum weighted independent set (MWIS) in the conflict graph of the network. Finding the MWIS of a general graph is NP-hard leading to an NP-hard complexity of scheduling. In a claw-free conflict graph, MWIS may be found in polynomial time leading to a throughput-optimal scheduling. We show that the conflict graphs of certain wireless ad hoc networks are claw-free. In order to obtain claw-free conflict graphs in general networks, we suggest introducing additional conflicts (edges) with the aim of keeping the decrease in MWIS size minimal. To this end, we introduce an iterative optimization problem to decide where to introduce edges and investigate its efficient implementation. We conclude that the claw breaking method by adding extra edges can perform very close to optimal scenario and better than the polynomial time maximal independent set scheduling benchmark under the necessary assumptions.