• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.618-633
• /
• 2014

Relay technology is becoming more important for mobile communications and wireless internet of things (IoT) networking because of the extended access network coverage range and reliable quality of service (QoS) it can provide at low power consumption levels. Existing mobile multihop relay (MMR) technology uses fixed-point stationary relay stations (RSs) and a divided time-frame (or frequency-band) to support the relay operation. This approach has limitations when a local fixed-point stationary RS does not exist. In addition, since the time-frame (or frequency-band) channel resources are pre-divided for the relay operation, there is no way to achieve high channel utilization using intelligent opportunistic techniques. In this paper, a different approach is considered, where the use of mobile/IoT devices as RSs is considered. In applications that use mobile/IoT devices as relay systems, due to the very limited battery energy of a mobile/IoT device and unequal channel conditions to and from the RS, both minimum energy consumption and QoS support must be considered simultaneously in the selection and configuration of RSs. Therefore, in this paper, a mobile RS is selected and configured with the objective of minimizing power consumption while satisfying end-to-end data rate and bit error rate (BER) requirements. For the RS, both downlink (DL) to the destination system (DS) (i.e., IoT device or user equipment (UE)) and uplink (UL) to the base station (BS) need to be adaptively configured (using adaptive modulation and power control) to minimize power consumption while satisfying the end-to-end QoS constraints. This paper proposes a minimum transmission power consuming RS selection and configuration (MPRSC) scheme, where the RS uses cognitive radio (CR) sub-channels when communicating with the DS, and therefore the scheme is named MPRSC-CR. The proposed MPRSC-CR scheme is activated when a DS moves out of the BS's QoS supportive coverage range. In this case, data transmissions between the RS and BS use the assigned primary channel that the DS had been using, and data transmissions between the RS and DS use CR sub-channels. The simulation results demonstrate that the proposed MPRSC-CR scheme extends the coverage range of the BS and minimizes the power consumption of the RS through optimal selection and configuration of a RS.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.29-39
• /
• 2008

Greedy routing which is easy to apply to geographic wireless sensor networks is frequently used. Greedy routing works well in dense networks whereas in sparse networks it may fail. When greedy routing fails, it needs a recovery algorithm to get out of the communication void. However, additional recovery algorithm causes problems that increase both the amount of packet transmission and energy consumption. Communication void is a condition where all neighbor nodes are further away from the destination than the node currently holding a packet and it therefore cannot forward a packet using greedy forwarding. Therefore we propose a VODUA(Virtually Ordered Distance Upgrade Algorithm) as a novel idea to improve and solve the problem of void. In VODUA, nodes exchange routing graphs that indicate information of connection among the nodes and if there exist a stuck node that cannot forward packets, it is terminated using Distance Cost(DC). In this study, we indicate that packets reach successfully their destination while avoiding void through upgrading of DC. We designed the VODUA algorithm to find valid routes through faster delivery and less energy consumption without requirement for an additional recovery algorithm. Moreover, by using VODUA, a network can be adapted rapidly to node's failure or topological change. This is because the algorithm utilizes information of single hop instead of topological information of entire network. Simulation results show that VODUA can deliver packets from source node to destination with shorter time and less hops than other pre-existing algorithms like GPSR and DUA.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.22 no.6
• /
• pp.115-124
• /
• 2019

