• 인터넷정보학회논문지
• /
• 제18권6호
• /
• pp.65-73
• /
• 2017

Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권9호
• /
• pp.1492-1512
• /
• 2011

Due to multiple hops, mobility and time-varying channel, supporting delay sensitive real-time traffic in wireless local area network-based (WLAN) mesh networks is a challenging task. In particular for real-time traffic subject to medium access control (MAC) layer control overhead, such as preamble, carrier sense waiting time and the random backoff period, the performance of real-time flows will be degraded greatly. In order to support real-time traffic, an efficient adaptive packet scheduling (APS) scheme is proposed, which aims to improve the system performance by guaranteeing inter-class, intra-class service differentiation and adaptively adjusting the packet length. APS classifies incoming packets by the IEEE 802.11e access class and then queued into a suitable buffer queue. APS employs strict priority service discipline for resource allocation among different service classes to achieve inter-class fairness. By estimating the received signal to interference plus noise ratio (SINR) per bit and current link condition, APS is able to calculate the optimized packet length with bi-dimensional markov MAC model to improve system performance. To achieve the fairness of intra-class, APS also takes maximum tolerable packet delay, transmission requests, and average allocation transmission into consideration to allocate transmission opportunity to the corresponding traffic. Detailed simulation results and comparison with IEEE 802.11e enhanced distributed channel access (EDCA) scheme show that the proposed APS scheme is able to effectively provide inter-class and intra-class differentiate services and improve QoS for real-time traffic in terms of throughput, end-to-end delay, packet loss rate and fairness.

• ETRI Journal
• /
• 제32권6호
• /
• pp.854-862
• /
• 2010

One-way delay variation (OWDV) has become increasingly of interest to researchers as a way to evaluate network state and service quality, especially for real-time and streaming services such as voice-over-Internet-protocol (VoIP) and video. Many schemes for OWDV measurement require clock synchronization through the global-positioning system (GPS) or network time protocol. In clock-synchronized approaches, the accuracy of OWDV measurement depends on the accuracy of the clock synchronization. GPS provides highly accurate clock synchronization. However, the deployment of GPS on legacy network equipment might be slow and costly. This paper proposes a method for measuring OWDV that dispenses with clock synchronization. The clock synchronization problem is mainly caused by clock skew. The proposed approach is based on the measurement of inter-packet delay and accumulated OWDV. This paper shows the performance of the proposed scheme via simulations and through experiments in a VoIP network. The presented simulation and measurement results indicate that clock skew can be efficiently measured and removed and that OWDV can be measured without requiring clock synchronization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권6호
• /
• pp.1147-1165
• /
• 2011

We present a simple and cost effective rate control scheme for streaming video over a wireless channel by using the information of mobile devices' buffer level. To prevent buffer fullness and emptiness at receivers, the server should be able to adjust sending rate according to receivers' buffer status. We propose methods to adjust sending rate based on the buffer level and discrete derivative of the buffer occupancy. To be compatible with existing network protocols, we provide methods to adjust sending rate by changing the inter-packet delay (IPD) at the server side. At every round-trip time, adjustments of sending rate are made in order to achieve responsiveness to sudden changes of buffer availabilities. A series of simulations and the prototype system showed that the proposed methods did not cause buffer overflows and it can maintain smoother rate control and react to bandwidth changes promptly.

• Journal of Information Processing Systems
• /
• 제20권1호
• /
• pp.131-147
• /
• 2024

A routing strategy based on traffic prediction and dynamic cache allocation for satellite nodes is proposed to address the issues of high propagation delay and overall delay of inter-satellite and satellite-to-ground links in low Earth orbit (LEO) satellite systems. The spatial and temporal correlations of satellite network traffic were analyzed, and the relevant traffic through the target satellite was extracted as raw input for traffic prediction. An improved gradient boosting regression tree algorithm was used for traffic prediction. Based on the traffic prediction results, a dynamic cache allocation routing strategy is proposed. The satellite nodes periodically monitor the traffic load on inter-satellite links (ISLs) and dynamically allocate cache resources for each ISL with neighboring nodes. Simulation results demonstrate that the proposed routing strategy effectively reduces packet loss rate and average end-to-end delay and improves the distribution of services across the entire network.

• Journal of Information Processing Systems
• /
• 제2권2호
• /
• pp.76-81
• /
• 2006

A PDA is used mainly for downloading data from a stationary server such as a desktop PC in an infrastructure network based on wireless LAN. Thus, the overall performance depends heavily on the performance of such downloading with PDA. Unfortunately, for a PDA the time taken to receive data from a PC is longer than the time taken to send it by 53%. Thus, we measured and analyzed all possible factors that could cause the receiving time of a PDA to be delayed with a test bed system. There are crucial factors: the TCP window size, file access time of a PDA, and the inter-packet delay that affects the receiving time of a PDA. The window size of a PDA during the downstream is reduced dramatically to 686 bytes from 32,581 bytes. In addition, because flash memory is embedded into a PDA, writing data into the flash memory takes twice as long as reading the data from it. To alleviate these, we propose three distinct remedies: First, in order to keep the window size at a sender constant, both the size of a socket send buffer for a desktop PC and the size of a socket receive buffer for a PDA should be increased. Second, to shorten its internal file access time, the size of an application buffer implemented in an application should be doubled. Finally, the inter-packet delay of a PDA and a desktop PC at the application layer should be adjusted asymmetrically to lower the traffic bottleneck between these heterogeneous terminals.

