• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.772-775
• /
• 2008

As the wireless communication technology developed, the Electric Commerce using a mobile was activated. WPKI was developed in order to guarantee the stability of the Electric Commerce but it is difficult to be ensured for the safe PKI service which is the same at the wire communication in the technical because of restriction of the mobile terminal. In this paper, we propose the authentication system for the electronic financial service which is safe and is effective in consideration of the restrictive characteristic of the mobile terminal. Moreover, the encryption algorithm for the safe electronic signature is proposed. In WPKI, this makes the cross certification of each certificate authority possible. Moreover, a stability was enhanced through the signature authentication using KCDSA and SEED algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.6
• /
• pp.225-232
• /
• 2008

When a single source of multimedia contents is distributed to multiple reproduction devices, the audio and video contents require synchronous play for multi-channel stereo sound and lip-synchronization. The multimedia system in vehicle, especially, has researched to move to wireless environments from legacy wired environments. This paper proposes the advanced algorithm for providing synchronized services of real-time multimedia traffic in IEEE 802.11 WLANs [1]. For these, we implement the advanced IEEE 1588 Precision Time Protocol [2] and the environments for simulation. Also, we estimate and analysis performance of the algorithm, then we experiment and analysis after the porting of algorithm in wireless LAN devices (Linksys wrt-350n AP network device) to characterize timing synchronization accuracy.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.39-44
• /
• 2002

In this paper, in order to improve the performance of TCP short traffic application services in wireless Internet environments, the Split-ACKs (SPACK) scheme is proposed. In wireless networks, unlike wired networks, packet losses will occur more often due to high bit error rates. Therefore, each packet loss over wireless lints results in congestion control procedure of TCP being invoked at the source. This causes severe end-to-end Performance degradation of TCP. In this paper, to alleviate the TCP Performance, the SPACK method, split acknowledgement Packets in the base station, is proposed. Using computer simulation, the performance of TCP using SPACK is analysed and shows better performance than traditional TCP Protocol.

• Journal of KIISE:Information Networking
• /
• v.27 no.3
• /
• pp.247-255
• /
• 2000

최근 이동통신 서비스의 보급이 날로 증가됨에 따라 무선 접속 인터넷 서비스이 사용에 대한 요구가 급증하고 있다. 그러나 인터넷에서 사용되는 TCP 프로토콜은 에러 발생율이 낮은 유선망을 고려하여 설계되었기 때문에 망에서 발생되는 패킷 손실을 망내의 폭주로 인한 것으로 가정하고 폭죽제어 알고리즘을 동작시켜 윈도우 크기를 줄인다. 그러나 무선통신망과 같이 에러 발생율이 높은 환경에서는 패킷 손실이 주로 엘 발생에 기인하는데, 이 경우 기존의 TCP 프로토콜을 사용하면 폭주제어 알고리즘이 동작되어 TCP의 성능을 저하시키는 문제점이 발생된다. 따라서 본 논문에서는 유무선 복합망에서 TCP 프로토콜의 성능을 개선하기 위한 Split ACKs 기법을 제안하였다. 이 기법은 기지국에서 무선링크의 패킷 손실 이후에 수신된 ACK 패킷을 여러 개로 쪼개서 TCP 송신측으로 전달한다. 따라서 여러 개의 ACK 패킷을 수신한 TCP 송신측은 폭죽제어 알고리즘이 동작되어 감소시킨 윈도우 크기를 빠르게 복귀시켜 주기 때문에, 저하된 TCP 프로토콜의 성능을 신속히 향상시킬 수 있다. 아울러 제안된 기법은 기존 TCP 프로토콜을 그대로 사용할 수 있으며, TCP의 End-to-end Semantics가 유지되는 장점이 있다. 시뮬레이션을 통한 성능분석 결과 이 기법은 기존의 TCP 프로토콜에 비해 약 20%의 성능향상을 보였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1228-1231
• /
• 2008

유선 네트워크와는 달리 WLAN 메쉬 네트워크는 비용면이나, 이동성면에서 장점을 많이 가지고 있다. 이에 대한 표준화가 진행 중에 있지만 많은 문제점과 기술적으로 해결해야 할 부분들이 남아있다. 특히 무선 전송기술인 DCF는 WLAN 메쉬 네트워크에 직접적으로 적용시키기에는 많은 문제점을 가지고 있다. DCF를 사용할 경우에는 무선자원을 공유하는 노드의 수가 증가하고 보내려는 패킷이 증가할수록 프레임간 충돌횟수가 급격히 증가해 무선자원의 사용 효율이 현저히 떨어지기 때문이다. 반면 PCF는 노드에게 일정시간 채널을 점유할 권리를 부여함으로써 프레임간 충돌을 없애 무선자원의 사용 효율을 향상시킬 수 있다. 하지만 트래픽이 적은 경우에는 불필요한 조사 프레임 전송, 조사목록 갱신 등으로 무선자원을 낭비하는 단점이 있다. 따라서 이 두 기술의 장점을 이용하여 WLAN 메쉬 네트워크에 적용시킨다면 데이터 전송의 효율을 증대시킬 수 있다. WLAN 메쉬 네트워크의 기본 통신범위 내에는 많은 노드들이 있으며 이를 계층적으로 나눌 경우 계층에 따라 트래픽의 양에 많은 차이를 보인다. 따라서 본 논문에서는 WLAN 메쉬 네트워크에서 DCF와 PCF를 트래픽에 따라 유연하게 사용함으로써 전송 효율을 증대시키는 적응형 HMAC 알고리즘을 제안한다. 시뮬레이션 결과 WLAN 메쉬 네트워크가 DCF에 전적으로 의존하는 경우에 비하여 적응형 HMAC 알고리즘이 적용된 WLAN 메쉬 네트워크는 트래픽이 증가할수록 수율, 지연 등에서 더 좋은 성능을 나타내었다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1654-1662
• /
• 2006

