Han Cai

Works (5)

Updated: July 5th, 2023 15:52

2009 article

Crossing Over the Bounded Domain: From Exponential to Power-Law Intermeeting Time in Mobile Ad Hoc Networks

Cai, H., & Eun, D. Y. (2009, July 30). IEEE/ACM Transactions on Networking, Vol. 17, pp. 1578–1591.

By: H. Cai n & D. Eun n 

Contributors: H. Cai n & D. Eun n 

author keywords: Bounded domain; exponential versus power-law; intermeeting time distribution; mobile ad hoc network (MANET); time and space scaling
topics (OpenAlex): Mobile Ad Hoc Networks; Opportunistic and Delay-Tolerant Networks; Cooperative Communication and Network Coding
TL;DR: It is rigorously proved that a finite domain, on which most of the current mobility models are defined, plays an important role in creating the exponential tail of the intermeeting time and that by simply removing the boundary in a simple two-dimensional isotropic random walk model, one is able to obtain the empirically observed power-law decay of the IntermeetingTime. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions (OpenAlex)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2009 article

Multicast scheduling in cellular data networks

Won, H., Cai, H., Eun, D., Guo, K., Netravali, A., Rhee, I., & Sabnani, K. (2009, September 1). IEEE Transactions on Wireless Communications, Vol. 8, pp. 4540–4549.

By: H. Won n, H. Cai n, D. Eun n , K. Guo*, A. Netravali*, I. Rhee n, K. Sabnani *

Contributors: H. Won n, H. Cai n, D. Eun n , K. Guo*, A. Netravali*, I. Rhee n, K. Sabnani *

author keywords: Multicast scheduling; 3G; downlink schedule; optimization; proportional fair; cellular data networks
topics (OpenAlex): Advanced Wireless Network Optimization; Cooperative Communication and Network Coding; Advanced MIMO Systems Optimization
TL;DR: It is proved that IPF and MPF achieve proportional fairness among groups and among all users in a group inside a cell respectively and that these algorithms achieve good balance between throughput and fairness among users and groups. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2008 article

Invariance Property of Isotropic Random Walk Mobility Patterns in Mobile Ad-Hoc Networks

Cai, H., Lee, C.-H., & Eun, D. Y. (2008, January 1). IEEE International Conference on Communications, pp. 2141–2145.

By: H. Cai n, C. Lee n & D. Eun n 

Contributors: H. Cai n, C. Lee n & Y. Do n 

topics (OpenAlex): Mobile Ad Hoc Networks; Opportunistic and Delay-Tolerant Networks; Vehicular Ad Hoc Networks (VANETs)
TL;DR: It is found that the mean contact time of two mobile nodes following isotropic random walk mobility models is invariant with respect to the step-length distribution under both the simplest distance-based (Boolean) interference model and the more realistic SINR-based interference model. (via Semantic Scholar)
Sources: Web Of Science, ORCID
Added: August 6, 2018

2008 article

Stochastic convex ordering for multiplicative decrease internet congestion control

Cai, H., Eun, D. Y., Ha, S., Rhee, I., & Xu, L. (2008, November 12). Computer Networks, Vol. 53, pp. 365–381.

By: H. Cai n, D. Eun n , S. Ha n, I. Rhee n & L. Xu*

Contributors: H. Cai n, D. Eun n , S. Ha n, I. Rhee n & L. Xu*

author keywords: High-speed TCP; Convex ordering; Window growth function
topics (OpenAlex): Network Traffic and Congestion Control; Advanced Wireless Network Optimization; Interconnection Networks and Systems
TL;DR: A new stochastic tool, called convex ordering, is presented that provides an ordering of any convex function of transmission rates of two multiplicative-decrease protocols and valuable insights into high-order behaviors of protocols. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

2008 article

Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization

Cai, H., & Eun, D. Y. (2008, January 1). IEEE International Conference on Communications, pp. 2931–2935.

By: H. Cai n & D. Eun n 

Contributors: H. Cai n & Y. Do n 

topics (OpenAlex): Advanced Wireless Network Optimization; Cooperative Communication and Network Coding; Mobile Ad Hoc Networks
TL;DR: It is proved that there exists ordering relationship for the success probability of any neighborhood when the contention probability vectors are ordered in the sense of majorization, which improves the performance of a class of distributed collision-based scheduling algorithms, called constant-time distributed scheduling algorithms. (via Semantic Scholar)
UN Sustainable Development Goals Color Wheel
UN Sustainable Development Goal Categories
Sources: Web Of Science, ORCID
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2026) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.