• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.12
• /
• pp.1690-1696
• /
• 2014

Network RTK generates spatial corrections by using differenced measurements from reference stations in the network, and the corrections are then provided to a rover. The rover, generally, uses linear interpolation, which assumes that the corrections at each reference station are spatially correlated, to obtain a precise correction of its location. However, an irregularity of the tropospheric delay is a real-world factor that violates this assumption. Tropospheric delay is a result of weather conditions, such as humidity, temperature and pressure, and it can cause spatial decorrelation when there are changes in the local climate. In this paper, we have defined the non-linear characteristics of the tropospheric delay between reference stations or user within a region as the "irregularity of tropospheric delay". Such an irregularity can negatively impact the network RTK performance. Therefore, we analyze the influence of the irregularity of tropospheric delay in network RTK based on meteorological data.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2456-2467
• /
• 2018

Wireless multimedia sensor networks (WMSNs) require real-time quality-of-service (QoS) guarantees to be provided by the network. The end-to-end delay is very critical metric for QoS guarantees in WMSNs. In WMSNs, due to the transmission errors incurred over wireless channels, it is difficult to obtain reliable delivery of data in conjunction with low end-to-end delay. In order to improve the end-to-end delay performance, the system has to drop few packets during network congestion. In this article, our proposal is based on optimization of end-to end delay for WMSNs. We optimize end-to-end delay constraint by assuming that each packet is allowed fixed number of retransmissions. To optimize the end-to-end delay, first, we compute the performance measures of the system, such as end-to-end delay and reliability for different network topologies (e.g., linear topology, tree topology) and against different choices of system parameters (e.g., data rate, number of nodes, number of retransmissions). Second, we study the impact of the end-to-end delay and packet delivery ratio on indoor and outdoor environments in WMSNs. All scenarios are simulated with multiple run-times by using network simulator-2 (NS-2) and results are evaluated and discussed.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1674-1675
• /
• 2007

This paper presents a stability analysis of network systems with time delay. Time delay problem frequently occurs in network systems. Since it makes network systems unstable and unpredictable, an optimal controller is necessary to network systems. We prove the asymptotical stability of time delayed network systems using LMI optimization method and appropriate Lyapunov-Krasovskii functionals. Simulations show the effectiveness of the method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2626-2634
• /
• 1997

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.139-144
• /
• 2003

Mobile Node has to maintain communication as they move form place to place, so it doesn't guarantee Quality of Service(QoS). Fast Handoff is important to provide multimedia and real-time applications services in mobile, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to quarantee QoS as a main issue in mobile IP research area. Next generation Mobile IPv6 resolve this problem somewhat, triangle problem for first packet and handoff delay still remain. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-Based routing. After modeling of suggested method and existing handoff method, simulations are carried out with NS-2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

• 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 Korean Institute of Industrial Engineers
• /
• v.12 no.1
• /
• pp.133-138
• /
• 1986

In this paper, we are modeling the problem of the reliability evaluation in the network with delay. The triconnected decomposition and factoring algorithm for the network reliability, known as the most efficient algorithm, does not work in this constrained problem. So, we propose some ideas that reduce the above constrained problem to the general network reliability problem. We also present an algorithm for the reliability evaluation in the network with delay based on these ideas.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.831-833
• /
• 2004

In this paper, an obstacle avoidance algorithm is proposed for a network-based robot considering network delay by distribution. The proposed algorithm is based on the VFH(Vector Field Histogram) algorithm, and for the network-based robot system, in which it is assumed robot localization information is transmitted through network communication. In this paper, target vector for the VFH algorithm is estimated through the robot localization information and the measurement of its delay by distribution. The delay measurement is performed by time-stamp method. To synchronize all local clocks of the nodes distributed on the network, a global clock synchronization method is adopted. With the delay measurement, the robot localization estimation is performed by calculating the kinematics of the robot. The validation of the proposed algorithm is performed through the performance comparison of the obstacle avoidance between the proposed algorithm and the existing VFH algorithm on the network-based autonomous mobile robot.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.677-680
• /
• 2003

In this paper, the analysis of practical end-to-end delay in worst case is performed for distributed control system considering the implementation of the system. The control system delay is composed of the delay caused by multi-task scheduling of operating system, the delay caused by network communication, and the delay caused by the asynchronous between them. Through simulation tests based on CAN(Controller Area Network), the proposed end-to-end delay in worst case is validated. Additionally, online clock synchronization algorithm is proposed here for the control system. Through another simulation test, the online algorithm is proved to have better performance than offline one in the view of network bandwidth utilization.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1433-1436
• /
• 2004

The ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure of centralized administration. Load-Balanced Ad hoc Routing(LBAR) protocol is an on-demand routing protocol intended for delay-sensitive applications where users are most concern with packet transmission delay. Although LBAR mechanism is a novel load balancing routing protocol for ad hoc network, it has own limitation in route path maintenance phase. Therefore, in this paper, we propose Advanced Load-Balanced Ad hoc Routing(A-LBAR) that is delay-sensitive and has an efficient path maintenance scheme. The robust path maintenance scheme is maintained by considering about nodal loads all over network and misbehavior of overloaded or selfish nodes. The proposed scheme provides good performance over DSR and AODV in terms of packet delay and packet loss rate when some misbehaving nodes exist in the network.