Onur Kaya

583 total citations · 1 hit paper
35 papers, 380 citations indexed

About

Onur Kaya is a scholar working on Electrical and Electronic Engineering, Computer Networks and Communications and Epidemiology. According to data from OpenAlex, Onur Kaya has authored 35 papers receiving a total of 380 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Electrical and Electronic Engineering, 26 papers in Computer Networks and Communications and 2 papers in Epidemiology. Recurrent topics in Onur Kaya's work include Advanced MIMO Systems Optimization (16 papers), Cooperative Communication and Network Coding (16 papers) and Wireless Communication Security Techniques (15 papers). Onur Kaya is often cited by papers focused on Advanced MIMO Systems Optimization (16 papers), Cooperative Communication and Network Coding (16 papers) and Wireless Communication Security Techniques (15 papers). Onur Kaya collaborates with scholars based in Türkiye, United States and Sweden. Onur Kaya's co-authors include Şennur Ulukuş, Elif Uysal‐Biyikoglu, Andrea Munari, Mohamad Assaad, Gianluigi Liva, Karl Henrik Johansson, Mutlu Koca, Marian Codreanu, Beatriz Soret and Anthony Ephremides and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Wireless Communications and IEEE Communications Letters.

In The Last Decade

Onur Kaya

33 papers receiving 364 citations

Hit Papers

Semantic Communications i... 2022 2026 2023 2024 2022 40 80 120

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Onur Kaya Türkiye 10 274 245 44 30 19 35 380
Ali Maatouk France 9 210 0.8× 247 1.0× 40 0.9× 83 2.8× 40 2.1× 27 401
Parimal Parag India 13 319 1.2× 470 1.9× 80 1.8× 49 1.6× 24 1.3× 41 555
Mikhail Vilgelm Germany 11 210 0.8× 276 1.1× 19 0.4× 43 1.4× 17 0.9× 20 331
Yao Zhu Germany 11 249 0.9× 184 0.8× 45 1.0× 12 0.4× 5 0.3× 42 382
Elif Tuğçe Ceran United Kingdom 9 349 1.3× 483 2.0× 15 0.3× 264 8.8× 69 3.6× 17 560
Mengjie Lv China 12 95 0.3× 221 0.9× 10 0.2× 5 0.2× 12 0.6× 36 272
Udo Schilcher Austria 10 212 0.8× 234 1.0× 12 0.3× 2 0.1× 4 0.2× 37 325
Alejandro Lancho Sweden 9 209 0.8× 113 0.5× 25 0.6× 2 0.1× 4 0.2× 25 258
Ilya Ganusov United States 10 252 0.9× 266 1.1× 35 0.8× 9 0.5× 14 476
Babak Seyfe Iran 10 162 0.6× 125 0.5× 58 1.3× 25 1.3× 35 261

Countries citing papers authored by Onur Kaya

Since Specialization
Citations

This map shows the geographic impact of Onur Kaya's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Onur Kaya with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Onur Kaya more than expected).

Fields of papers citing papers by Onur Kaya

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Onur Kaya. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Onur Kaya. The network helps show where Onur Kaya may publish in the future.

Co-authorship network of co-authors of Onur Kaya

