• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.6 s.336
• /
• pp.41-52
• /
• 2005

In wireless networks there are various errors, caused by multi-path fading and interference between devices which lower the network Performance. Especially, performance of IEEE 802.IS.3 High-Rate WPAN (Wireless Personal Area Network) which is operated in ISM unlicensed frequency band is easily affected by channel errors. In this paper, we propose a scheduling algorithm which takes channel errors into consideration in scheduling asynchronous data traffic. The proposed scheduling algorithm can allocate CTA(Channel Time Allocation) proportionally in accordance with the requested channel time of each device. It also prevents waste of channel time by allocating CTA of the channel-error devices to other channel-error free devices. After recovering from the channel error, the devices are compensated as much as they conceded during channel error status. Simulation results show that the proposed scheduling algorithm is superior to the existing SRPT(Shortest Remain Processing Time) and RR(Round Robin) in throughput and fairness aspects.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.163-168
• /
• 2003

In transmitting compressed video bit-stream over Internet, packet loss causes error propagation in both spatial and temporal domain, which in turn leads to severe degradation in image quality. In this paper, a new approach for the recovery of lost or erroneous Motion Vector(MV)s by classifying the movements of neighboring blocks by their homogeneity is proposed. MVs of neighboring blocks are classified according to the direction of MVs and a representative value for each class is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in many cases than existing methods.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.298-304
• /
• 2004

In transmitting a compressed video bit-stream over Internet, a packet loss causes an error propagation in both spatial and temporal domain, which in turn leads to a severe degradation in image quality. In this paper, a new error concealment algorithm is proposed to repair damaged portions of the video frames in the receiver. Conventional BMA(Boundary Matching Algorithm) assumes that the pixels on the boundary of the missing block and its neighboring blocks are very similar, but has no consideration of edges t)r discontinuity across the boundary. In our approach, the edges are detected across the boundary of the lost or erroneous block. Once the edges are detected and the orientation of each edge is found, only the pixel difference along the expected edges across the boundary is measured instead of calculating differences between all adjacent pixels on the boundary. Therefore, the proposed approach needs very few computations and the experiment shows an improvement of the performance over the conventional BMA in terms of both subjective and objective quality of video sequences.

• Journal of Internet of Things and Convergence
• /
• v.6 no.2
• /
• pp.93-100
• /
• 2020

Although various home services are developed as increasing the number of home devices with wire and wireless connection, privacy infringement and private information leakage are occurred by unauthorized remote connection. It is almost caused by without of device authentication and protection of transmission data. In this paper, the devices' secret value are stored in a safe memory of a smartphone. A smartphone processes device authentication. In order to prevent leakage of a device's password, a shadow password multiplied a password by the private key is stored in a device. It is proposed mutual authentication between a smartphone and a device, and session key agreement for devices using recovered passwords on SRP. The proposed protocol is resistant to eavesdropping, a reply attack, impersonation attack.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.4
• /
• pp.293-304
• /
• 2005

In this paper, we research on job migration in a grid computing environment with cactus and MPICH-C2 based on Globus. Our concepts are to perform job migration by finding the site with plenty of computational resources that would decrease execution time in a grid computing environment. The Migration Manager recovers the job from the checkpointing files and restarts the job on the migrated site. To select a migrating site, the proposed method considers system's performance index, cpu's load, network traffic to send migration job tiles and the execution time predicted on a migration site. Then it selects a site with maximal performance gains. By selecting a site with minimum migration time and minimum execution time. this approach implements a more efficient grid computing environment. The proposed method Is proved by effectively decreasing total execution time at the $K\ast{Grid}$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.6
• /
• pp.827-833
• /
• 2022

This study aims to prevent secondary traffic accidents with high severity by overcoming the limitations of existing traffic information collection systems through analysis of traffic information collection detectors and various algorithms used to detect unexpected situations. In other words, this study is meaningful present that analyzing the 'unexpected situation that causes secondary traffic accidents' and 'Existing traffic information collection system' accordingly presenting a solution that can preemptively prevent secondary traffic accidents, intelligent traffic information collection system that enables accurate information collection on all sections of the road. As a result of the experiment, the reliability of data transmission reached 97% based on 95%, the data transmission speed averaged 209ms based on 1000ms, and the network failover time achieved targets of 50sec based on 120sec.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.466-474
• /
• 2007

