• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.30 no.3
• /
• pp.215-222
• /
• 2019

A frequency hopping(FH) signal can change its carrier frequency during transmission and has spread-spectrum characteristics in these frequency bands. Therefore, FH signals are widely used in applications that require low-probability-of-intercept(LPI) and anti-jamming (AJ) abilities in wireless communication environments. In this study, the authors propose a method for generating hopping information (HI), which includes start time, dwell time, and hopping frequency for unknown FH signals. The proposed blind HI generation method produces signal detection information based on the spectrum data and then extracts HI using operational procedures for estimating the target FH signal's status, such as appearance, maintenance, and termination. Further, simulation results demonstrate that the proposed method provides accurate HI without detection omissions for various FH signals.

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

최근 인터넷 사용자들의 요구는 멀티미디어로 집중되고 있으며 그중 라이브 미디어 스트리밍 서비스에 대한 요구가 증가하고 있다. 라이브 서비스에서는 적절한 시간에 사용자에게 데이터가 도착하는 것이 중요하다. 따라서 라이브의 시간적절성을 충족시켜 줄 효율적이고 신속한 데이터 전달구조와 전송기법이 요구된다. 이에 본 논문에서는 트리와 메시 구조를 혼합한 하이브리드 방식으로 네트워크 자원을 효율적으로 사용하면서 빠른 데이터 전송으로 라이브의 시간적절성을 충족시킬 수 있는 데이터 분할 전송 방식의 P2P(Peer-to-Peer) 오버레이 구조를 제안한다. 제안하는 ToG(Tree of Groups)는 n개의 피어들이 메시로 그룹을 형성하고, 그렇게 형성된 그룹들이 트리를 이루는 구조이다. ToG에서 그룹 내의 각 피어들은 상위그룹의 피어 한 개와 부모-자식으로 연결되어 있어서 그룹 사이에 여러 개의 연결이 존재하게 된다. 따라서 그룹 내에서 어느 한 피어가 그룹을 빠져 나가더라도 상위그룹과의 여러 연결에 의해서 서비스 지속성을 보장 할 수 있다. ToG는 그룹단위로 트리가 형성되기 때문에 피어의 개수가 같을 때 피어단위로 트리를 형성하는 구조보다 트리의 깊이가 줄어든다. 그에 따라 말단에 있는 피어들에게까지 빠른 시간에 데이터가 전달 될 수 있다. ToG의 데이터 전달은 소스로부터 세그먼트가 일정한 값 n으로 나뉘어져 각 피어들에게 전달된다. 세그먼트 조각은 소스로부터 나뉘어져 전송 될 때 책임적으로 전달해야할 피어와 전달 순서가 정해져있고, 데이터 전송 스케줄링을 위한 버퍼 맵 교환은 필요하지 않다.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.501-509
• /
• 2002

When using TCP over a mobile network, TCP responds to a handoff by invoking a congestion control algorithm, thereby resulting in a degraded end-to-end performance in a mobile network. In this paper, two schemes are proposed, TCP-MD and TCP-R. TCP-MD can detect the movement of s mobile host early on, whereas TCP-R can force the source to freeze data transmission during registration. The proposed schemes maintain end-to-end TCP semantics, making it possible to fully interoperate with the existing infrastructure. Only a small change is required in the mobile host, plus the implementation is simple because some Mobile IP messages are used to notify the handoff, eliminating the need for any additional messages. Simulations confirmed that the proposed schemes give an excellent performance under various environments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.893-898
• /
• 2003

This paper proposes a Truncated Type-II Hybrid ARQ scheme and coding techniques using an adaptive modulation system to achieve high throughput data transmission systems for wireless multimedia communication systems. In this paper, the adaptive modulation system analyzed in Nakagami (m-distribution) fading channel environment. The adaptive modulation system controls the modulation level and symbol rate according to the Nakagami fading parameter(m). When the received Eb/No is high or the Nakagami fading parameter m is high, the propose system selects higher modulation level and higher symbol rate to increase throughput. On the other hand, this system selects lower modulation level and lower symbol rate to prevent throughput performance degradation when the received Eb/No is low. The modulation method have been adopted QPSK(Quadrature Phase Shift Keying), 16QAM(Quadrature Amplitude Modulation), 64QAM, 256QAM. Therefore, adaptive modulation systems with truncated type-II hybrid ARQ scheme is proper for wireless multimedia communication system that require high reliability and delay-limited applications.

