• Macromolecular Research
• /
• v.11 no.2
• /
• pp.80-86
• /
• 2003

The polymerization of a cyclopolymerizable disubstituted dipropargyl ether, his(3-trimethylsilyl-2-propynyl)ether (BTPE), was attempted by various transition metal catalysts. The yield for the polymerization of BTPE was generally low, which is possibly due to the steric hindrance of bulky substituents. In general, the catalytic activities of Mo-based catalysts were found to be greater than those of W-based catalysts. The highest yield was obtained when the MoCl$_{5}$,-EtAlCl$_2$(1:2) catalyst system was used. The copolymerization of BTPE and diethyl dipropargylmalonate yielded a random copolymer with conjugated polymer backbone. However the polymers were partially desilylated, depending on the reaction conditions. The thermal and morphological properties of the resulting polymers were also discussed.d.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.7 no.4
• /
• pp.622-632
• /
• 1995

The present numerical study is aimed to investigate time-dependent characteristics of a two-dimensional lid-driven square cavity flow of three high Reynolds numbers, $7.5{\times}10^3$, $10^4$ and $3{\times}10^4$. A conservative convection term on irregular grids was adopted by renewing the MAC type difference schemes on regular grids. Relaxation of velocity and pressure is implemented by SOLA algorithm. In case of $Re=7.5{\times}10^3$, flow behavior converges to steady state after a transient period. But for $Re=10^4$, periodic unsteady sinusoidal fluctuation of local velocity and kinetic energy is found and continuous movements of small eddies in the secondary flow regions are also discovered. Random generation of eddies and their active migrating behavior are detected for $Re=3{\times}10^4$, resulting in complete unsteady and non-linear flow characteristics. And, an organized structure similar to a Moffat vortex is also observed from the time-mean flow patterns. Furthermore, a typoon-like vortex(TLV) appears intemittently and rotates along the separation regions and boundary layers.

• Journal of Information Processing Systems
• /
• v.16 no.3
• /
• pp.541-556
• /
• 2020

Wireless networks have become integral to society as they provide mobility and scalability advantages. However, their disadvantage is that they cannot control the media, which makes them vulnerable to various types of attacks. One example of such attacks is the evil twin access point (AP) attack, in which an authorized AP is impersonated by mimicking its service set identifier (SSID) and media access control (MAC) address. Evil twin APs are a major source of deception in wireless networks, facilitating message forgery and eavesdropping. Hence, it is necessary to detect them rapidly. To this end, numerous methods using clock skew have been proposed for evil twin AP detection. However, clock skew is difficult to calculate precisely because wireless networks are vulnerable to noise. This paper proposes an evil twin AP detection method that uses a multiple-feature-based machine learning classification algorithm. The features used in the proposed method are clock skew, channel, received signal strength, and duration. The results of experiments conducted indicate that the proposed method has an evil twin AP detection accuracy of 100% using the random forest algorithm.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.92-105
• /
• 2015

WBAN (Wireless Body Area Network) is a network which is to consistently monitor body signals with implanted or attached sensor nodes. Especially, nodes that are used in medical services have to operate with low power consumption since they are hard to replace, and have to guarantee high data rate and low transmission delay for consistent signal monitor. In this paper, we propose an algorithm that aims to reduce transmission delay and power consumption, and guarantees stable throughput, by assuming the number of active nodes, and followed by dynamically adjusting the random access period and transmission possibilities in a superframe. The assumed number of active nodes may be incorrect since it only relies on the channel status of a previous superframe. Therefore, we assume the number of active nodes and define a pattern. And revise the number of the active nodes with the defined pattern. To evaluate the performance of the proposed algorithm, we have implemented a WBAN environment with the MATLAB. The simulation results show that the proposed algorithm provides better throughput, low power consumption, and low transmission delay when compared to the slotted ALOHA of the IEEE 802.15.6.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.2
• /
• pp.199-208
• /
• 2014

Code division multiple access (CDMA) is one of the promising medium access control (MAC) schemes for underwater acoustic sensor networks because of its robustness against frequency-selective fading and high frequency-reuse efficiency. As a way of performance evaluation, sea or lake experiment has been employed along with computer simulation.. In this study, we design the underwater CDMA forward-link transceiver and evaluate the feasibility aginst harsh underwater acoustic channel in water-tank first. Then, based on the water-tank experiment results, we improved the transceiver and showed the improvements in a lake experiment. A pseudo random noise code acquisition process is added for phase error correction before decoding the user data by means of a Walsh code in the receiver. Interleaving and convolutional channel coding scheme are also used for performance improvement. Experimental results show that the multiplexed data is recovered by means of demultiplexing at receivers with error-free in case of two users while with less than 15% bit error rate in case of three and four users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1463-1479
• /
• 2013

