Wen-Hsing Kuo

Prof. Wen-Hsing Kuo

Yuan Ze University
orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2015 in Ad Hoc Networks
Verified
Journal Article
Closed access
IMIbrahim Mashal
Ibrahim Mashal
OAOsama Alsaryrah
Osama Alsaryrah
TCTein-Yaw Chung
Tein-Yaw Chung
CYCheng-Zen Yang
Cheng-Zen Yang
WKWen-Hsing Kuo
Wen-Hsing Kuo
DADharma P. Agrawal
Dharma P. Agrawal

22 October 2007 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
WKWen-Hsing Kuo
Wen-Hsing Kuo
WLWanjiun Liao
Wanjiun Liao
In this paper, we study utility-based maximization for resource allocation in the downlink direction of centralized wireless networks. We consider two types of traffic, i.e., best effort and hard QoS, and develop some essential theorems for optimal wireless resource allocation. We then propose three allocation schemes. The performance of the proposed schemes is evaluated via simulations. The results show that optimal wireless resource allocation is dependent on traffic types, total available resource, and channel quality, rather than solely dependent on the channel quality or traffic types as assumed in most existing work.

24 October 2011 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SFShih-Hau Fang
Shih-Hau Fang
YHYing-Tso Hsu
Ying-Tso Hsu
WKWen-Hsing Kuo
Wen-Hsing Kuo
This paper proposes a dynamic fingerprinting combination (DFC) algorithm that improves mobile localization by dynamically weighting the spatial correlation from multiple location fingerprinting systems. This DFC algorithm first extracts the complementary advantages of fingerprinting functions to construct a fusion profile, and then dynamically combines individual outputs based on the fusion profile surrounding the test sample. The proposed algorithm generates more accurate location estimates and reduces the risk of selecting a poorly-performing fingerprinting approach. This study applies DFC to an actual GSM network with realistic measurements. Experimental results show that DFC improves the positioning accuracy of base fingerprinting algorithms, including the Bayesian approach and a neural network model.

18 July 2008 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
WKWen-Hsing Kuo
Wen-Hsing Kuo
WLWanjiun Liao
Wanjiun Liao
In this paper, we study utility-based resource allocation for soft QoS traffic in infrastructure-based wireless networks. Soft QoS traffic here refers to the traffic which demands certain amount of bandwidth for normal operation but allows some flexibility when the given bandwidth is close to the preferred value. The resource requirement of soft QoS traffic can be described with sigmoid utility function. Our objective is to maximize the total utility of all soft QoS flows without going through a wireless bidding process. We develop essential theorems as the design guidelines for this problem, and then propose a sub-optimal, polynomial time solution based on the developed theorems. We prove that the difference in the performance of our mechanism and the optimal solution is bounded. The performance of the proposed solution is evaluated via simulations. The results show that our solution can adapt to any types of soft QoS flows. Specifically, it acts like a hard QoS system and allocates resource in a fairness-oriented manner when the utility functions of flows are unit-step functions; on the other hand, when the utility functions are concave, it behaves like a best effort system and allocates resource in a throughput-oriented way.

30 September 2010 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
WKWen-Hsing Kuo
Wen-Hsing Kuo
WLWanjiun Liao
Wanjiun Liao
TLTehuang Liu
Tehuang Liu
In this paper, we study the utility-based resource allocation problem for layer-encoded IPTV multicast service over WiMAX networks. In this problem, each video stream is encoded into multiple layers. We regard each layer as a multicast subsession. Each layer of a video stream is assigned a utility value, and the number of layers for each program each user can receive is adjustable. The objective is to maximize the total utility (i.e., all users' satisfaction) and the system resource utilization, subject to users' channel conditions, the popularity of a video program, and the total available radio resource. We design a polynomial-time solution to this problem, and show that the difference in the performance of our proposed mechanism and the optimal solution is tightly bounded. Our mechanism supports both unicast and multicast, and both single layer and multi-layer environments. Most importantly, it can be integrated with the multicast mechanism defined in WiMAX standards, and can also be applied to any kind of wireless networks which support adaptive modulation and coding schemes. The performance of our scheme is evaluated by simulation. The simulation results show that this scheme can allocate resource flexibly according to the utility function of each program, the popularity of each program, and the amount of total resource available in the network.

1 June 2007
Verified
Conference Paper
Closed access
WKWen-Hsing Kuo
Wen-Hsing Kuo
TLT. Liu
T. Liu
WLW. Liao
W. Liao
In this paper, we propose a utility-based resource allocation scheme for layer-encoded IPTV multicast streaming service over IEEE 802.16 WiMAX networks. Unlike existing utility-based schemes, this mechanism is designed for wireless networks which support adaptive modulation and coding. Each video stream (or program) is encoded into different layers. Then, our mechanism adjusts the number of each user's received layers dynamically according to its channel condition and the available network bandwidth, so as to maximize total utility. We prove that this problem is NP-hard, and show that our scheme is bounded in performance to the optimal solution and can run in polynomial time. The simulation results show that this scheme can allocate resource flexibly according to the utility function of each program, the popularity of each program (i.e., the number of users receiving each program), and the amount of total available resource in the network. The result also shows that the fairness of the system can be guaranteed.