• Journal of the Society of Disaster Information
• /
• v.19 no.3
• /
• pp.608-623
• /
• 2023

Purpose: Recently, the number of logistics warehouses has been on the rise. In addition, as the number of such logistics warehouses increases, number of fire accidents also increases every year, increasing the importance of preventing fires in large logistics warehouses. Method: investigated aspirating smoke detectors that are emerging as adaptive fire detectors in logistics warehouses. Then, through fire simulation (FDS), logistics warehouse modeling was conducted to compare and analyze the detection speed of general smoke detectors and aspirating smoke detectors according to four stages of fire growth and three locations of fire in the logistics warehouse. Result: Growth speed in Slow-class fires and Mediumclass fires, the detection speed of aspirating smoke detectors was faster regardless of the location of the fire. However, in Fast-class fires and Ultra-Fast-class fires, it was confirmed that the detection speed of general smoke detectors was faster depending on the location of the fire. Conclusion: It was confirmed that the detection performance of the aspirating smoke detector decreased as the fire growth speed increased and the location of the fire occurred further than the receiver of the aspirating smoke detector. Therefore, even if an aspirating smoke detector is installed in a warehouse that stores combustibles with high fire growth rates, it is judged that an additional smoke detector is attached far away from the receiver of the general smoke detector to increase fire safety.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.13-21
• /
• 2009

The sensor nodes that form a wireless sensor network must perform both routing and sensing roles, since each sensor node always has a regular energy drain. The majority of sensors being used in wireless sensor networks are either unmanned or operated in environments that make them difficult for humans to approach. Furthermore, since many wireless sensor networks contain large numbers of sensors, thus requiring the sensor nodes to be small in size and cheap in price, the amount of power that can be supplied to the nodes and their data processing capacity are both limited. In this paper, we proposes the WSN(Wireless Sensor Network) algorithm which is applied sensor node that has low power consumption and efficiency measurement. Moreover, the efficiency routing protocol is proposed in this paper. The proposed algorithm reduces power consumption of sensor node data communication. It has not researched in LEACH(Low-Energy Adaptive Clustering Hierarchy) routing protocol. As controlling the active/sleep mode based on the measured data by sensor node, the energy consumption is able to be managed. In the event, the data is transferred to the local cluster head already set. The other side, this algorithm send the data as dependent on the information such as initial and present energy, and the number of rounds that are transformed into cluster header and then transferred. In this situation, the assignment of each node to cluster head evenly is very important. We selected cluster head efficiently and uniformly distributed the energy to each cluster node through the proposed algorithm. Consequently, this caused the extension of the WSN life time.

• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.73-80
• /
• 2010

A wireless sensor network which is deployed in hostile environment can be easily compromised by attackers. The selective forwarding attack can jam the packet or drop a sensitive packet such as the movement of the enemy on data flow path through the compromised node. Xiao, Yu and Gao proposed the checkpoint-based multi-hop acknowledgement scheme(CHEMAS). In CHEMAS, each path node enable to be the checkpoint node according to the pre-defined probability and then can detect the area where the selective forwarding attacks is generated through the checkpoint nodes. In this scheme, the number of hops is very important because this parameter may trade off between energy conservation and detection capacity. In this paper, we used the fuzzy rule system to determine adaptive threshold value which is the number of hops for the ACK packets. In every period, the base station determines threshold value while using fuzzy logic. The energy level, the number of compromised node, and the distance to each node from base station are used to determine threshold value in fuzzy logic.

• The Journal of Korean Society for Radiation Therapy
• /
• v.29 no.2
• /
• pp.109-117
• /
• 2017

Objectives: The purpose of this study was to evaluate the change of body shape and the patient alignment state during image-guided volumetric modulated arc therapy in head and neck cancer patients, Materials and Methods: We performed a image-guided volumetric modulated arc therapy plan for 89 patients with head and neck cancer who underwent curative radiotherapy. Ten of them were evaluated for set up error. The landmarks of the ramus, chin, posterior neck, and clavicle were specified using ARIA software (Offline review), and the positional difference was analyzed. Results: The re-CT simulation therapy was performed in 60 men with $17{\pm}4$ cycles of treatment. The weight loss rate was $-6.47{\pm}3.5%$. 29 women performed re-CT simulation at $17{\pm}5$ cycles As a result, weight loss rate was $-5.73{\pm}2.7%$. The distance from skin to C1, C3, and C5 was measured, and both clavicle levels were observed to measure the skin shrinkage changes. The skin shrinkage standard deviations were C1 (${\pm}0.44cm$), C3 (${\pm}0.83cm$), and C5 (${\pm}1.35cm$), which is about 1 mm shrinkage per 0.5 kg reduction. Skin shrinkage according to the number of treatments was 1 ~ 4 fractions (no change), 5 ~ 13 fractions (-2 mm), 14 ~ 22 fractions (-4 mm) and 23 ~ 30 fractions (-6 mm). Conclusion: When the body shape changes about 5 mm, the central dose starts to differ about 3 % or more. Therefore, the CT simulation treatment for the adaptive therapy should be additionally performed. In addition, it is necessary to actively study the CT simulation therapy method and set up method of the lower neck and to examine the use of a new immobilization device.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.5
• /
• pp.258-270
• /
• 2014