In a climate change environment where heat damage and drought occur during a rainy season such as in 2018, a vegetation-based LID system that enables disaster prevention as well as environment improvement is suggested in lieu of an installation-type LID system that is limited to the prevention of floods. However, the quantification of its performance as against construction cost is limited. This study aims to present an experiment environment and evaluation method on quantitative performance, which is required in order to disseminate the vegetation-based LID system. To this end, a 3^rd quartile huff time distribution mass curve was generated for 20-year frequency, 60-minute probable rainfall of 68mm/hr in Cheonan, and effluent was analyzed by recreating artificial rainfall. In order to assess the reliability of the rainfall event simulator, 10 repeat tests were conducted at one-minute intervals for 20 minutes with minimum rainfall intensity of 22.29mm/hr and the maximum rainfall intensity of 140.69mm/hr from the calculated probable rainfall. Effective rainfall as against influent flow was 21.83mm/hr (sd=0.17~1.36, n=20) on average at the minimum rainfall intensity and 142.27mm/hr (sd=1.02~3.25, n=20) on average at the maximum rainfall intensity. In artificial rainfall recreation experiments repeated for three times, the most frequent quartile was found to be the third quartile, which is around 40 minutes after beginning the experiment. The peak flow was observed 70 minutes after beginning the experiment in the experiment zone and after 50 minutes in the control zone. While the control zone recorded the maximum runoff intensity of 2.26mm/min(sd=0.25) 50 minutes after beginning the experiment, the experiment zone recorded the maximum runoff intensity of 0.77mm/min (sd=0.15) 70 minutes after beginning the experiment, which is 20 minutes later than the control zone. Also, the maximum runoff intensity of the experiment zone was 79.6% lower than that of the control zone, which confirmed that vegetation unit-type LID system had rainfall runoff reduction and delay effects. Based on the above findings, the reliability of a lab-level rainfall simulator for monitoring the vegetation-based LID system was reviewed, and maximum runoff intensity reduction and runoff time delay were confirmed. As a result, the study presented a performance evaluation method that can be applied to the pre-design of the vegetation-based LID system for rainfall events on a location before construction.

• Journal of Radiation Protection and Research
• /
• v.31 no.2
• /
• pp.97-104
• /
• 2006

In recent years, the MOSFET dosimeter has been widely used in various medical applications such as dose verification in radiation therapeutic and diagnostic applications. The MOSFET dosimeter is, however, mainly made of silicon and shows some energy dependence for low energy Photons. Therefore, the MOSFET dosimeter tends to overestimate the dose for low energy scattered photons in a phantom. This study determines the correction factors to compensate these dependences of the MOSFET dosimeter in ATOM phantom. For this, we first constructed a computational model of the ATOM phantom based on the 3D CT image data of the phantom. The voxel phantom was then implemented in a Monte Carlo simulation code and used to calculate the energy spectrum of the photon field at each of the MOSFET dosimeter locations in the phantom. Finally, the correction factors were calculated based on the energy spectrum of the photon field at the dosimeter locations and the pre-determined energy and directional dependence of the MOSFET dosimeter. Our result for $^{60}Co$ and $^{137}Cs$ photon fields shows that the correction factors are distributed within the range of 0.89 and 0.97 considering all the MOSFET dosimeter locations in the phantom.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.35-41
• /
• 2002

This research introduces the development of a project-level cash flow forecasting model in construction stage based on the planned earned value and the cost from a general contractors view on a jobsite. Most previous models have been developed to assist contractors in their pre-tendering or planning stage cash flow forecasts. The critical key to cash flow forecasting at the project level is how to build a cash-out model. The basic concept is to use moving weights of cost categories in a budget over project duration. The cost categories are classified to compile resources with almost the same time lags that are based on contracting payment conditions and credit times given by suppliers or venders. For cash-in, net planned monthly-earned values are simply transferred to the cash-in forecast, to be applied there with billing time and retention money. Validation of the model involves applying data from on-going 4 projects in progress for 12 months. Based on the results of the comparative analyses through the simulation of the proposed model and the existing models, the proposed model is more accurate, flexible and simpler than traditional models to the employee of construction jobsite who is not oriented financial knowledge.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.3
• /
• pp.431-439
• /
• 2006

