MKMehmet Karaca

Mehmet Karaca

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Mehmet Karaca has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Intent Manager Function with Actuation Predictions: A Performance Evaluation

    by Ahmet Cihat Baktir, András Zahemszky, Andrey Silva, Dagnachew Azene Temesgene, Dinand Roeland, Mehmet Karaca

    The vision towards 6G incorporates new technologies enabling cognitive operations, which demands for enhanced automation due to complexity. Intent-driven networks need to support multiple intents from different sources simultaneously for enhanced automation. There are multiple reasons why conflict might occur among expectations formulated in intents, with some prominent examples being (1) autonomous operations, and (2) restricted capacity of network and computation resources. Predicting the effect of a configuration on the system is a promising approach to detect potential conflicts, but its efficiency highly depends on the prediction performance. In this study, we propose a performance evaluation framework for predictions, so that further improvements can be carried out to enhance the overall performance of the intent handling operations with integrated conflict detection and resolution capability. As a result of experiments with three diverse services, it is observed that the predictions we modeled can estimate the effect of a proposed action on system accurately, and so potential conflicts can be detected and resolved on the run.


  • Scheduling and Dynamic Pilot Allocation for Massive MIMO With Varying Traffic

    by Mehmet Karaca

    In this paper, we consider the problem of joint user scheduling and dynamic pilot allocation in a Time-Division Duplex (TDD) based Massive MIMO network under varying traffic condition. One of the main problems with Massive MIMO systems is that the number of available orthogonal pilot signals is limited, and the dynamic allocation of these signals to different users is crucially needed to utilize the full benefit of these systems. In addition, pilot signals are radio resource control (RRC) configured in practice, and hence the frequent reconfiguration causes high signaling overhead and is costly. Using Lyapunov optimization framework, we develop an optimal algorithm that first assigns pilots dynamically based on queue sizes and the channel conditions of users as well as the reconfiguration cost at large time-scale. Then, it schedules users on a small-time scale. Numerical results show the efficacy of our algorithm and demonstrate that pilots do not need to be configured frequently at the expense of increased queue delay.


  • Open Access

    Scheduling and Dynamic Pilot Allocation For Massive MIMO with Varying Traffic

    by Mehmet Karaca

    In this paper, we consider the problem of joint user scheduling and dynamic pilot allocation in a Time-Division Duplex (TDD) based Massive MIMO network under varying traffic condition. One of the main problems with Massive MIMO systems is that the number of available orthogonal pilot signals is limited, and the dynamic allocation of these signals to different users is crucially needed to utilize the full benefit of these systems. In addition, pilot signals are radio resource control (RRC) configured in practice, and hence the frequent reconfiguration causes high signaling overhead and is costly. Using Lyapunov optimization framework, we develop an optimal algorithm that first assigns pilots dynamically based on queue sizes and the channel conditions of users as well as the reconfiguration cost at large time-scale. Then, it schedules users on a small-time scale. Numerical results show the efficacy of our algorithm and demonstrate that pilots do not need to be configured frequently at the expense of increased queue delay.

  • Modifying Backoff Freezing Mechanism to Optimize Dense IEEE 802.11 Networks

    by Mehmet Karaca, Saeed Bastani, Bjorn Landfeldt

    From experience, it has been well known that the performance of IEEE 802.11 wireless local area networks significantly drops in dense settings, largely driven by poor capacity of the medium access control (MAC) layer. The current 802.11 MAC mechanism utilizes a contention window (CW) for random access, and the CW size is dictated to take discrete values from a bounded finite set. In this paper, with focus on a saturated network scenario, we closely investigate the impacts of the aforementioned constraint and show that the limitations on the CW size are the main MAC bottleneck in dense conditions. Then, in order to tackle this bottleneck, we propose a new backoff scheme that does not attempt to tune the CW but makes a small modification in the backoff freezing process to determine the optimal configuration. We prove that our backoff scheme can achieve the maximum network throughput even under densely populated networks (i.e., many contenders), while a maximal compliance with the mentioned constraints is maintained. Then, we turn our attention to minimizing the channel access delay, and propose a variant of our backoff algorithm to accomplish this aim. We further present a new result on the theoretical relation between the optimal configurations for which the throughput is maximized and the delay is minimized. Finally, we note that our modified backoff mechanism does not penalize legacy users and is, therefore, practical for implementation in existing networks, which removes co-existence concerns.


  • Open Access

    Load-aware channel selection for 802.11 WLANs with limited measurement

    by Mehmet Karaca, Bjorn Landfeldt

    It has been known that load unaware channel selection in 802.11 networks results in high level interference, and can significantly reduce the network throughput. In current implementation, the only way to determine the traffic load on a channel is to measure that channel for a certain duration of time. Therefore, in order to find the best channel with the minimum load all channels have to be measured, which is costly and can cause unacceptable communication interruptions between the AP and the stations. In this paper, we propose a learning based approach which aims to find the channel with the minimum load by measuring only limited number of channels. Our method uses Gaussian Process Regressing to accurately track the traffic load on each channel based on the previous measured load. We confirm the performance of our algorithm by using experimental data, and show that the time consumed for the load measurement can be reduced up to 46% compared to the case where all channels are monitored.


  • Open Access

    Load-aware Channel Selection for 802.11 WLANs with Limited Measurement

    by Mehmet Karaca, Bjorn Landfeldt

    It has been known that load unaware channel selection in 802.11 networks results in high level interference, and can significantly reduce the network throughput. In current implementation, the only way to determine the traffic load on a channel is to measure that channel for a certain duration of time. Therefore, in order to find the best channel with the minimum load all channels have to be measured, which is costly and can cause unacceptable communication interruptions between the AP and the stations. In this paper, we propose a learning based approach which aims to find the channel with the minimum load by measuring only limited number of channels. Our method uses Gaussian Process Regressing to accurately track the traffic load on each channel based on the previous measured load. We confirm the performance of our algorithm by using experimental data, and show that the time consumed for the load measurement can be reduced up to 46% compared to the case where all channels are monitored.

  • Approaching Optimal Centralized Scheduling With CSMA-Based Random Access Over Fading Channels

    by Mehmet Karaca, Bjorn Landfeldt

    Carrier sense multiple access (CSMA) based distributed algorithms can attain the largest capacity region as the centralized Max-Weight policy does. Despite their capability of achieving throughput optimality, these algorithms can either incur large delay and have large complexity or only operate over nonfading channels. In this letter, by assuming arbitrary backoff time, we first propose a fully distributed randomized algorithm whose performance can be pushed to the performance of the centralized Max-Weight policy not only in terms of throughput but also in terms of delay for completely connected interference networks with fading channels. Then, inspired by the proposed algorithm, we introduce an implementable distributed algorithm for practical networks with a reservation scheme. We show that the proposed practical algorithm can still achieve the performance of the centralized Max-Weight policy.