This figure shows the co-authorship network connecting the top 25 collaborators of Onur Kaya. A scholar is included among the top collaborators of Onur Kaya based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Onur Kaya. Onur Kaya is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Saraç, Tuğba, et al.. (2024). A MILP model and a heuristic algorithm for post-disaster connectivity problem with heterogeneous vehicles. Journal of Heuristics. 30(5-6). 359–396.
2.
Kaya, Onur, et al.. (2023). Resource Allocation in the Finite Blocklength Regime Under PAoI and Delay Violation Constraints. Akademik Açık Erişim (Işık Üniversitesi). 539–546.
3.
Ceran, Elif Tuğçe, et al.. (2021). When To Pull Data for Minimum Age Penalty. Akademik Açık Erişim (Işık Üniversitesi). 1–8. 2 indexed citations
4.
Uysal‐Biyikoglu, Elif, et al.. (2020). Improving Age of Information in Random Access Channels. Akademik Açık Erişim (Işık Üniversitesi). 912–917. 38 indexed citations
5.
Gurakan, Berk, Onur Kaya, & Şennur Ulukuş. (2018). Energy and Data Cooperative Multiple Access Channel With Intermittent Data Arrivals. IEEE Transactions on Wireless Communications. 17(3). 2016–2028. 6 indexed citations
6.
Kaya, Onur, et al.. (2016). Delay tolerant cooperation in the energy harvesting multiple access channel. Akademik Açık Erişim (Işık Üniversitesi). 14. 1–8. 1 indexed citations
7.
Arafa, Ahmed, Onur Kaya, & Şennur Ulukuş. (2016). Energy harvesting cooperative multiple access channel with decoding costs. Akademik Açık Erişim (Işık Üniversitesi). 14. 587–591. 2 indexed citations
8.
Gurakan, Berk, Onur Kaya, & Şennur Ulukuş. (2016). Energy harvesting cooperative multiple access channel with data arrivals. Akademik Açık Erişim (Işık Üniversitesi). 32. 1–6. 2 indexed citations
9.
Kaya, Onur, et al.. (2015). Cooperative Multiple Access under Energy Harvesting Constraints. 2015 IEEE Global Communications Conference (GLOBECOM). 14. 1–6. 21 indexed citations
10.
Kaya, Onur, et al.. (2014). Cooperative Multiple Access under Energy Harvesting Constraints. 2015 IEEE Global Communications Conference (GLOBECOM). 1–6. 20 indexed citations
11.
Kaya, Onur, et al.. (2014). Cognitive Cooperative MAC With One Primary and Two Secondary Users: Achievable Rates and Optimal Power Control. IEEE Communications Letters. 18(11). 1895–1898. 2 indexed citations
12.
Kaya, Onur, et al.. (2013). Enabling cooperation, resource allocation and receiver selection across cells: Complementary fractional frequency reuse. Akademik Açık Erişim (Işık Üniversitesi). 1190–1195. 1 indexed citations
13.
Kaya, Onur, et al.. (2013). Jointly optimal chunk and power allocation in uplink SC-FDMA. Akademik Açık Erişim (Işık Üniversitesi). 2. 3393–3397. 13 indexed citations
14.
Kaya, Onur, et al.. (2012). Power Control for Two User Cooperative OFDMA Channels. IEEE Transactions on Wireless Communications. 12(1). 258–267. 11 indexed citations
15.
Kaya, Onur, et al.. (2012). Power control in the cognitive cooperative multiple access channel. Akademik Açık Erişim (Işık Üniversitesi). 1–5. 3 indexed citations
16.
Kaya, Onur, et al.. (2011). Cooperative Strategies and Achievable Rates for Two User OFDMA Channels. IEEE Transactions on Wireless Communications. 10(12). 4029–4034. 8 indexed citations
17.
Kaya, Onur, et al.. (2008). Channel Adaptive Encoding and Decoding Strategies and Rate Regions for the Three User Cooperative Multiple Access Channel. Akademik Açık Erişim (Işık Üniversitesi). 1–5. 1 indexed citations
18.
Kaya, Onur & Şennur Ulukuş. (2004). Optimum Power Control for CDMA With Deterministic Sequences in Fading Channels. IEEE Transactions on Information Theory. 50(10). 2449–2458. 9 indexed citations
19.
Kaya, Onur & Şennur Ulukuş. (2004). Capacity region of power controlled fading CDMA: transmit strategies and convexity issues. 351–351. 1 indexed citations
20.
Kaya, Onur & Şennur Ulukuş. (2002). Optimum Power Control for Fading CDMA with Deterministic Sequences. 6 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026