Do Young Eun
Professor
Biography
Dr. Eun's research interests include network modeling and performance analysis, mobile ad-hoc/sensor networks, mobility modeling, and randomized algorithms for large (social) networks. He has been a member of Technical Program Committee of various conferences including IEEE INFOCOM, ICC, Globecom, ACM MobiHoc, and ACM Sigmetrics. He is currently on the editorial board of IEEE/ACM Transactions on Networking and Computer Communications Journal, and was TPC co-chair of WASA'11. He received the Best Paper Awards in the IEEE ICCCN 2005 and IEEE IPCCC 2006, and the National Science Foundation CAREER Award 2006. He supervised and co-authored a paper that received the Best Student Paper Award in ACM MobiCom 2007.
Education
-
Ph.D.
2003
Electrical and Computer Engineering
Purdue University, West Lafayette -
Master's
1997
Electrical Engineering
KAIST, Korea -
Bachelor's
1995
Electrical Engineering
KAIST, Korea
Research Focus
Highlighted Awards
- NSF CAREER Award (2006)
Awards & Honors
- 2007 - Best Student Paper Award, ACM MobiCom'07 (Annual International Conference on Mobile Computing and Networking)
- 2006 - Best Paper Award, IEEE International Performance Computing and Communications Conference (IPCCC)
- 2006 - National Science Foundation (NSF) CAREER Award
- 2005 - Best Paper Award, 14th International Conference on Computer Communication Networks (ICCCN)
Recent Publications
- Energy-Aware Stochastic UAV-Assisted Surveillance (2021)
- Maximization of Robustness of Interdependent Networks Under Budget Constraints (2020)
- Prevention and Mitigation of Catastrophic Failures in Demand-Supply Interdependent Networks (2020)
- Non-Markovian Monte Carlo on Directed Graphs (2019)
- Transient Dynamics of Epidemic Spreading and Its Mitigation on Large Networks (2019)
- Challenging the limits: Sampling online social networks with cost constraints (2017)
- Designing optimal interlink patterns to maximize robustness of interdependent networks against cascading failures (2017)
- On the rao-blackwellization and its application for graph sampling via neighborhood exploration (2017)
- A high-order Markov-chain-based scheduling algorithm for low delay in CSMA networks (2016)
- An antithetic coupling approach to multi-chain based CSMA scheduling algorithms (2016)