Ibrahim Korpeoglu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ibrahim Korpeoglu has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Alper Rifat Ulucinar
Bilkent University
2 shared publications - Ezhan Karasan
Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Trkiye
2 shared publications Hakki Bagci
Department of Computer Engineering, Middle East Technical University, Ankara, Turkey
2 shared publicationsA. Enis Cetin
Department of Electrical and Electronics Engineering, Bilkent University, Bilkent, 06800 Ankara, Turkey
1 shared publicationAdnan Yazici
Department of Computer Engineering, Middle East Technical University, Ankara, Turkey
1 shared publication- Adnan Yazici
Nazarbayev University
1 shared publication
Latest Publications
- Open Access
- 24 July 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (9) , 583
Energy efficient dynamic virtual machine allocation with CPU usage prediction
With tremendous increase in Internet capacity and services, the demand for cloud computing has also grown enormously. This enormous demand for cloud based data storage and processing forces cloud providers to optimize their platforms and facilities. Reducing energy consumption while maintaining service level agreements (SLAs) is one of the most important issues in this optimization effort. Dynamic virtual machine allocation and migration is one of the techniques to achieve this goal. This technique requires constant measurement and prediction of usage of machine resources to trigger migrations at right times. In this paper, we present a dynamic virtual machine allocation and migration method utilizing CPU usage prediction to improve energy efficiency while maintaining agreed quality of service (QoS) levels in cloud datacenters. Our proposed method, called LRAPS, tries to estimate short-term CPU utilization of hosts based on their utilization history. This estimation is then used to detect overloaded and underloaded hosts as part of live migration process. If a host is overloaded, some of the VMs running on that host are migrated to other hosts to avoid SLA violations; if a host is underloaded, all of the VMs in that host are tried to be migrated to other machines so that the host can be powered off. We did extensive simulation experiments using CloudSim to evaluate the efficiency and effectiveness of our proposed method. Our simulation experiments show that our method is feasible to apply and can significantly reduce power consumption and SLA violations in cloud systems.
- 24 July 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (9) , 583
Open AccessEnergy efficient dynamic virtual machine allocation with CPU usage prediction
With tremendous increase in Internet capacity and services, the demand for cloud computing has also grown enormously. This enormous demand for cloud based data storage and processing forces cloud providers to optimize their platforms and facilities. Reducing energy consumption while maintaining service level agreements (SLAs) is one of the most important issues in this optimization effort. Dynamic virtual machine allocation and migration is one of the techniques to achieve this goal. This technique requires constant measurement and prediction of usage of machine resources to trigger migrations at right times. In this paper, we present a dynamic virtual machine allocation and migration method utilizing CPU usage prediction to improve energy efficiency while maintaining agreed quality of service (QoS) levels in cloud datacenters. Our proposed method, called LRAPS, tries to estimate short-term CPU utilization of hosts based on their utilization history. This estimation is then used to detect overloaded and underloaded hosts as part of live migration process. If a host is overloaded, some of the VMs running on that host are migrated to other hosts to avoid SLA violations; if a host is underloaded, all of the VMs in that host are tried to be migrated to other machines so that the host can be powered off. We did extensive simulation experiments using CloudSim to evaluate the efficiency and effectiveness of our proposed method. Our simulation experiments show that our method is feasible to apply and can significantly reduce power consumption and SLA violations in cloud systems.
- 9 November 2020
- Published by Springer Nature in Wireless Networks
- Vol. 27 (1) , 825-838
Energy-efficient and fault-tolerant drone-BS placement in heterogeneous wireless sensor networks
- 9 November 2020
- Published by Springer Nature in Wireless Networks
- Vol. 27 (1) , 825-838
Energy-efficient and fault-tolerant drone-BS placement in heterogeneous wireless sensor networks
- 1 April 2019
- Published by Elsevier in Future Generation Computer Systems
- Vol. 93, 156-169
Fog-Based Data Distribution Service (F-DAD) for Internet of Things (IoT) applications
- 1 April 2019
- Published by Elsevier in Future Generation Computer Systems
- Vol. 93, 156-169
Fog-Based Data Distribution Service (F-DAD) for Internet of Things (IoT) applications
- 1 March 2017
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 60 (6) , 883-897
Energy Efficient IP-Connectivity with IEEE 802.11 for Home M2M Networks
Machine-to-machine communication (M2M) technology enables large-scale device communication and networking, including home devices and appliances. A critical issue for home M2M networks is how to efficiently integrate existing home consumer devices and appliances into an IP-based wireless M2M network with least modifications. Due to its popularity and widespread use in closed spaces, Wi-Fi is a good alternative as a wireless technology to enable M2M networking for home devices. This paper addresses the energy-efficient integration of home appliances into a Wi-Fi- and IP-based home M2M network. Toward this goal, we first propose an integration architecture that requires least modifications to existing components. Then, we propose a novel long-term sleep scheduling algorithm to be applied with the existing 802.11 power save mode. The proposed scheme utilizes the multicast DNS protocol to maintain device and service availability when devices go into deep sleep mode. We prototyped our proposed architecture and algorithm to build a M2M network testbed of home appliances. We performed various experiments on this testbed to evaluate the operation and energy savings of our proposal. We also did simulation experiments for larger scale scenarios. As a result of our test-bed and simulation experiments, we observed significant energy savings compared to alternatives while also ensuring device and service availability.
- 1 March 2017
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 60 (6) , 883-897
Energy Efficient IP-Connectivity with IEEE 802.11 for Home M2M Networks
Machine-to-machine communication (M2M) technology enables large-scale device communication and networking, including home devices and appliances. A critical issue for home M2M networks is how to efficiently integrate existing home consumer devices and appliances into an IP-based wireless M2M network with least modifications. Due to its popularity and widespread use in closed spaces, Wi-Fi is a good alternative as a wireless technology to enable M2M networking for home devices. This paper addresses the energy-efficient integration of home appliances into a Wi-Fi- and IP-based home M2M network. Toward this goal, we first propose an integration architecture that requires least modifications to existing components. Then, we propose a novel long-term sleep scheduling algorithm to be applied with the existing 802.11 power save mode. The proposed scheme utilizes the multicast DNS protocol to maintain device and service availability when devices go into deep sleep mode. We prototyped our proposed architecture and algorithm to build a M2M network testbed of home appliances. We performed various experiments on this testbed to evaluate the operation and energy savings of our proposal. We also did simulation experiments for larger scale scenarios. As a result of our test-bed and simulation experiments, we observed significant energy savings compared to alternatives while also ensuring device and service availability.
- 7 April 2016
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 50 (1) , 231-264
Rule-based inference and decomposition for distributed in-network processing in wireless sensor networks
- 7 April 2016
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 50 (1) , 231-264
Rule-based inference and decomposition for distributed in-network processing in wireless sensor networks
- 1 November 2015
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 100, 133-147
Efficient community identification and maintenance at multiple resolutions on distributed datastores
- 1 November 2015
- Published by Elsevier in Data & Knowledge Engineering
- Vol. 100, 133-147
Efficient community identification and maintenance at multiple resolutions on distributed datastores
- 14 August 2015
- Published by Springer Nature in Wireless Networks
- Vol. 22 (4) , 1381-1399
Distributed power-source-aware routing in wireless sensor networks
- 14 August 2015
- Published by Springer Nature in Wireless Networks
- Vol. 22 (4) , 1381-1399
Distributed power-source-aware routing in wireless sensor networks
- 3 May 2015
- Published by Springer Nature in Wireless Networks
- Vol. 22 (1) , 83-104
Distributed joint flow-radio and channel assignment using partially overlapping channels in multi-radio wireless mesh networks
- 3 May 2015
- Published by Springer Nature in Wireless Networks
- Vol. 22 (1) , 83-104
Distributed joint flow-radio and channel assignment using partially overlapping channels in multi-radio wireless mesh networks
- Open Access
- 1 October 2014
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 10 (10)
A Wi-Fi Cluster Based Wireless Sensor Network Application and Deployment for Wildfire Detection
We introduce the wireless sensor network (WSN) data harvesting application we developed for wildfire detection and the experiments we have performed. The sensor nodes are equipped with temperature and relative humidity sensors. They are organized into clusters and they communicate with the cluster heads using 802.15.4/ZigBee wireless links. The cluster heads report the harvested data to the control center using 802.11/Wi-Fi links. We introduce the hardware and the software architecture of our deployment near Rhodiapolis, an ancient city raising on the outskirts of Kumluca county of Antalya, Turkey. We detail our technical insights into the deployment based on the real-world data collected from the site. We also propose a temperature-based fire detection algorithm and we evaluate its performance by performing experiments in our deployment site and also in our university. We observed that our WSN application can reliably report temperature data to the center quickly and our algorithms can detect fire events in an acceptable time frame with no or very few false positives.
- 1 October 2014
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 10 (10)
Open AccessA Wi-Fi Cluster Based Wireless Sensor Network Application and Deployment for Wildfire Detection
We introduce the wireless sensor network (WSN) data harvesting application we developed for wildfire detection and the experiments we have performed. The sensor nodes are equipped with temperature and relative humidity sensors. They are organized into clusters and they communicate with the cluster heads using 802.15.4/ZigBee wireless links. The cluster heads report the harvested data to the control center using 802.11/Wi-Fi links. We introduce the hardware and the software architecture of our deployment near Rhodiapolis, an ancient city raising on the outskirts of Kumluca county of Antalya, Turkey. We detail our technical insights into the deployment based on the real-world data collected from the site. We also propose a temperature-based fire detection algorithm and we evaluate its performance by performing experiments in our deployment site and also in our university. We observed that our WSN application can reliably report temperature data to the center quickly and our algorithms can detect fire events in an acceptable time frame with no or very few false positives.
- Open Access
- 1 April 2014
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 10 (4)
Controlled Sink Mobility Algorithms for Wireless Sensor Networks
A wireless sensor network (WSN) consists of hundreds or thousands of sensor nodes organized in an ad hoc manner to achieve a predefined goal. Although WSNs have limitations in terms of memory and processors, the main constraint that makes WSNs different from traditional networks is the battery problem which limits the lifetime of a network. Different approaches are proposed in the literature for improving the network lifetime, including data aggregation, energy efficient routing schemes, and MAC protocols. Sink node mobility is also an effective approach for improving the network lifetime. In this paper, we investigate controlled sink node mobility and present a set of algorithms for deciding where and when to move a sink node to improve network lifetime. Moreover, we give a load-balanced topology construction algorithm as another component of our solution. We did extensive simulation experiments to evaluate the performance of the components of our mobility scheme and to compare our solution with static case and random movement strategy. The results show that our algorithms are effective in improving network lifetime and provide significantly better lifetime compared to static sink case and random movement strategy.
- 1 April 2014
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 10 (4)
Open AccessControlled Sink Mobility Algorithms for Wireless Sensor Networks
A wireless sensor network (WSN) consists of hundreds or thousands of sensor nodes organized in an ad hoc manner to achieve a predefined goal. Although WSNs have limitations in terms of memory and processors, the main constraint that makes WSNs different from traditional networks is the battery problem which limits the lifetime of a network. Different approaches are proposed in the literature for improving the network lifetime, including data aggregation, energy efficient routing schemes, and MAC protocols. Sink node mobility is also an effective approach for improving the network lifetime. In this paper, we investigate controlled sink node mobility and present a set of algorithms for deciding where and when to move a sink node to improve network lifetime. Moreover, we give a load-balanced topology construction algorithm as another component of our solution. We did extensive simulation experiments to evaluate the performance of the components of our mobility scheme and to compare our solution with static case and random movement strategy. The results show that our algorithms are effective in improving network lifetime and provide significantly better lifetime compared to static sink case and random movement strategy.