• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.441-444
• /
• 2010

In our previous research, we proposed a MOST GATEWAY system for organically connected to the network MOST150 and MOST 25 and a simulation design method for performance analysis of Scheduling Algorithm in MOST GATEWAY system. Therefore in this paper, we use CANoe.MOST simulator in order to analyze the performance and propose a algorithm design method for Performance analysis according to number of queues by applying existing scheduling algorithms. Finally, we present an improvement scheme of the efficiency and scalability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.8
• /
• pp.1391-1400
• /
• 2008

In recent yeats, SCTP is known as the next transport layer protocol for connection-oriented and reliable data transfer after TCP/UDP. The SCTP was developed on the basis of the existing TCP and was designed to eliminate defects of TCP. SCTP has the different characteristic of multi-streaming and multi-homing from TCP. In this paper, we studied the defects of the performance of communication using the traits of multi-homing. And we evaluated the efficiency for each application services on the basis of SCTP of IPv6. Also, we analysed the delay time of a packet using SCTP and TCP. We noticed that the efficiency of SCTP is better than that of TCP.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.4
• /
• pp.100-106
• /
• 2006

We analyze a voice/data integrated traffic model of the cellular mobile communication system with hybrid guard channels for voice and handoff calls. In a multi-service integrated wireless environment, quality of service guarantee is crucial for smooth transportation of real time information. Real time voice traffic requires a guaranteed upper bounded on both delay and packet error rate, whereas data traffic does not. Voice traffic has high transmission priority over data packets. Thus one of the important problems is the design of admission control schemes which can efficiently accommodate the differential quality of service requirements. In this paper, a hybrid guard channel scheme is considered in which arriving calls are assigned channels as long as the number of busy channels in the cell is below a predetermined first threshold. When the number of busy channels reaches the first threshold, new originating data calls are queued in the infinite data buffer. Then reaches second threshold, only handoff calls are assigned the remaining channels and new originating voice calls are blocked. We evaluate the system by a two-dimensional Markov chain approach and generating function method and obtain performance measures included blocking probability and forced termination probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3470-3493
• /
• 2019

IEEE 802.11s-based infrastructure Wireless Mesh Networks (iWMNs) are envisaged as a promising solution to provide ubiquitous wireless Internet access. The limited network capacity is a problem mainly caused by the medium contention between mesh users and the mesh access points (MAPs), which gets worst when the mesh clients employ the Transmission Control Protocol (TCP). To mitigate this problem, we use wireless network coding (WNC) in the MAPs. The aim of this proposal is to take advantage of the network topology around the MAPs, to alleviate the contention and maximize the use of the network capacity. We evaluate WNC when is used in MAPs. We model the formation of coding opportunities and, using computer simulations, we evaluate the formation of such coding opportunities. The results show that as the users density grows, the coding opportunities increase up to 70%; however, at the same time, the coding delay increments significantly. In order to reduce such delay, we propose to adaptively adjust the time that a packet can wait to catch a coding opportunity in an MAP. We assess the performance of moving-average estimation methods to forecast this adaptive sojourn time. We show that using moving-average estimation methods can significantly decrease the coding delay since they consider the traffic density conditions.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.1147-1151
• /
• 2018

As personal users create and share lots of contents at any time and any places, new networking architecture such as content centric networking (CCN) has emerged. CCN utilizes content name as a packet identifier, not address. However, current CCN has a limitation for content source mobility management. The movement of content sources cause long delivery latency and long service disruption. To solve that, a hierarchical mobility management was was proposed. However, the hierarchical mobility management scheme has still the loss of interest packets and long handoff latency. So, this paper presents the hybrid hierarchical mobility management in mobile CCN environements to reduce both the loss rate of interest packets and the handoff latency. It is shown from the performance evaluations shows that the proposed scheme provides low loss rate of control message.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4572-4586
• /
• 2019

Mobile Edge Computing (MEC) and Information-Centric Networking (ICN) are essential network architectures for the future Internet. The advantages of MEC and ICN such as computation and storage capabilities at the edge of the network, in-network caching and named-data communication paradigm can greatly improve the quality of video streaming applications. However, the packet loss in wireless network environments still affects the video streaming performance and the existing loss recovery approaches in ICN does not exploit the capabilities of MEC. This paper proposes a Deep Learning based Loss Recovery Mechanism (DL-LRM) for video streaming over MEC based ICN. Different with existing approaches, the Forward Error Correction (FEC) packets are generated at the edge of the network, which dramatically reduces the workload of core network and backhaul. By monitoring network states, our proposed DL-LRM controls the FEC request rate by deep reinforcement learning algorithm. Considering the characteristics of video streaming and MEC, in this paper we develop content caching detection and fast retransmission algorithm to effectively utilize resources of MEC. Experimental results demonstrate that the DL-LRM is able to adaptively adjust and control the FEC request rate and achieve better video quality than the existing approaches.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.3008-3028
• /
• 2022

