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

We design and implement a RTT (Round Trip Time) based TCP (Transmission Control Protocol) for USN (Ubiquitous Sensor Network). We adopt a basic update algorithm for window size from FAST TCP that uses the queuing delay at link as the congestion measure. The designed TCP estimates the queuing delay at link from the measured RTT in the network layer, and updates the window size based on the estimated queuing delay. The designed TCP allows to utilize the full capacity of USN links and avoids the waste of the given link capacity that is common without the flow control in the transport layer. The experiment results show that the window size of the sender converges within a small range of variations without any packet loss, and verify the stability and performance of the designed TCP.

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

In this paper, when we design and implement an internet-based teleoperation control, some important points that should be considered (e.g., transmission characteristics, time delay prediction and transmission protocol are inspected and simulated. First, we will investigate data transmission characteristics at the Internet, and build a model for the transmission delay and packet loss through the characteristics of that effect. And then, we inspect how to predict transmission delay, and examine transmission protocols which are proper for the control-oriented Internet protocol. Finally, we apply it to a force-reflective teleoperation control system that consists of a six d.o.f haptic interface and a five d.o.f manipulator via the Internet.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.733-750
• /
• 2019

Software Defined Networking (SDN) is a new network paradigm, allowing administrators to manage networks through central controllers by separating control plane from data plane. So, one or more controllers must locate outside switches. However, this separation may cause delay problems between controllers and switches. In this paper, we therefore propose a Priority-based Scheduling policy for OpenFlow (PSO) to reduce the delay of some significant traffic. Our PSO is based on packet prioritization mechanisms in both OpenFlow switches and controllers. In addition, we have prototyped and experimented on PSO using a network simulator (ns-3). From the experimental results, PSO has demonstrated low delay for targeted traffic in the out-of-brand control network. The targeted traffic can acquire forwarding rules with lower delay under network congestion in control links (with normalized load > 0.8), comparing to traditional OpenFlow. Furthermore, PSO is helpful in the in-band control network to prioritize OpenFlow messages over data packets.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.2
• /
• pp.114-124
• /
• 2009

In this paper, we propose a practical TCP friendly rate control scheme that considers the minimum channel bandwidth of the network when transporting SVC (scalable video coding) video over IP netowrks such as Internet. RTP and RTCP is mainly designed for use with UDP (User Datagram Protocol) for real-time video transport over the Internet. TCP-friendly rate control was proposed to satisfy the demands of multimedia applications while being reasonably fair when competing for bandwidth with conventional TCP applications. However the rate control model of the conventional TCP-friendly rate control scheme does not consider the minimum channel bandwidth of the network. Thus the estimated channel bandwidth by the conventional rate control model might be quite different from the real channel bandwidth when the packet loss ratio of the network is very large. In this paper, we propose a modified TCP-friendly rate control scheme that considers the minimum channel bandwidth of the network. Based on the modified TCP-friendly rate control, we assign the minimum channel bandwidth to the base layer bitstream of SVC video, and remaining available bandwidth is allocated to the enhancement layer of SVC video for the TCP friendly scalable video transmission. It is shown by simulations that the modified TCP-friendly rate control scheme can be effectively used for a wider range of controlled bit rates depending on the packet loss ratio than the conventional TCP-friendly control scheme. Furthermore, the effectiveness of the proposed scheme in terms of objective video quality is proved by comparing PSNR performance with the conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.1
• /
• pp.68-78
• /
• 2013

In this paper, we propose an early spectrum sensing(ESS) as an advance preparation for radio-access trial, which enables multi-mode terminals to access the most appropriate radio-access system in a cloud-conceptual base station system where multiple radio access technologies(RATs) coexist. Prior to a random access to one of RATs, a multi-mode terminal conducts a spectrum sensing over entire frequency bands of whole RATs, then select the RAT with the lowest sensing power, that is likely to have the most available spectrum. Thus, an access failure caused by that the selected RAT has no available radio spectrum could be avoidable in advance. In computer simulation, we consider as various RATs as possible. First, circuit and packet systems are taken into consideration. In addition, the packet systems are classified according to the feasibility of carrier aggregation(CA). In case of terminal, three modes are considered with circuit-only, packet-only, and multi-mode. Subsequently, packet traffic is classified into real-time and non-real-time traffic with three different tolerable delay levels. The simulation includes a call process starting with a call generation and ending up with a resource allocation reflecting individual user's QoS requirements and evaluates the proposed scheme in terms of the successful access probability, system access time, system balancing factor and packet loss probability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.29-40
• /
• 2004

In this paper, we propose a new early congestion detection and notification technique called QR-AQM. Unlike RED and it's variation, QR-AQM measures the total traffic rate from TCP sessions, predicts future network congestion, and determine the packet marking probability based on the measured traffic rate. By incorporating the traffic rate in the decision process of the packet marking probability, QR-AQM is capable of foreseeing future network congestion as well as terminating congestion resolution procedure in much more timely fashion than RED. As a result, simulation results show that QR-AQM maintains the buffer level within a fairly narrow range around a target buffer level that may be selected arbitrarily as a control parameter. Consequently, compared to RED and its variations, QR-AQM is expected to significantly reduce the jitter and delay variance of packets traveling through the buffer while achieving nearly identical link utilization.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1333-1340
• /
• 2015

IEEE 802.11 MAC(Media Access Control) defines DCF(Distributed Coordination Function) for data transmission control. BEB(Binary Exponential Backoff) algorithm of DCF has a problem that if the number of stations connected are over a certain threshold, it degrades network performance because of packet collisions caused from the minimum contention window size. To cope with this problem, we proposed a novel algorithm, named as VBS(Variable Backoff Stage) algorithm, which adjusts the rate of backoff stage increment depending on the number of stations associated with an AP(Access Point). Analytic model of proposed algorithm was derived and simulations on the BEB and the VBS algorithms have been conducted on the OFDM (Orthogonal Frequency Division Multiplexing) method. Simulation results showed that when the rate of backoff state increment was 5 and 10, the number of retransmission were reduced to 1/5 and 1/10 comparing to that of BEB, respectively. Our algorithm showed improvement of 19% and 18% in network utilization, respectively. Packet delay was reduced into 1/12.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.245-252
• /
• 2004

Stream Control Transmission Protocol(SCTP) is a new connection-oriented, reliable delivery transport protocol operating on top of an unreliable connectionless packet service such as IP. It inherits many of the functions developed for TCP, including flow control and packet loss recovery functions. In addition, it also supports transport layer multihoming and multistreaming In this paper, we study the impact of multi-homing on the performance of SCTP. We first compare performance of single-homed SCTP. multi-homed SCTP, TCP Reno and TCP SACK. We, then describe potential flaw in the current SCTP retransmission policy, when SCTP host is multihomed. Our Results show that SCTP performs better than TCP Reno and TCP SACK due to several changes from TCP in its congestion control mechanism. In particular. multi-homed SCTP shows the best result among the compared schemes. Through experimentation for multi-homed SCTP, we found that the current SCTP retransmission policy nay deteriorate the perfomance when the retransmission path it worse than the original path. Therefore, the condition of retransmission path is a very important factor In SCTP performance and a proper mechanism would be required to measure the condition of the retransmission path.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12B
• /
• pp.1665-1676
• /
• 2001

The effect of spreading gain control on the throughput of a CDMA slotted ALOHA system is considered. Mobile users transmit packets over a shared channel, and the packets transmitted in the same time slot over the shared channel act as simultaneous access interference (SAI). When using spread-spectrum signal, a CDMA slotted ALOHA channel achieves high probability of capture due to the property of high title resolution, and the bit rate of user information is determined by spreading gain. When the SAI level gets larger, the high value of spreading gain enhances the packet throughput by increasing the probability of a successful packet transmission, while it degrades the of the effective throughput by reducing the user information bits carried within a packer. To solve the problem, we investigated the effect of the capture probability and the SAI level on these system throughputs, and evaluated the throughput performance of the system for each spreading gain control scheme. The results showed that the maximum effective throughput could be achieved with an unified method despite the variation of the SAI level by deriving an optimal value of the spreading gain according to 171e system states.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.755-761
• /
• 2013

Medium access control (MAC) protocols for wireless sensor networks make sensor nodes on state for energy-efficiency only when necessary. In this paper we present an energy efficient priority-based MAC protocol for energy-harvesting Wireless Sensor Networks (WSNs). For support priority-based packet transmission the proposed EEPB-MAC protocol uses the modified IEEE 802.15.4 beacon frames including priority bit, sender node address, and NAV value fields. A receiver node periodically wakes up, receives sender beacon frames, selects data sending sender, and broadcasts a beacon frame containing the selected sender's address. A receiver node selects sender node according to sender's data priority. A receiver nodes also adjust wake up period based on their energy states. Hence, the energy consumption of receiver node can be minimized. Through simulations and analytical analysis, we evaluate the performance of our proposed the EEPB-MAC protocol and compare it against the previous MACs. Results have shown that our protocol outperforms other MAC in terms of energy consumption, higher priority packet delivery delay.