Shih-Chang Huang

Prof. Shih-Chang Huang

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
12 January 2016 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
HCHong-Yi Chang
Hong-Yi Chang
SHShih-Chang Huang
Shih-Chang Huang
JWJia-Hao Wu
Jia-Hao Wu

8 November 2006 in Computer Communications
Verified
Journal Article
Closed access
HLHsiao-Po Lin
Hsiao-Po Lin
SHShih-Chang Huang
Shih-Chang Huang
RJRong-Hong Jan
Rong-Hong Jan

12 August 2007
Verified
Conference Paper
Open access
SHShih-Chang Huang
Shih-Chang Huang
RJRong-Hong Jan
Rong-Hong Jan
CCChien Chen
Chien Chen
This paper proposes three energy efficient scheduling approaches for 802.16e broadband wireless networks. Instead of considering a single Mobile Subscriber Station (MSS) as most of the current researchers do, multiple MSSs are considered in our work. The constant bit rate traffic with QoS delay constraint is considered in this paper. The proposed approaches address both energy efficiency and bandwidth utilization. We reuse the idle fragmentation of the allocated OFDM frames to balance power saving and bandwidth utilization. Simulation results show that our proposed approaches benefit with more sleep time and higher bandwidth utilization. Furthermore, we give a QoS scheduling mechanism to find the maximum sleeping time for single MSS, called Minimum Wakeup Time (MWT) scheduler. Even though we don't know whether exists a feasible scheduling to satisfy all MSSs with MWT, it will serve as an upper bound for the power-saving scheduling in IEEE 802.16e.

1 January 2006 in International Journal of Sensor Networks
Verified
Journal Article
Closed access
SHShih-Chang Huang
Shih-Chang Huang
RJRong Hong Jan
Rong Hong Jan
WYWuu Yang
Wuu Yang

11 March 2014 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
HCHong-Yi Chang
Hong-Yi Chang
SHShih-Chang Huang
Shih-Chang Huang
CLChih-Chun Lai
Chih-Chun Lai

1 November 2013 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
SHShih-Chang Huang
Shih-Chang Huang
HCHong-Yi Chang
Hong-Yi Chang
KWKun-Lin Wu
Kun-Lin Wu
Current deterministic sensor deploying methods always include the uncovered space greedily to reduce the number of deployed sensors. Because the sensing area of each sensor is circle-like, these greedily methods often divide the region of interest to multiple tiny and scattered regions. Therefore, many additional sensors are deployed to cover these scattered regions. This paper proposes a Jigsaw-based sensor placement (JSP) algorithm for deploying sensors deterministically. Sensors are placed at the periphery of the region of interest to prevent separating the region of interest to isolated regions. An enhanced mechanism is also proposed to improve the time complexity of the proposed method. The scenarios with and without obstacles are evaluated. The simulation results show that the proposed method can cover the whole region of interest with fewer deployed sensors. The effective coverage ratio of JSP method is less than 2. It is better than the maximum coverage method and the Delaunay triangulation method. The deploying sensors have more efficient coverage area, and the distribution of the incremental covered area is close to normal distribution.