In this paper, we investigate traffic scheduling for a delay-sensitive multi-hop relay network, and aim to minimize the priority-based end-to-end delay of different data packet via joint relay selection, subcarrier assignment, and power allocation. We first derive the priority-based end-to-end delay based on queueing theory, and then propose a two-step method to decompose the original optimization problem into two sub-problems. For the joint subcarrier assignment and power control problem, we utilize an efficient particle swarm optimization method to solve it. For the relay selection problem, we prove its convexity and use the standard Lagrange method to deal with it. The joint relay selection, subcarriers assignment and transmission power allocation problem for each hop can also be solved by an exhaustive search over a finite set defined by the relay sensor set and available subcarrier set. Simulation results show that both the proposed routing scheme and the resource allocation scheme can reduce the average end-to-end delay.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.73-81
• /
• 2009

TCP assumes that packet loss is always happened by congestionlike wired networks because is can not distinguish between congestion loss and transmission error loss,. This assumption results in unnecessary TCP performance degradation in wireless networks by reducing sender's congestion window size and retransmitting the lost packets. Also, repeated retransmissions loed to waste the limited battery power of mobile devices. In this paper, we propose the new congestion control scheme that add the algorithms monitoring networks states and the algorithms preventing congestion to improve TCP throughput performance and energy efficiency in wireless ad-hoc networks. Using NS2, we showd our scheme improved throughput performance and energy efficiency.

• Annual Conference of KIPS
• /
• 2007.11a
• /
• pp.995-998
• /
• 2007

무선 네트워크에서 사용되는 단말기는 이동성이라는 특징상 한정된 에너지를 사용하여 동작하게 된다. 따라서 무선 호스트에 의해 소모되는 에너지의 양을 감소시키기 위한 기술은 대단히 중요하다. 이러한 기술적 지원을 위해 IEEE 802.11 에서는 DCF (Distributed Coordination Function) 전력 절감 메카니즘을 제안하고 있다. 그런데, DCF 를 위한 IEEE 802.11 전력 절감 메카니즘에서는 ATIM 창 동안 노드들은 비콘 기간 동안 깨어 있는 상태로 있을 것인지를 결정하기 위해서 control packet 을 교환 하는데, 이러한 ATIM 창 크기는 각각의 노드들의 전력 절감에 상당한 영향을 미친다. 그래서 ATIM 창 크기를 효율적으로 할당하기 위해 DPSM 과 같은 기법들이 개발되었다. 본 논문은 ATIM 창 크기를 동적으로 증감시켜서 ATIM 창 시간동안 소모되는 에너지를 줄이도록 하였다. ATIM 창 크기를 동적으로 할당하기 위하여 통계적 예측 기법인 칼만 필터를 도입하여 예측시스템을 구축하였으며, 이 예측 시스템을 통해 다음 상태에서 적용할 ATIM 창 크기를 예측하여 동적으로 할당하도록 하였다. 실험 결과 네트워크 생존 시간을 28.6% 증가시켰고, ATIM 창 크기 예측값의 오차는 4.42%로 나타났다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.451-463
• /
• 2000

In this paper, we design the radio data link protocols with QoS provisioning for mobile multimedia such as voice, data, and video in CDMA-based ATM networks, and analyze the performance of the data link protocols. To support mobile multimedia traffic, the required QoS parameters and the characteristics are analyzed, and wireless protocol stacks are proposed for integrating the wireless access network and ATM transport networks, and radio data link protocols are designed for provisioning QoS Control. The data link protocols are analyzed assuming that the system is supporting voice and data traffic simultaneously. In case of data traffic, the delay and throughput of SREJ ARQ and Type-1 Hybrid ARQ scheme are compared, and in case of voice traffic, the packet loss rate of BCH coding is analyzed according to the varying data traffic loads. The results indicate that the adaptive radio link protocols are efficient to support QoS requirements while the complexities are increased.