• Journal of Internet Computing and Services
• /
• v.18 no.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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.8
• /
• pp.768-773
• /
• 2012

Packet loss compensation techniques are increasingly important to stable remote control over wireless communication in WNCS (Wireless Networked Control Systems). Its time varying channels, limited bandwidth, interference, and poor signal not only leads to packet loss or latency, but also can negatively affect performance and system stability. This paper presents a compensation technique exploiting an EWMA (Exponentially Weighed Moving Average)-based value estimator to clarify the influence of packet loss on the overall WNCS behavior. As an example of actuator to be remotely controlled, a rotary-type inverted pendulum has been considered, and modeled. Performance evaluation results through Matlab/Simulink and Truetime co-simulation confirm the superiority of the proposed value estimation method over previous approaches.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.234-236
• /
• 2004

Transmission control protocol(TCP) is protocol used in internet. TCP is seldom transmission error and is protocol based on wire environment. TCP uses 3 way handshake ways, data transmission control through windows size, data transmission control through reception confirmation, sliding window for packet delivery. In this study, designed TCP packet ion module for analyze the TCP segments & correct information about TCP. TCP capture in internet using designed TCP module and analysed TCP segments composition. Through this, could analyze the correct information of protocol in network.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.45-48
• /
• 2002

This paper presents a QoS-guaranteed traffic control system which supports QoS of realtime packet transmission for the multimedia communication. The traffic control system presented in this paper applies the integrated service model and provides QoS o(packet transmission by means of determining the packet transmission rate with the policy of network manager and the optimal resource allocation according to the end-to-end traffic load. It also provides QoS for the realtime packet transmission through the AWF2Q+ Scheduling algorithm and per-class queuing method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.40.1-40
• /
• 2001

In this paper, control theoretic approaches are proposed to guarantee QoS (Quality of Series) such as packet delay and packet loss of real-time traffic in high-speed communication network. Characteristics of variable rate real-time traÆc in communication networks are described. The mathematical model describing networks including source and destination nodes are suggested. By a traffic control mechanism, it is shown that worst-case end-to-end transfer delay of traffic can be controlled and packet loss can be prevented. The simulation shows results of delay control and buer level control to raise QoS in realtime traffic.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.235-244
• /
• 2004

There have been a lot of approaches to evaluate and predict transmission control protocol (TCP) performance in a numerical way. Especially, under the recent advance in wireless transmission technology, the issue of TCP performance over wireless links has come to surface. It is because TCP responds to all packet losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. By several previous works, although it has been already proved that overall TCP performance is largely dependent on its loss recovery performance, there have been few works to try to analyze TCP loss recovery performance with thoroughness. In this paper, therefore, we focus on analyzing TCP's loss recovery performance and have developed a simple model that facilitates to capture the TCP sender's behaviors during loss recovery period. Based on the developed model, we can derive the conditions that packet losses may be recovered without retransmission timeout (RTO). Especially, we have found that TCP Reno can retransmit three packet losses by fast retransmits in a specific situation. In addition, we have proved that successive three packet losses and more than four packet losses in a window always invoke RTO easily, which is not considered or approximated in the previous works. Through probabilistic works with the conditions derived, the loss recovery performance of TCP Reno can be quantified in terms of the number of packet losses in a window.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2180-2200
• /
• 2015

This paper considers mobility control to improve packet delivery in delay-tolerant networks (DTNs) under group mobility. Based on the group structure in group mobility, we propose two mobility control techniques; group formation enforcement and group purposeful movement. Both techniques can be used to increase the contact opportunities between groups by extending the group's reachability. In addition, they can be easily integrated into some existing DTN routing schemes under group mobility to effectively expedite the packet delivery. This paper is divided into 2 parts. First, we study how our proposed mobility control schemes reduce the packet delivery delay in DTNs by integrating them into one simple routing scheme called group-epidemic routing (G-ER). For each scheme, we analytically derive the cumulative density function of the packet delivery delay to show how it can effectively reduce the packet delivery delay. Then, based on our second proposed technique, the group purposeful movement, we design a new DTN routing scheme, called purposeful movement assisted routing (PMAR), to further reduce the packet delay. Extensive simulations in NS2 have been conducted to show the significant improvement of PMAR over G-ER under different practical network conditions.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.573-580
• /
• 2006

The conventional transport layer protocol TCP is designed to work under condition of packet loss is due to the network congestion, so that it's suitable in the traditional wired network with fixed hosts but it's inefficient on the wireless network where the environment of fading, noise, and transmission error comes from interference. This result from the needless transmission control of the bit error is due to treats the packet loss as a packet congestion control in the wireless network. In this paper, we propose the advanced SNOOP protocol with the consecutive packet loss and TCP window control to avoid the needless congestion management algorithm in wireless network for the wireless TCP packet transmission enhancement. We verify the performance of the advanced module from the simulation experiment result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.110-122
• /
• 1993

When voice is transmitted through packet switching network, there needs a overload control, that is, a control for the congestion which lasts short periods and occurrs in local extents. In this thesis, we analyzed the performance of the statistical packet voice multiplexer using the overload control strategy by bit dropping. We assume that the voice is coded accordng to (4,2) embedded ADPCM and that the voice packet is generated and transmitted according to the procedures in the CCITT recomendation G. 764. For the performance analysis, we must model the superposed packet arrival process to the multiplexer as exactly as possible. It is well known that interarrival times of the packets are highly correlated and for this reason MMPP is more suited for the modelling in the viewpoint of accuracy. Hence the packet arrival process in modeled as MMPP and the matrix geometric method is used for the performance analysis. Performance analysis is similar to the MMPP IG II queueing system. But the overload control makes the service time distribution G dependent on system status or queue length in the multiplexer. Through the performance analysis we derived the probability generating function for the queue length and using this we derived the mean and standard deviation of the queue length and waiting time. The numerical results are verified through the simulation and the results show that the values embedded in the departure times and that in the arbitrary times are almost the same. Results also show bit dropping reduces the mean and the variation of the queue length and those of the waiting time.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.408-416
• /
• 2005

Quality of service (QoS) provision is an important and indispensable function for multi-service wireless networks. In this paper, we present a new scheduling/admission control frame­work, including an efficient rate-guaranteed opportunistic scheduling (ROS) scheme and a coordinated admission control (ROS­CAC) policy to support statistic QoS guarantee in multi-service wireless networks. Based on our proposed mathematical model, we derive the probability distribution function (PDF) of queue length under ROS and deduce the packet loss rate (PLR) for individual flows. The new admission control policy makes admission decision for a new incoming flow to ensure that the PLR requirements of all flows (including the new flow) are satisfied. The numerical results based on ns-2 simulations demonstrate the effectiveness of the new joint packet scheduling/admission control framework.