In this paper, we investigate channel capacity of two kinds of uplink OFDMA (Orthogonal Frequency Division Multiple Access) schemes, i.e. ZCZ (Zero Correlation Zone) code time-spread OFDMA and sparse SC-FDMA (Single Carrier Frequency Division Mmultiple Access) robust to access timing offset (TO) among multiple users. In order to reflect the practical condition, we consider not only access TO among multiple users but also peak to average power ratio (PAPR) which is one of hot issues of uplink OFDMA. In the case with access TO among multiple users, the amplified signal of users by power control might affect a severe interference to signals of other users. Meanwhile, amplified signal by considering distance between user and base station might be distorted due to the limit of amplifier and thus the performance might degrade. In order to achieve the maximum channel capacity, we investigate the combinations of transmit power so called ASF (adaptive scaling factor) by numerical simulations. We check that the channel capacity of the case with ASF increases compared to the case with considering only distance i.e. ASF=1. From the simulation results, In the case of high signal to noise ratio (SNR), ZCZ code time-spread OFDMA achieves higher channel capacity compared to sparse block SC-FDMA. On the other hand, in the case of low SNR, the sparse block SC-FDMA achieves better performance compared to ZCZ time-spread OFDMA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11A
• /
• pp.867-875
• /
• 2003

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization in which TCP congestion window size is fluctuated during congestion period. Furthermore, if RTT(Round Trip Time) is increased, three duplicate ACK packets are not correct congestion signals because congestion might already disappear and the host may send more packets until it receives three duplicate ACK packets. Recently there are increasing interests in solving end-to-end congestion control using AQM(Active Queue Management) to improve the performance of TCP protocols. AQM is a variation of RED-based congestion control. In this paper, we first evaluate the effectiveness of the current AQM schemes such as RED, CHOKe, ARED, FRED and SRED, over traffic with different rates and over traffic with mixed responsive and non-responsive flows, respectively. In particular, CHOKe mechanism shows greater unfairness, especially when more unresponsive flows exist in a shared link. We then propose a new AQM scheme using CHOKe mechanism, called DQC(Double Queue CHOKe), which uses two FIFO queues before applying CHOKe mechanism to adaptive congestion control. Simulation shows that it works well in protecting congestion-sensitive flows from congestion-causing flows and exhibits better performances than other AQM schemes. Also we use partial state information, proposed in LRURED, to improve our mechanism.

• 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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.9
• /
• pp.251-258
• /
• 2012

Recently, NAND Flash memory structure is evolving from SDR (Single Data Rate) to high speed DDR(Double Data Rate) to fulfill the high performance requirement of SSD and SSS. Accordingly, the proper ways of transferring data that latches valid data stably and minimizing data skew between pins by using PHY(Physical layer) circuit techniques have became new issues. Also, rapid growth of speed in NAND flash increases the operating frequency and power consumption of NAND flash controller. Internal voltage variation margin of NAND flash controller will be narrowed through the smaller geometry and lower internal operating voltage below 1.5V. Therefore, the increase of power budge deviation limits the normal operation range of internal circuit. Affection of OCV(On Chip Variation) deteriorates the voltage variation problem and thus causes internal logic errors. In this case, it is too hard to debug, because it is not functional faults. In this paper, we propose new architecture that maintains the valid timing window in cost effective way under sudden power fluctuation cases. Simulation results show that the proposed technique minimizes the data skew by 379% with reduced area by 20% compared to using PHY circuits.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.1
• /
• pp.33-40
• /
• 2007

Processor pipelines have been growing deeper and issue widths wider over the years. If this trend continues, the branch misprediction penalty will become very high. Branch misprediction is the single most significant performance limiter for improving processor performance using deeper pipelining. Therefore, more accurate branch predictor becomes an essential part of modern processors. Several branch predictors combine a part of the branch address with a fixed amount of global branch history to make a prediction. These predictors cannot perform uniformly well across all programs because the best amount of branch history to be used depends on the program and branches in the program. Therefore, predictors that use a fixed history length are unable to perform up to their potential performance. In this paper, we propose a branch prediction mechanism, using variable length history, which predicts using a bank having higher prediction accuracy among predictions from five banks. Bank 0 is a bimodal predictor which is indexed with the 12 least significant bits of the branch address. Banks 1, 2, 3 and 4 are predictors which are indexed with different global history bits and the branch PC. In simulation results, the proposed mechanism outperforms gshare predictors using fixed history length of 12 and 13 , up to 6.34% in prediction accuracy. Furthermore, the proposed mechanism outperforms gshare predictors using best history lengths for benchmarks, up to 2.3% in prediction accuracy.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.6
• /
• pp.90-101
• /
• 2016

This study was initiated to develop an algorithm for traffic condition adaptive optimal traffic signal control for isolated intersections based on the vehicle trajectory data. The algorithm determines the optimal cycle length, phase lengths, phase sequences using the data collected under V2X communication environment every second. In addition, the algorithm utilizes a traditional feature of the actuated signal control, gap-out, using traditional detector systems to consider the mixture of normal vehicles and vehicles equipped with the V2X communication function. The performance of the algorithm was compared with that of the fixed signal timing plan which was optimized with Synchro under a microscopic traffic simulation-based test bed. As a result, the overall performance, including average delay, average stop delay, the number of stops, and average speed, are improved apparently. In addition, the amount of improvement get bigger as the traffic volume in the intersection as well as the number of vehicles equipped with the V2X communication function increase.