Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Towards sustainable smart cities: A review of trends, architectures, components, and open challenges in smart cities
20181.1k citationsBhagya Nathali Silva, Murad Khan et al.profile →
Enhanced Network Anomaly Detection Based on Deep Neural Networks
2018323 citationsShehzad Khalid, Jihun Han et al.IEEE Accessprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Kijun Han'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 Kijun Han with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kijun Han more than expected).
This network shows the impact of papers produced by Kijun Han. 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 Kijun Han. The network helps show where Kijun Han may publish in the future.
Co-authorship network of co-authors of Kijun Han
This figure shows the co-authorship network connecting the top 25 collaborators of Kijun Han.
A scholar is included among the top collaborators of Kijun Han 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 Kijun Han. Kijun Han is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kim, Yonghwan, et al.. (2011). A Case Study on Application for Software Reliability Model to Improve Reliability of the Weapon System. Jeongbo gwahaghoe nonmunji. so'peuteuweeo mich eung'yong. 38(8). 405–418.4 indexed citations
11.
Kim, Hyunsook, et al.. (2007). An efficient topology configuration scheme for wireless sensor networks. 145–150.8 indexed citations
12.
Choi, Minho, et al.. (2007). An energy efficient clustering method for wireless sensor networks. 139–144.3 indexed citations
13.
Han, Kijun, et al.. (2007). An adaptive TXOP allocation in IEEE 802.11e WLANs. 187–192.2 indexed citations
14.
Kang, Taewook, et al.. (2007). A clustering method for energy efficient routing in wireless sensor networks. 133–138.30 indexed citations
15.
Han, Kijun, et al.. (2006). A Backoff Algorithm Based on Residual Energy for Medium Access Control in Wireless Sensor Networks. ICEIC : International Conference on Electronics, Informations and Communications. 235–238.
16.
Han, Kijun, et al.. (2005). An Adaptive Flooding Scheme based on local density for Ad hoc Networks. Journal of the Institute of Electronics Engineers of Korea. 42(9). 11–18.1 indexed citations
Han, Kijun, et al.. (2004). Position-Based Cluster Routing Protocol for Wireless Microsensor Networks. ICEIC : International Conference on Electronics, Informations and Communications. 330–333.
19.
Han, Kijun, et al.. (2004). Super Cluster based Routing Protocol in Sensor Network. ICEIC : International Conference on Electronics, Informations and Communications. 193–198.1 indexed citations
20.
Han, Kijun, et al.. (2002). A Channel Allocation Scheme Using Channel Reservation, Carrying and Sub-Rating for Handoff in Wireless Networks. IEICE Transactions on Communications. 85(11). 2387–2394.1 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.