In this paper, we propose an unequal protection physical coding sub-layer (PCS) forward error correction (FEC) scheme for efficient and high-quality transmission of video data over optical access networks. Through identifying and resolving the unequal importance of different video frames and passing this importance information from MAC-layer to PCS, FEC scheme of PCS can be adaptive to application-layer data. Meanwhile, we jointly consider the different channel situations of optical network unit (ONU) and improve the efficiency of FEC redundancy by channel adaptation. We develop a theoretical algorithm and a hardware method to achieve efficient FEC assignment for the proposed unequal protection scheme. The theoretical FEC assignment algorithm is to obtain the optimal FEC redundancy allocation vector that results in the optimum performance index, namely frame error rate, based on the identified differential importance and channel situations. The hardware method aims at providing a realistic technical path with negligible hardware cost increment compared with the traditional FEC scheme. From the simulation results, the proposed Channel and Application-layer data Adaptation Unequal Protection (CAAUP) FEC scheme along with the FEC ratio assignment algorithm and the hardware method illustrates the ability of efficient and high-quality transmission of video data against the random errors in the channel of optical access networks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1098-1115
• /
• 2010

An inseparable challenge associated with every random access network is the design of an efficient Collision Resolution Algorithm (CRA), since collisions cannot be completely avoided in such network. To maximize the collision resolution efficiency of a popular CRA, namely Binary Exponential Backoff (BEB), we propose a reactive backoff algorithm. The proposed backoff algorithm is reactive in the sense that it updates the contention window based on the previously selected backoff value in the failed contention stage to avoid a typical type of collision, referred as cross-collision. Cross-collision would occur if the contention slot pointed by the currently selected backoff value appeared to be present in the overlapped portion of the adjacent (the previous and the current) windows. The proposed reactive algorithm contributes to significant performance improvements in the network since it offers a supplementary feature of Cross Collision Exclusion (XCE) and also retains the legacy collision mitigation features. We formulate a Markovian model to emulate the characteristics of the proposed algorithm. Based on the solution of the model, we then estimate the throughput and delay performances of WLAN following the signaling mechanisms of the Distributed Coordination Function (DCF) considering IEEE 802.11b system parameters. We validate the accuracy of the analytical performance estimation framework by comparing the analytically obtained results with the results that we obtain from the simulation experiments performed in ns-2. Through the rigorous analysis, based on the validated model, we show that the proposed reactive cross collision exclusionary backoff algorithm significantly enhances the throughput and reduces the average packet delay in the network.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.132-132
• /
• 2001

본 논문에서는 혼합예약요청(hybrid reservation request) 알고리즘을 적용한 새로운 동적 예약 TDMA 프로토콜을 제안한다. 제안된 혼합 예약 요청 알고리즘은 기존의 랜덤접속방식과 기지국의 중재 없이 단말간 직접 신호교환을 통하여 이웃 단말의 새로운 예약 요청을 대신 전송하는 방식을 혼합해서 사용하는 방법이다. 이 알고리즘은 기존 slotted-ALOHA 방식을 이용한 예약 요청의 비효율성을 개선하여 새로운 단말의 예약 요청실패로 인한 셀 전송지연 및 호 봉쇄 확률(call blocking probability)을 줄이기 위한 목적으로 제안되었다. 제안한 알고리즘은 새로 전송할 데이터를 가진 단말이 많은 경우에 특히 효율적이다. 본 논문에서 제안하는 프로토콜은 모든 종류의 트래픽이 예약을 통한 전송방식으로 전송된다. 즉, 단말들로부터의 예약 요청을 바탕으로, 기지국이 스케줄링을 하여 트래픽 별로 접근 슬랏을 할당해 주는 방식이다. 이 경우, 예약 요청을 하는 방법은 새로 전송을 개시하는 단말과 이미 전송중인 단말의 경우가 다른데, 새로운 전송을 위한 예약이 필요한 단말은 제안하는 알고리즘을 이용하며, 이미 예약에 성공한 단말은 기존에 사용하던 자신의 버스트헤더(burst header)에 피기백(piggybacking)하는 방법을 이용한다. 제안한 알고리즘에 따라, 새로 접속하는 단말이나 새로운 예약 요청이 필요한 단말은 두 단계로 요청을 전송할 수 있다. 첫 번째 단계는 이미 예약에 성공하여 전송중인 이웃단말에게 전송요청신호를 보내 간접적으로 기지국에게 예약을 요청하는 방법이며, 두 번째 단계는 첫 번째 방법이 실패했을 경우 기존의 랜덤접속방법에 참가하는 것이다 먼저 첫 번째 방법에서는 단말이 랜덤접근 구간의 예약요청구간(resonation request)중 하나의 미니 슬랏을 선택해 이웃 단말들에게 한번 방송(broadcast) 한다 이후 ACK 응답구간(ACK receive)에서 응답을 받으면 예약요청성공이라 간주하고, 그렇지 않으면 실패로 판단, 뒤이어 오는 랜덤접근구간(normal random access period)에 참가하여 기지국에게 직접 예약 요청을 한다. 시뮬레이션은 기존 slotted-ALOHA방식으로 랜덤 접속을 할 경우와 제안한 방식과의 성공률을 비교해 제안한 방식의 call blocking probability가 낮음을 보였다.