Shih-Chang Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shih-Chang Huang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Hong-Yi Chang
Department of Management Information System, National Chiayi University, Chiayi City 60054, Taiwan
5 shared publications Rong-Hong Jan
Department of Computer Science, National Chiao Tung University, Hsin-chu, Taiwan, ROC
3 shared publicationsChien Chen
Department of Computer Science, National Chiao Tung University, Hsin-chu, Taiwan, ROC
2 shared publicationsWuu Yang
2 shared publications- Yi-Kai Wang
Department of Computer Science and Information Engineering, National Formosa University, Yunlin 632, Taiwan
2 shared publications Cheng-Chung Hsieh
Networks and Multimedia Institute, Institute for Information Industry, Taipei 106, Taiwan, ROC
1 shared publication
Latest Publications
- Open Access
- 20 December 2022
- Published by MDPI AG in Applied Sciences
- Vol. 13 (1) , 22
Mobile Anchor Route Scheduling with an Iterative Sensor Positioning Algorithm in Wireless Sensor Networks
Locating deployed sensor nodes in wireless sensor networks is a crucial issue for general environmental monitoring applications. Most current positioning technologies use stationary anchors to compute the positions of sensor nodes. However, placing the static anchors in the monitoring area is not a trivial job, especially in hazardous environments. Applying a mobile anchor is a good solution. This paper proposes an iterative sensor positioning (ISP) algorithm that uses the neighboring-positioned nodes to assist the mobile anchor in locating the unknown nodes. In addition, a mobile anchor route scheduling method, named MARS, is also proposed to shorten the traveling distance of the mobile anchor. MARS uses a projection mechanism and the ISP algorithm to reduce the traveling distance. Simulation results indicate that MARS can reduce the traveling distance of the mobile anchor by about 21–49% compared with the SCAN method. In the unfavorable scenario of the projection mechanism, MARS still provides the mobile anchor with a traveling distance that is 34% less than the SCAN method. The mobile anchor, when applying the MARS method, is able to locate all unknown nodes in only 45% to 70% of the traveling distance required by the one using the SCAN method in the scenario favorable to the ISP algorithm, while still reducing the traveling distance by 15% to 21% in the scenario unfavorable to the ISP algorithm. In the non-ideal signal scenario, the positioning size of the positioning area of the ISP algorithm when using the MARS method is about 53% to 74% less than when using the Triangulation algorithm.
- 20 December 2022
- Published by MDPI AG in Applied Sciences
- Vol. 13 (1) , 22
Open AccessMobile Anchor Route Scheduling with an Iterative Sensor Positioning Algorithm in Wireless Sensor Networks
Locating deployed sensor nodes in wireless sensor networks is a crucial issue for general environmental monitoring applications. Most current positioning technologies use stationary anchors to compute the positions of sensor nodes. However, placing the static anchors in the monitoring area is not a trivial job, especially in hazardous environments. Applying a mobile anchor is a good solution. This paper proposes an iterative sensor positioning (ISP) algorithm that uses the neighboring-positioned nodes to assist the mobile anchor in locating the unknown nodes. In addition, a mobile anchor route scheduling method, named MARS, is also proposed to shorten the traveling distance of the mobile anchor. MARS uses a projection mechanism and the ISP algorithm to reduce the traveling distance. Simulation results indicate that MARS can reduce the traveling distance of the mobile anchor by about 21–49% compared with the SCAN method. In the unfavorable scenario of the projection mechanism, MARS still provides the mobile anchor with a traveling distance that is 34% less than the SCAN method. The mobile anchor, when applying the MARS method, is able to locate all unknown nodes in only 45% to 70% of the traveling distance required by the one using the SCAN method in the scenario favorable to the ISP algorithm, while still reducing the traveling distance by 15% to 21% in the scenario unfavorable to the ISP algorithm. In the non-ideal signal scenario, the positioning size of the positioning area of the ISP algorithm when using the MARS method is about 53% to 74% less than when using the Triangulation algorithm.
- Open Access
- 18 January 2022
- Published by MDPI AG in Algorithms
- Vol. 15 (2) , 31
Algorithms for Detecting and Refining the Area of Intangible Continuous Objects for Mobile Wireless Sensor Networks
Detecting the intangible continuous object (ICO) is a significant task, especially when the ICO is harmful as a toxic gas. Many studies used steady sensors to sketch the contour and find the area of the ICO. Applying the mobile sensors can further improve the precision of the detected ICO by efficiently adjusting the positions of a subset of the deployed sensors. This paper proposed two methods to figure out the area of the ICO, named Delaunay triangulation with moving sensors (MDT) and convex hull with moving sensors (MCH). First, the proposed methods divide the sensors into ICO-covered and ICO-uncovered sensors. Next, the convex hull algorithm and the Delaunay triangulation geometric architecture are applied to figure out the rough boundary of the ICO. Then, the area of the ICO is further refined by the proposed sensor moving algorithm. Simulation results show that the figured out area sizes of MDT and MCH are 135% and 102% of the actual ICO. The results are better than the planarization algorithms Gabriel Graph (GG) and Delaunay triangulation without moving sensors, that amount to 137% and 145% of the actual ICO. The simulation also evaluates the impact of the sensors’ moving step size to find the compromise between the accuracy of the area and the convergence time of area refinement.
- 18 January 2022
- Published by MDPI AG in Algorithms
- Vol. 15 (2) , 31
Open AccessAlgorithms for Detecting and Refining the Area of Intangible Continuous Objects for Mobile Wireless Sensor Networks
Detecting the intangible continuous object (ICO) is a significant task, especially when the ICO is harmful as a toxic gas. Many studies used steady sensors to sketch the contour and find the area of the ICO. Applying the mobile sensors can further improve the precision of the detected ICO by efficiently adjusting the positions of a subset of the deployed sensors. This paper proposed two methods to figure out the area of the ICO, named Delaunay triangulation with moving sensors (MDT) and convex hull with moving sensors (MCH). First, the proposed methods divide the sensors into ICO-covered and ICO-uncovered sensors. Next, the convex hull algorithm and the Delaunay triangulation geometric architecture are applied to figure out the rough boundary of the ICO. Then, the area of the ICO is further refined by the proposed sensor moving algorithm. Simulation results show that the figured out area sizes of MDT and MCH are 135% and 102% of the actual ICO. The results are better than the planarization algorithms Gabriel Graph (GG) and Delaunay triangulation without moving sensors, that amount to 137% and 145% of the actual ICO. The simulation also evaluates the impact of the sensors’ moving step size to find the compromise between the accuracy of the area and the convergence time of area refinement.
- Open Access
- 12 September 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (18) , 6352
A Low-Cost Constant-Moisture Automatic Irrigation System Using Dynamic Irrigation Interval Adjustment
This paper developed a Soil Moisture Forecasting (SMF) model and a Constant-moisture Automatic Irrigation System (CAIS). The SMF model used the soil moisture data at different depths in an experimental plot inside a greenhouse to infer the soil moisture level after a specific interval. CAIS integrated the SMF data with dynamic watering interval adaption to maintain soil moisture at a constant level. Most intelligent irrigation products incur high installation costs that farmers cannot afford. CAIS used a low-cost component to achieve the same functionality that is found in intelligent irrigation products. Most low-cost irrigation systems water the plants from a single point that may lead to variable soil moisture if the terrain or the soil density is uneven. CAIS divided the experimental plot into multiple virtual planting areas (VPAs) and dynamically adapted the watering interval of each VPA to balance the soil moisture of the whole experimental plot. Results showed that the forecasting error of the SMF model was less than 12 moisture levels over a scale of 1024 levels. Furthermore, CAIS maintained the soil moisture of the whole experimental plot at a constant level within ±5 error points with multiple watering points.
- 12 September 2020
- Published by MDPI AG in Applied Sciences
- Vol. 10 (18) , 6352
Open AccessA Low-Cost Constant-Moisture Automatic Irrigation System Using Dynamic Irrigation Interval Adjustment
This paper developed a Soil Moisture Forecasting (SMF) model and a Constant-moisture Automatic Irrigation System (CAIS). The SMF model used the soil moisture data at different depths in an experimental plot inside a greenhouse to infer the soil moisture level after a specific interval. CAIS integrated the SMF data with dynamic watering interval adaption to maintain soil moisture at a constant level. Most intelligent irrigation products incur high installation costs that farmers cannot afford. CAIS used a low-cost component to achieve the same functionality that is found in intelligent irrigation products. Most low-cost irrigation systems water the plants from a single point that may lead to variable soil moisture if the terrain or the soil density is uneven. CAIS divided the experimental plot into multiple virtual planting areas (VPAs) and dynamically adapted the watering interval of each VPA to balance the soil moisture of the whole experimental plot. Results showed that the forecasting error of the SMF model was less than 12 moisture levels over a scale of 1024 levels. Furthermore, CAIS maintained the soil moisture of the whole experimental plot at a constant level within ±5 error points with multiple watering points.
- Open Access
A Charging-Aware Multi-Mode Routing Protocol for Data Collection in Wireless Rechargeable Sensor Networks
This paper proposes a charging-aware multi-mode routing protocol (CMRP) to collect data in the wireless rechargeable sensor networks. The routing mechanism in CMRP is not steady but changes according to the energy charging status of sensors. Sensors that cannot replenish their energy efficiency use the routing protocol with less energy consumption. On the contrary, sensors that can replenish their energy use the low propagation delay routing protocol. A novel heuristic chaining mechanism based on multi-level convex hull circle (MCC) is also proposed. Simulation results show that CMRP not only has longer operation time than LEACH and PEGASIS but also has the shortest propagation delay time. The lifetime of CMRP is less than the minimum spanning tree by about 1%, but the propagation delay is shorter than MSTP about 21–28%. In addition, CMRP considers both reducing energy consumption and shortening the propagation delay at the same time. The life-delay rate of the CMRP is close to the optimal results.
Open AccessA Charging-Aware Multi-Mode Routing Protocol for Data Collection in Wireless Rechargeable Sensor Networks
This paper proposes a charging-aware multi-mode routing protocol (CMRP) to collect data in the wireless rechargeable sensor networks. The routing mechanism in CMRP is not steady but changes according to the energy charging status of sensors. Sensors that cannot replenish their energy efficiency use the routing protocol with less energy consumption. On the contrary, sensors that can replenish their energy use the low propagation delay routing protocol. A novel heuristic chaining mechanism based on multi-level convex hull circle (MCC) is also proposed. Simulation results show that CMRP not only has longer operation time than LEACH and PEGASIS but also has the shortest propagation delay time. The lifetime of CMRP is less than the minimum spanning tree by about 1%, but the propagation delay is shorter than MSTP about 21–28%. In addition, CMRP considers both reducing energy consumption and shortening the propagation delay at the same time. The life-delay rate of the CMRP is close to the optimal results.
- Open Access
A Novel Positioning System Based on Coverage Area Pruning in Wireless Sensor Networks
Wireless sensor networks are commonly applied in environmental monitoring applications. The crucial factor in such applications is to accurately retrieve the location of a monitoring event. Although many technologies have been proposed for target positioning, the devices used in such methods require better computational abilities or special hardware that is unsuitable for sensor networks with limited ability. Therefore, a range-free positioning algorithm, named coverage area pruning positioning system (CAPPS), is proposed in this study. First, the proposed CAPPS approach determines the area that includes the target approximately by using sensor nodes that can detect the target. Next, CAPPS uses sensor nodes that cannot detect the target to prune the area to improve positioning accuracy. The radio coverage variation is evaluated in a practical scenario, and a heuristic mechanism is proposed to reduce false positioning probability. Simulation results show that the size of the positioning area computed by CAPPS is smaller than that computed using distance vector hop, angle of arrival, and received signal strength indicator by approximately 98%, 97%, and 93%, respectively. In the radio variation scenario, the probability of determining an area excluding the target can be reduced from 50%–95% to 10%–30% by applying the proposed centroid point mechanism.
Open AccessA Novel Positioning System Based on Coverage Area Pruning in Wireless Sensor Networks
Wireless sensor networks are commonly applied in environmental monitoring applications. The crucial factor in such applications is to accurately retrieve the location of a monitoring event. Although many technologies have been proposed for target positioning, the devices used in such methods require better computational abilities or special hardware that is unsuitable for sensor networks with limited ability. Therefore, a range-free positioning algorithm, named coverage area pruning positioning system (CAPPS), is proposed in this study. First, the proposed CAPPS approach determines the area that includes the target approximately by using sensor nodes that can detect the target. Next, CAPPS uses sensor nodes that cannot detect the target to prune the area to improve positioning accuracy. The radio coverage variation is evaluated in a practical scenario, and a heuristic mechanism is proposed to reduce false positioning probability. Simulation results show that the size of the positioning area computed by CAPPS is smaller than that computed using distance vector hop, angle of arrival, and received signal strength indicator by approximately 98%, 97%, and 93%, respectively. In the radio variation scenario, the probability of determining an area excluding the target can be reduced from 50%–95% to 10%–30% by applying the proposed centroid point mechanism.
- Open Access
MMCS: Multi-Module Charging Strategy for Increasing the Lifetime of Wireless Rechargeable Sensor Networks
In recent years, wireless charging technology has provided an alternative to charging equipment. Wireless charging technology has already proved to be useful in our daily lives in phones, buses, restaurants, etc. Wireless charging technology can also be applied in energy-bounded wireless sensor networks (WSNs), and these are called wireless rechargeable sensor networks (WRSNs). The optimized charging path problem is the most widely discussed issue in employing WRSNs with wireless charging vehicles (WCVs). This problem involves determining the most efficient path for charging sensor nodes. Further, charging-scheduling problems also need to be considered in the optimized charging path problem. In this paper, we proposed a multi-module charging strategy (MMCS) used to prolong the lifetime of the entire WRSN. MMCS can be divided into three stages: the charging topology, charging scheduling, and charging strategy stages, with multiple modules in each stage. The best module combination of MMCS is the distance-based module in the charging topology stage, delay-based module in the charging schedule stage, and the average lifetime module in the charging strategy stage. The best module combination enables prolonging the lifetime efficiently, as it considers not only the priority of urgent nodes but also the travel distance of WCV; the delay-based module of the charging schedule stage considers the delay effect on the follow-up nodes. The experimental results show that the proposed MMCS can improve the lifetime of the entire WRSN and that it substantially outperforms the nearest job next with preemption (NJNP) method in terms of lifetime improvement of the entire WRSN.
Open AccessMMCS: Multi-Module Charging Strategy for Increasing the Lifetime of Wireless Rechargeable Sensor Networks
In recent years, wireless charging technology has provided an alternative to charging equipment. Wireless charging technology has already proved to be useful in our daily lives in phones, buses, restaurants, etc. Wireless charging technology can also be applied in energy-bounded wireless sensor networks (WSNs), and these are called wireless rechargeable sensor networks (WRSNs). The optimized charging path problem is the most widely discussed issue in employing WRSNs with wireless charging vehicles (WCVs). This problem involves determining the most efficient path for charging sensor nodes. Further, charging-scheduling problems also need to be considered in the optimized charging path problem. In this paper, we proposed a multi-module charging strategy (MMCS) used to prolong the lifetime of the entire WRSN. MMCS can be divided into three stages: the charging topology, charging scheduling, and charging strategy stages, with multiple modules in each stage. The best module combination of MMCS is the distance-based module in the charging topology stage, delay-based module in the charging schedule stage, and the average lifetime module in the charging strategy stage. The best module combination enables prolonging the lifetime efficiently, as it considers not only the priority of urgent nodes but also the travel distance of WCV; the delay-based module of the charging schedule stage considers the delay effect on the follow-up nodes. The experimental results show that the proposed MMCS can improve the lifetime of the entire WRSN and that it substantially outperforms the nearest job next with preemption (NJNP) method in terms of lifetime improvement of the entire WRSN.
- 12 January 2016
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 76 (19) , 19523-19542
A personalized music recommendation system based on electroencephalography feedback
- 12 January 2016
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 76 (19) , 19523-19542
A personalized music recommendation system based on electroencephalography feedback
- 4 January 2016
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 76 (19) , 19463-19478
A farmland multimedia data collection method using mobile sink for wireless sensor networks
- 4 January 2016
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 76 (19) , 19463-19478
A farmland multimedia data collection method using mobile sink for wireless sensor networks
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 233-234
The novel falling detection method with G-sensors on waist
- 1 May 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 233-234
The novel falling detection method with G-sensors on waist
- 11 March 2014
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 69 (1) , 225-247
A personalized IPTV channel-recommendation mechanism based on the MapReduce framework
- 11 March 2014
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 69 (1) , 225-247
A personalized IPTV channel-recommendation mechanism based on the MapReduce framework