Asymmetric networks that the downlink bandwidth is larger than the uplink bandwidth may cause the degradation of the TCP performance due to the uplink congestion. In order to solve this problem, this paper designs and implements the Dynamic Segment Size Control mechanism which offers a suitable segment size for current networks. The proposed mechanism does not require any changes in customer premises but suppress the number of ACKs using segment reassembly technique to avoid the uplink congestion. The gateway which adapted the Dynamic Segment Size Control mechanism, detects the uplink congestion condition and dynamically measures the bandwidth asymmetric ratio and the packet loss ratio. The gateway reassembles some of segments received from the server into a large segment and transmits it to the client. This reduces the number of corresponding ACKs. In this mechanism, the SACK option is used when occurs the bit error during the transmission. Based on the simulation in the GEO satellite network environment, we analyzed the performance of the Dynamic Segment Size Control mechanism.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.85-96
• /
• 2005

A ' Virtual Private Network (YPN) over Internet' has the benefits of being cost-effective and flexible. However, given the increasing demands for high bandwidth Internet and for reliable services in a 'VPN over Intemet,' an IP/GMPLS over DWDM backbone network is regarded as a very favorable approach for the future 'Optical VPN (OVPN)' due to the benefits of transparency and high data rate. Nevertheless, OVPN still has survivability issues such that a temporary fault can lose a large amount of data in seconds, moreover unauthorized physical attack can also be made on purpose to eavesdrop the network through physical components. Also, logical attacks can manipulate or stop the operation of GMPLS control messages and menace the network survivability of OVPN. Thus, network survivability in OVPN (i.e. fault/attack tolerant recovery mechanism considering physical structure and optical components, and secured transmission of GMPLS control messages) is rising as a critical issue. In this Paper, we propose a new path establishment scheme under shared risk link group (SRLG) constraint for physical network survivability. And we also suggest a new logical survivability management mechanism by extending resource reservation protocol-traffic engineering extension (RSVP-TE+) and link management protocol (LMP). Finally, according to the results of our simulation, the proposed algorithms are revealed more effective in the view point of survivability.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.4
• /
• pp.31-37
• /
• 2008

Conventional cooperative communications can attain gain of spatial diversity and path loss reduction because destination node independently received same signal from source node and relay node located between source node and destination node. However, these techniques bring about decreased spectral efficiency with relay node and increased complexity of receiver by using maximal ratio combining (MRC). This paper has proposed cooperative ARQ protocol that can improve the above problems and can get the better performance. This method can increase the spectral efficiency than conventional cooperative communication because if the received signal from source node is satisfied by the destination preferentially, the destination transmits ACK message to both relay node and source node and then recovers the received signal. In addition, if ARQ message indicates NACK relay node operates selective retransmission and we can increase reliability of system compared with that of general ARQ protocol in which source node retransmits data. In the proposed protocol, the selective retransmission and ARQ message are to be determined by comparing log-likelihood ratio (LLR) computation of received signal from source node with predetermined threshold values. Therefore, this protocol don't waste redundant bandwidth with CRC code and can reduce complexity of receiver without MRC. We verified spectral efficiency and BER performance for the proposed protocol through Monte-Carlo simulation over Rayleigh fading plus AWGN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.117-128
• /
• 2006

For the legacy IEEE 802.15.3 WPAN protocol, an unpredictable piconet coordinator(PNC) leaving from a piconet without a proper handoff procedure causes an absence of PNC, and thus the piconet gets collapsed. In addition, several beacons from PNCs in adjacent piconets may be collided on a device(DEV) located between those piconets. This beacon collision eventually makes the DEV leave from the piconet. To remedy these two problems, we here propose an Active Seamless Coordinator Switching(ASCS) scheme and a PNC HB based Beacon Alignment(PHBA) one. In the ASCS scheme, a PNC assigns a number of DEVs as next possible PNCs in sequence for provisioning against the abrupt breakdown of the current active PNC. Each nominated DEV proactively sends a probe frame to confirm the operation status of the active PNC. For the case of no response from the PNC, the nominated DEV tries to become a new PNC immediately. In the second PHBA scheme, each PNC is allow to broadcast a special Heart Beat(HB) frame randomly during a superframe period. When a DEV receives a HB frame from other PNC, it promptly sends the related PNCs a special Hiccup Beat(HCB) frame with the superframe information of its associated PNC. As a result, the HCB frame makes both PNCs align their superframe beginning time in order to yield no more beacon collisions. For these two proposed schemes, we show the performance by simulations. We can confirm the enhancement of throughput for each superframe and average frame transfer delay, since each scheme can reduce the duration of piconet collapse. Finally, it is worth while to note that the proposed schemes can be operated with frames those are permitted in the legacy WPAN standard.