An ad hoc network is multi-hop network composed of radio links. and the transmission quality of a radio link is more unstable than that of a wired circuit. Packet loss thus occurs frequently in an ad hoc network, and the consequent connection failure results in a severe deterioration of TCP performance. TCP performance also deteriorates because of the collision of data packets and ACK packets in the radio channel. In this paper we study to improve the performance of the Mobile Ad-hoc network by using Delayed ACK algorithm with our proposed ODA(Ordering-Delayed ACK) method. The proposed ODA algorithm increases the number of the data packets orderly at the receiver side which is going to be applied for the Mobile Ad-hoc network. We accomplished a computer simulation using NS-2. From the simulation results, we find the proposed ODA algorithm obviously enlarge the channel capacity and improve the network performance at the situation of multi-hop of ad-hoc network than the existing Delayed ACK algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.6
• /
• pp.778-785
• /
• 2020

Wireless mesh networks consist of mesh clients, mesh routers and mesh access points. The mesh router connects wireless network services to the mesh client, and the mesh access point connects to the backbone network using a wired link and provides Internet access to the mesh client. In this paper, a limited number of mesh routers and mesh access points are used to propose optimization algorithms for network design for wireless mesh networks. The optimization algorithm in this paper has been applied with a sub-subscription algorithm, which is one of the meta-heuristic methods, and is designed to minimize the transmission delay for the placement of mesh routers and mesh access points, and produce optimal results within a reasonable time. The proposed algorithm was evaluated in terms of transmission delay and time to perform the algorithm for the placement of mesh routers and mesh access points, and the performance evaluation results showed superior performance compared to the previous meta-heuristic methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.1
• /
• pp.1-9
• /
• 2009

OFDM(Orthogonal Frequency Division Multiplexing) system is robust to frequency selective fading and narrowband interference in high-speed data communications. However, an OPDM signal consists of a number of independently modulated subcarriers and the superposition of these subcarriers causes a problem that can give a large PARR(Peak-to-Average Power Ratio). PTS(Partial Transmit Sequence) scheme can reduce the PAPR by dividing OFDM signal into subblocks and then multiplying the phase weighting factors to each subblocks, but computational complexity for selecting of phase weighting factors increases exponentially with the number of subblocks. Therefore, in this paper, MG-PSO(Modified Greedy algorithm-Particle Swarm Optimization) algorithm that combines modified greedy algorithm and PSO(Particle Swarm Optimization) algorithm is proposed to use for the phase control method in PTS scheme. This method can solve the computational complexity and guarantee to reduce PAPR. We analyzed the performance of the PAPR reduction when we applied the proposed method to telecommunication systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.641-644
• /
• 2016

Unlike wired networks, broadcasting in wireless networks can transmit data at once to several nodes with a single transmission. For omnidirectional broadcast to a node in wireless networks, all adjacent nodes receive the data at the same time. In this paper, we propose a greedy algorithm to solve the minimum power broadcasting problem of minimizing the total transmit power on broadcasting in wireless networks. We apply two matrices to the proposed algorithm: one is a distance matrix that represents the distance between each node, the other is an adjacency matrix having the number of adjacency nodes. Among the nodes that receive the data, a node that has the greatest number of the adjacent node transmits data to neighbor preferential. We compare the performance of the proposed algorithm with random method through computer simulation in terms of transmitting power of nodes. Experiment results show that the proposed algorithm outperforms better than the random method.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.187-193
• /
• 2004

Wireless networks play a very important role in communications today. For example, wireless networks today provide from the basic services like e-mail and FTP to the multimedia applications like Web service. It is obvious that QoS requirements to these diverse applications over wireless networks will continue as in wired networks. Much research has been done to develop QoS supporting algorithms on Internet. But due to the limited bandwidth and varying channel states of the wireless networks, it is difficult to support differentiated service over wireless networks. In this paper we propose the modified wireless token ring protocol supporting QoS to the real-time traffic service node over Internet environments in which non-real-time and real-time traffic service nodes coexist. In the proposed algorithm, the real-time traffic service node gets the priority to take token over the non-real-time traffic service node. So the proposed algorithm support quick transmission of the real-time traffic service node. And this advantage can be obtained with minor modification of the legacy wireless token ing protocol to support QoS. We also consider the lost token recovery mechanism.