• 정보보호학회논문지
• /
• 제21권3호
• /
• pp.57-66
• /
• 2011

EAP-AKA를 표준인증 메커니즘으로 사용하는 3G-WLAN 상호연동 망에서는 핸드오버 수행 시 마다 인증백터 생성 및 조회 등의 많은 지연시간을 초래하게 된다. 따라서 핸드오버가 자주 발생하는 네트워크 환경에 적합하도록 상호 인증시간을 최소화하고 끊김없는 서비스를 제공하기 위한 효율적인 인증기법이 요구되고 있다. 제안하는 선인증 기법은 WLAN에서 단말기가 수평 핸드오버할 때 연결계층의 빠른 채널 스위칭을 이용하여 다음 액세스포인트와 직접 EAP 인증을 수행토록 함으로써 인증 지연시간을 최소화하는 기법이다. 핸드오버 이전에 인증을 완료하여 인증 지연시간을 최소화하였으며, 전원 절약모드를 사용하여 패킷 손실을 방지하였다. 또한 사용자 단말기의 디바이스 드라이버 수정만 필요함으로써 실제 적용이 용이하다. 제안하는 기법의 성능 분석 및 평가로써 표준 인증기법을 선정하여 패킷 손실 및 인증지연 시간 등을 비교하였으며, 기존 기법보다 약 10 배 정도의 패킷 손실 방지 효율을 보였고, 인증에 소요되는 평균 지연시간을 0.16 msec으로 최소화하는 효과를 기대할 수 있었다.

• 한국통신학회논문지
• /
• 제35권9A호
• /
• pp.882-888
• /
• 2010

Vehicular Ad-Hoc Networks (VANETs) using inter-vehicle communication can potentially enhance traffic safety and facilitate many vehicular applications. Therefore, this paper proposes an inter-vehicle routing protocol called Junction-Assisted Routing (JAR) that uses fixed junction nodes to create the routing paths for VANETs in city environments. JAR is a proactive routing protocol that uses the Expected Transmission Count (ETC) for the road segment between two neighbor junctions as the routing paths between junction nodes. Simulation results showed that the proposed JAR protocol could outperform existing routing protocols in terms of the packet delivery ratio and average packet delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권10호
• /
• pp.2620-2631
• /
• 2012

In this paper, a rerouting-controlled ISL (Inter-Satellite link) handover protocol for LEO satellite networks (RCIHP) is proposed. Through topological dynamics and periodic characterization of LEO satellite constellation, the protocol firstly derives the ISL related information such as the moments of ISL handovers and the intervals during which ISLs are closed and cannot be used to forward packet. The information, combined with satellite link load status, is then been utilized during packet forwarding process. The protocol makes a forwarding decision on a per packet basis and only routes packets to living and non-congested satellite links. Thus RCIHP avoids periodic rerouting that occurs in traditional routing protocols and makes it totally unnecessary. Simulation studies show that RCIHP has a good performance in terms of packet dropped possibility and end-to-end delay.

• 한국정보처리학회논문지
• /
• 제3권7호
• /
• pp.1868-1879
• /
• 1996

현재 이동통신시스템의 내부 프로세서간 통신망은 메쉬 토폴로지 형태의 단일 버 스를 이용하기 때문에 앞으로 B-ISDN과 연계될 대용량의 트래픽 처리에 한계가 있다. 또한, 이동통신시스템에서는 일반 ATM망에서의 고정 길이가 아니니 가변 길이 패킷을 사용하고 있으므로 ATM스위치를 그대로 이용할 수는 없다. 일부의 구현에서 가변길이 를 지원하는 스위치를 제시하고 있으나, 내부 동기화를 위한 전처리, 비트 지연 등의 문제가 있다. 본 논문에서는 추가적인 처리없이 가변길이의 패킷을 처리할 수 있는 경합집속기를 설계하였다. 또한 제안된 경합집속기는 입력 인터페이스에서 패킷 시작 신호를 위한 지연이 없다. 따라서, 효율적으로 패킷을 처리해 줄 수 있으며, 기존의 경합집속기에 N 비트 시간의 지연이 걸리던 것을 $\ulcornerlog2N\lrcorne＋1$ 비트 시간 정도로 감소 시켰다. 이에 따라 가변 길이 넉아웃 스위치를 적용한 부분 메쉬 토폴로지의 버스 구 조의 이동통신시스템은 B-INDN망과 연계된 대용량의 트래픽을 처리할 수 있을 것으로 기대된다.