Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Özgür Ergül

dblp:76/7389 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2016
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
High-performance computing · 50% Parallel and multicore computing · 28% Electronic design automation · 22%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing › scientific computing
computational electromagnetics
0.212013
Hierarchical Parallelization of the Multilevel Fast Multipole Algorithm (MLFMA) · Proc. IEEE 2013
Parallel and multicore computing › parallelization strategies
distributed-memory parallelization
0.212013
Hierarchical Parallelization of the Multilevel Fast Multipole Algorithm (MLFMA) · Proc. IEEE 2013
Electronic design automation › physical design › circuit partitioning
multilevel partitioning
0.212013
Hierarchical Parallelization of the Multilevel Fast Multipole Algorithm (MLFMA) · Proc. IEEE 2013
High-performance computing › parallel numerical algorithms
parallel fast multipole method
0.212013
Hierarchical Parallelization of the Multilevel Fast Multipole Algorithm (MLFMA) · Proc. IEEE 2013
Parallel and multicore computing
parallel computing
0.012013
Accurate Solutions of Extremely Large Integral-Equation Problems in Computational Electromagnetics · Proc. IEEE 2013

Methods — techniques the papers use, named apart from their topics

multilevel fast multipole algorithm · 0.2
YearPublicationVenuePosition
2016 Opportunistic reliability for cognitive radio sensor actor networks in smart grid
Özgür Ergül, Ahmet Ozan Biçen, Özgür B. Akan
Ad Hoc Networks1
2015 Soft Handover in OFDMA Based Visible Light Communication Networks
abstract
As the demand for wireless bandwidth rapidly increases, alternative methods to radio frequency-based communication are investigated to overcome the limited bandwidth problem. Visible light communication (VLC) using light emitting diodes (LEDs) is one of these alternatives. LEDs are estimated to replace the incandescent bulbs within the decade. Since, LEDs can be intensity modulated faster than the human eye can detect, illumination and communication can both be provided by the same lighting system. Indoors communication constitutes 70% of the overall traffic, and VLC is a promising technology to complement Wi-Fi and cellular wireless systems. However, proper handover mechanism should be developed for VLC to be a complete indoors solution. In this paper, we present two soft handover methods for VLC. Simulation results indicate our solutions provide higher data rate for both the overall system and individual users in the handover region.
Ergin Dinc, Özgür Ergül, Özgür B. Akan
VTC Fall2
2014 Cooperative coarse spectrum sensing for cognitive radio sensor networks
abstract
The number of applications that use industrial, scientific and medical (ISM) radio bands increase every day, creating interference problem for the wireless sensor networks (WSN) that generally operate on these bands. Cognitive radio sensor network (CRSN) has been proposed as a promising solution to this problem. However, since sensor nodes are energy-constrained devices energy efficient spectrum sensing methods are needed for CRSN. To address this need, we propose a novel cooperative coarse sensing scheme for CRSN (CC4C). CC4C is based on sequential sensing, thus, it is simple and fast. Simulation results show that CC4C incurs less sensing delay and provides significant energy conservation compared to energy detection based coarse sensing schemes, and single stage sensing schemes where no coarse sensing is performed.
Özgür Ergül, Özgür B. Akan
WCNC1
2013 Energy-efficient cooperative spectrum sensing for cognitive radio sensor networks
abstract
Cognitive radio sensor network (CRSN) is an emerging sensor networking paradigm that aims to incorporate opportunistic spectrum access capability to the wireless sensor networks. Since sensor nodes are energy-constrained devices, design of efficient spectrum sensing schemes is imperative for the implementation of CRSNs. In order to address this need, a cooperative spectrum sensing scheme (CSS), specifically designed for CRSNs, is presented in this paper. CSS aims to minimize power consumption and delay during spectrum sensing, while meeting the performance requirements in terms of accuracy with minimal complexity. Simulation results indicate that significant power savings can be achieved with the proposed solution.
Özgür Ergül, Özgür B. Akan
ISCC1
2013 Accurate Solutions of Extremely Large Integral-Equation Problems in Computational Electromagnetics
abstract
Accurate simulations of real-life electromagnetics problems with integral equations require the solution of dense matrix equations involving millions of unknowns. Solutions of these extremely large problems cannot be achieved easily, even when using the most powerful computers with state-of-the-art technology. However, with the multilevel fast multipole algorithm (MLFMA) and parallel MLFMA, we have been able to obtain full-wave solutions of scattering problems discretized with hundreds of millions of unknowns. Some of the complicated real-life problems (such as scattering from a realistic aircraft) involve geometries that are larger than 1000 wavelengths. Accurate solutions of such problems can be used as benchmarking data for many purposes and even as reference data for high-frequency techniques. Solutions of extremely large canonical benchmark problems involving sphere and National Aeronautics and Space Administration (NASA) Almond geometries are presented, in addition to the solution of complicated objects, such as the Flamme. The parallel implementation is also extended to solve very large dielectric problems, such as dielectric lenses and photonic crystals.
Özgür Ergül, Levent Gürel
Proc. IEEE1
2013 Hierarchical Parallelization of the Multilevel Fast Multipole Algorithm (MLFMA)
abstract
Due to itsO(NlogN) complexity, the multilevel fast multipole algorithm (MLFMA) is one of the most prized algorithms of computational electromagnetics and certain other disciplines. Various implementations of this algorithm have been used for rigorous solutions of large-scale scattering, radiation, and miscellaneous other electromagnetics problems involving 3-D objects with arbitrary geometries. Parallelization of MLFMA is crucial for solving real-life problems discretized with hundreds of millions of unknowns. This paper presents the hierarchical partitioning strategy, which provides a very efficient parallelization of MLFMA on distributed-memory architectures. We discuss the advantages of the hierarchical strategy over previous approaches and demonstrate the improved efficiency on scattering problems discretized with millions of unknowns.
Levent Gürel, Özgür Ergül
Proc. IEEE2