P
Pin-Han Ho
Researcher at University of Waterloo
Publications - 392
Citations - 10165
Pin-Han Ho is an academic researcher from University of Waterloo. The author has contributed to research in topics: Wireless network & Network topology. The author has an hindex of 43, co-authored 362 publications receiving 9391 citations. Previous affiliations of Pin-Han Ho include Tohoku University & Queen's University.
Papers
More filters
Proceedings ArticleDOI
Power allocation based on fast Water-Filling for energy efficient OFDM and MIMO transmissions
TL;DR: Numerical results show that the proposed power allocation algorithm for EPG minimization, together with the embedded fast WF algorithm, can run multiple times faster than the existing ones.
Proceedings ArticleDOI
MAC-layer protocol for TCP fairness in Wireless Mesh Networks
TL;DR: This paper uses a Markov chain to capture the behavior of TCP sessions, particularly the impact on network throughput performance due to the effect of queue utilization and packet relaying, and proposes a distributed MAC protocol to alleviate the unfairness problem in WMNs.
Proceedings ArticleDOI
OPN02-2: Inter-Group Shared Protection (I-GSP): A Scalable Solution for Survivable WDM Networks
Anwar Haque,Pin-Han Ho +1 more
TL;DR: A novel path based shared protection framework namely Inter-Group Shared protection (I-GSP) is developed such that the traffic matrix can be divided into multiple protection groups (PGs) based on specific grouping policy.
Journal ArticleDOI
Logical Superposition Coded Video Multicast/Broadcast
TL;DR: A novel framework of logical SPC (L-SPC) modulation for multicast/broadcast of successively refined sources via the JSCC approach is introduced and generalized formulations on symbol error rate (SER) are derived for performance evaluation and comparisons with the conventional hardware-based approach for both the 2- and 3-layer cases.
Proceedings ArticleDOI
A novel strategy for protection domain allocation in dynamic mesh WDM networks
Pin-Han Ho,H.T. Mouftah +1 more
TL;DR: In this article, a novel algorithm called cascaded diverse routing (CDR) is proposed to solve the survivable routing problem in dynamic WDM mesh networks under the framework of short leap shared protection (SLSP).