• The KIPS Transactions:PartC
• /
• v.11C no.6 s.95
• /
• pp.829-834
• /
• 2004

Nodes communicate through wireless channels under peer-to-peer level in ad-hoc mobile networks. The nodes are free to move around in a geographical area and are loose]y bounded by the transmission range of the wireless channels. Also, a node is completely free to move around, there is no fixed final topology. Hence, to manage the inter-node communication and data exchange among them a leader node is required. In this paper we introduce an efficient leader election algorithm for mobile ad hoc networks where inter-node communication is allowed only among the neighboring nodes. Furthermore we present the result of performance evaluation through simulation. The algorithm is efficient and practical since it uses least amount of wireless resources and does not affect the movement of the nodes.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.51-60
• /
• 2003

One of the most important matters in designing network and realizing service, is to grip on the traffic characteristics. Conventional traffic prediction and analysis used the models which based on the Poisson or Markovian. Recently, experimental research on the LAN, WAN and VBR traffic properties have been pointed rut that they weren't able to display actual real traffic specificities because the models based on the Poisson assumption had been underestimated the long range dependency of network traffic and self-similar peculiarities, it has been lately presented that the new approach method using self-similarity characteristics as similar as the real traffic models. Therefore, in this paper, we generated self-similar data traffic like real traffic as background load. On the existing ABR congestion control algorithm, we analyzed by classify into ACR, buffer utilization. cell drop rate, transmission throughput with the representative EFCI, ERICA, EPRCA and NIST twitch algorithm to show the efficient reaction about the burst traffic.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.3
• /
• pp.81-89
• /
• 2010

The research on peer-to-peer streaming schemes has largely focused on tree-push and mesh-pull structures. However, the tree-push structure has a defect that the tree restructuring time is long, and the mesh-pull structure has long startup delay and lag time from source servers. In this paper, we propose a new peer-to-peer live streaming scheme based on a push-mesh structure that takes advantages of tree-push and mesh-pull structure simultaneously. This structure basically provides the mesh-pull mechanism for data transmission and utilizes peers with high network upload capacity. It also supports the push mechanism along with paths from a source server, super peers, and selected general peers. By NS-2 simulation experiments, we finally show that our proposed scheme can achieve shorter startup delay than the mesh-pull structure, similar lag time to tree-push structure and best playback continuity among the three schemes.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.1
• /
• pp.91-100
• /
• 2010

According to the recent increase in air traffic a more efficient air traffic flow control is required. This paper proposes the algorithm for efficient air traffic flow control. Aeronautical communication environment is different from the common communication environment since it needs a direct communication between stations (or airplanes) and requires a strict priority for safety message. Moreover, the wide area for basic service causes high propagation delay. In this paper, by using existing CSMA/CA Media Access Control (MAC) protocol, we set the message priorities according to air traffic condition (congestion airport area, approach control area, En route area, and ocean area). This prioritization scheme enables the data transmission with higher access probability. Simulation results confirm that our protocol shows better performance in terms of channel efficiency and success probability compared to exisiting CSMA/CA protocol.

• The KIPS Transactions:PartC
• /
• v.13C no.7 s.110
• /
• pp.873-880
• /
• 2006

Since various networks are deployed and the most of users request higher mobility, there are many researches about the interworking between widely deployed 3G network and rapidly boarded WLAN. On the other side, WiBro is focused on as a next generation network, because many people expect that WiBro gives satisfaction about the enough mobility and mass data transmission. So the study of the integration between WiBro and cdma2000 will show better effects than the present study of the integration between WLAN and cdma2000. The L2 handoff proposed in this paper takes advantages over the existing L3 handoff scheme because it does not require the L3 procedure for the mobility unlike the L3 handoff. Through extensive computer simulations, the efficiency of the proposed scheme has been validated.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.12
• /
• pp.409-414
• /
• 2015

The energy conservation is the most important subject for long run operation of the sensor nodes with limited power resources. Clustering is one of most energy efficient technique to grouped the sensor nodes into distinct cluster. But, in a cluster based WSN, CHs and gateways bear an extra work load to send the processed data to the sink. The inappropriate cluster formation may cause gateways overloaded and may increase latency in communication. In this paper, we propose a novel load balanced clustering model for improving energy efficiency and giving a guarantee of long network lifetime. We show the result of performance measurement experiments that designs using a branch and bound algorithm and a multi-start local search algorithm to compare with the existing load balanced clustering model.