• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1238-1259
• /
• 2019

Saving energy is a big challenge for Wireless Sensor Networks (WSNs), which becomes even more critical in large-scale WSNs. Most energy waste is communication related, such as collision, overhearing and idle listening, so the schedule-based access which can avoid these wastes is preferred for WSNs. On the other hand, clustering technique is considered as the most promising solution for topology management in WSNs. Hence, providing interference-free clustering is vital for WSNs, especially for large-scale WSNs. However, schedule management in cluster-based networks is never a trivial work, since it requires inter-cluster cooperation. In this paper, we propose a clustering method, called Interference-Free Clustering Protocol (IFCP), to partition a WSN into interference-free clusters, making timeslot management much easier to achieve. Moreover, we model the clustering problem as a multi-objective optimization issue and use non-dominated sorting genetic algorithm II to solve it. Our proposal is finally compared with two adaptive clustering methods, HEED-CSMA and HEED-BMA, demonstrating that it achieves the good performance in terms of delay, packet delivery ratio, and energy consumption.

• Journal of Sensor Science and Technology
• /
• v.24 no.2
• /
• pp.107-112
• /
• 2015

HIGHT is an 64-bit block cipher, which is suitable for low power and ultra-light implementation that are used in the network that needs the consideration of security aspects. This paper presents a parallel key scheduler that generates the whitening keys and subkeys simultaneously for both encryption and decryption processes. We construct the reverse LFSR and key generation blocks to generate the keys for decryption process. Then, the new key scheduler is made by sharing the common logics for encryption and decryption processes to minimize the increase in hardware complexity. From the simulation results, the logic size is increased 1.31 times compared to the conventional HIGHT. However, the performance of HIGHT including the proposed key scheduler can be increased by two times compared to the conventional counterpart.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.4
• /
• pp.1617-1623
• /
• 2016

Cisplatin-based concurrent chemoradiation plays an undisputed key role as definitive treatment in unresectable patients with locally advanced squamous cell carcinoma head and neck or as an organ preservation strategy. Treatment with 100 mg/m2 3-weekly cisplatin is considered the standard of care but is often associated with several adverse events. The optimum drug schedule of administration remains to be defined and presently, there is insufficient data limiting conclusions about the relative tolerability of one regimen over the other. This review addresses regarding the optimal dose schedule of cisplatin focusing mainly on three-weekly and weekly dose of cisplatin based concurrent chemoradiotherapy in locally advanced head and neck cancer with an emphasis on mucositis, dermatitis, systemic toxicity, compliance, and treatment interruptions. To derive a definitive conclusion, large prospective randomized trials are needed directly comparing standard 3-weekly cisplatin ($100mg/m^2$) with weekly schedule ($30-40mg/m^2$) of concurrent cisplatin based chemoradiotherapy in locally advanced squamous cell carcinoma head and neck.

• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.227-237
• /
• 2016

Data collection is a key function for wireless sensor networks. There has been numerous data collection scheduling algorithms, but they fail to consider the deep and complex relationship among network lifetime, sink aggregated information and sample cycle for wireless sensor networks. This paper gives the upper bound on the sample period under the given network topology. An optimal schedule algorithm focusing on aggregated information named OSFAI is proposed. In the schedule algorithm, the nodes in hotspots would hold on transmission and accumulate their data before sending them to sink at once. This could realize the dual goals of improving the network lifetime and increasing the amount of information aggregated to sink. We formulate the optimization problem as to achieve trade-off among sample cycle, sink aggregated information and network lifetime by controlling the sample cycle. The results of simulation on the random generated wireless sensor networks show that when choosing the optimized sample cycle, the sink aggregated information quantity can be increased by 30.5%, and the network lifetime can be increased by 27.78%.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.6
• /
• pp.3-13
• /
• 2010

Differential Fault Analysis (DFA) is widely known for one of the most efficient method analyzing block cipher. In this paper, we propose a new type of DFA on DES (Data Encryption Standard). DFA on DES was first introduced by Biham and Shamir, then Rivain recently introduced DFA on DES middle rounds (9-12 round). However previous attacks on DES can only be applied to the encryption process. Meanwhile, we first propose the DFA on DES key-schedule. In this paper, we proposed a more efficient DFA on DES key schedule with random fault. The proposed DFA method retrieves the key using a more practical fault model and requires fewer faults than the previous DFA on DES.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.42 no.6
• /
• pp.861-868
• /
• 2022

A key use of applying building information modeling (BIM) to the construction stage of a project is to help identify construction obstacles and to visualize construction status according to the progress of the construction schedule. When employing 4D simulation for this purpose, start and finish dates for each activity and a 3D model of the activity must be prepared. In this work, in order to simplify the configuration of a 4D model, minimum attribute information of the BIM model produced in the design stage was used to construct a system that generated activity information in the construction stage using a clustering algorithm. Its usefulness as actual schedule management information was then analyzed.

• The Pure and Applied Mathematics
• /
• v.12 no.2 s.28
• /
• pp.143-152
• /
• 2005

We present a new block cipher called DyC. It consists of four sets (procedures) having the different $2^2,\;2^2,\;2^4$, and $2^8$ one-to-one correspondence functions as the elements. The round key is used to determine exactly one composite function from the possible $2^{16}$ composite functions. DyC supports 8 $\times$ n bit key size, 16 $\times$ m bit block length, and n rounds. We have confirmed that DyC offers security against other well-known advanced cryptanalytic attacks including the slide attacks and interpolation attacks. In this paper, we show several properties of the key schedule of DyC by mathematical analysis.

• ETRI Journal
• /
• v.45 no.3
• /
• pp.365-378
• /
• 2023

ARIA is a block cipher proposed by Kwon et al. at ICISC 2003 that is widely used as the national standard block cipher in the Republic of Korea. Herein, we identify some flaws in the quantum rebound attack on seven-round ARIA-DM proposed by Dou et al. and reveal that the limit of this attack is up to five rounds. Our revised attack applies to not only ARIA-DM but also ARIA-MMO and ARIA-MP among the PGV models, and it is valid for all ARIA key lengths. Furthermore, we present dedicated quantum rebound attacks on seven-round ARIA-Hirose and ARIA-MJH for the first time. These attacks are only valid for the 256-bit key length of ARIA because they are constructed using the degrees of freedom in the key schedule. All our attacks are faster than the generic quantum attack in the cost metric of the time-space tradeoff.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.1
• /
• pp.58-65
• /
• 2008

Reliability-Centered Maintenance plan for maintenance schedule of generating unit is being assessed in this paper. Maintenance schedule is a key index that can be used to determine stability and cost. In this paper, stochastic FMECA is described for the life assessment by using probability distribution, and combustion-turbine generations in Korean power systems have been assessed for maintenance schedule. Such an assessment can be a useful guide for maintenance plans in restructured power industry.

• Korean Journal of Construction Engineering and Management
• /
• v.8 no.4
• /
• pp.119-127
• /
• 2007

Cost and Schedule is the most important information, and how efficiently manage this information is the key issue for Construction Project Management. Domestically, systematic scheduling method such as CPM network is not only used widely but integration of time and cost information also is. In order to effectively integrate and use the time and cost information, it is suggested that WBS(Work Breakdown Structure) based QDB(Quantity Database) should be generated from the design phase and, WBS and QDB related system tool should be supported. It could be helpful to relate and integrate other construction project information.