A lot of particulate matter and an offensive odor are emitted during the operations of an industrial waste incinerator (IWI), especially pre_treatment and waste input processes. These pollutants affect the labor efficiency of an operator. Therefore, in this study. we have studied the improvement of working surroundings in the industrial waste incinerator by designing a new control system. A computational fluid dynamics has been used to find the diffusion flows of air pollutants (mainly particles and odor) to the working surroundings of the waste treatment complexes. The results obtained from the simulation analysis applied to the basic design on the points (and/or site) and types of pollution control devices. When pollutant control devices are constructed, the concentration of each pollutant at site 1 and 2 decreased about 83-97% for toluene, 48-72% for styrene, 75-87% for xylene, and 23-36% for ammonia, respectively. In addition, the PM-10 and TSP were decreased about 87% and 86% at site 3 (lower part of the waste input), 87% and 85% at site 4 (side part of the waste input), respectively. These indicated that the new control system had an excellent performance of particulate matter and odor removal and it could be applied to other waste treatment plant in place of an industrial waste incinerator.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.12
• /
• pp.660-673
• /
• 2001

In Video-on-Demand (VoD) servers, disk throughput is an important system design parameter because it is directly related to the number of user requests that can be served simultaneously. In this paper, we propose an efficient periodic request grouping scheme for disk array-based VoD servers that reduces the disk seek time, thus improving the disk throughput of VoD disk arrays. To reduce the disk seek time, the proposed scheme groups the periodic requests that access data blocks stored in adjacent regions into one, and arranges these groups in a pre-determined order (e.g., in left-symmetric or right-symmetric fashion). Our simulation result shows that the proposed scheme reduces the average disk bandwidth required by a single video stream and can serve more user requests than existing schemes. For a data block size of 192KB, the number of simultaneously served user requests is increased by 8% while the average waiting time for a user request is decreased by 20%. We also propose an adaptation technique that conforms the proposed scheme to the user preference changes for video streams.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.10
• /
• pp.1359-1366
• /
• 2010

Recently, many electronic control techniques for vehicles have been developed and applied. One of the technologies can be X-by-wire such as throttle-by-wire, brake-by-wire, steer-by-wire, and etc, in which most of mechanical parts are replaced into electrical wire and actuators. In this study, the effect of throttle-by-wire and brake-by-wire control systems on vehicle velocity control, especially in a school zone, are taken into consideration. The number of accidents reported in school zones is higher than that in other places. The reason for this is that many vehicle drivers do not obey speed limit regulations. Moreover, some of the students are careless while crossing the streets. Therefore, in this study, we attempt to develop a method using throttle-by-wire and brake-by-wire control systems for automatically reducing the vehicle speed such that it will be within the speed limit. First, an engine model and a transmission system model are developed for a specific vehicle model. Second, speed reduction is carried out such that the reduction follows a pre-designed cubic spline trajectory; the trajectory is determined such that rapid deceleration, which causes discomfort to the driver and passengers, can be prevented, for which a fuzzy-PID control algorithm is applied for the trajectory following control. Finally, simulation results are presented to verify the performance of the proposed speed reduction control system.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.40 no.1
• /
• pp.23-34
• /
• 2012

Space launch vehicles are designed to fly according to the elaborate pre-determined path. However, if a vehicle went out of the planned trajectory or its thrust terminated abnormally, or if a free-fall atmospheric reentry vehicle tracked by a tracking sensor became impossible to be measured, it is required to attempt to track by a another track equipment or estimate its impact point rapidly. In this paper a new algorithm is proposed, named the ITS-EKF combined with the Integrated Track Splitting (ITS) algorithm and the Extended Kalman Filter (EKF) to obtain the location information of a ballistic projectile without thrust, create its track and maintain it in an environment with clutter. For the reentry vehicle, the track performance is to be verified and the impact point is estimated by applying the simulation through ITS-EKF algorithm. To ensure the proposed algorithm's adequacy, by comparing the track performance and impact point distribution by the ITS-EKF with those of ITS-PF combined with ITS and Particle Filter (PF), it is confirmed that the ITS-EKF algorithm can be used an effective real-time On-line impact point prediction.