• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.35-38
• /
• 1999

In this paper, we propose bandwidth management scheme to efficiently guarantee the QoS of various services on ATM based IMT-2000 networks. The proposed bandwidth management scheme consists of the call admission control to reduce a handoff failure probability and the scheduling scheme to efficiently allocate a time slot based on the QoS requirements in wireless links. The simulation results show that the proposed bandwidth scheme has better performance than the previous works in terms of the handoff failure probability and packet delay time.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.1
• /
• pp.25-32
• /
• 2017

Most of weapon systems use aided navigation system which integrates inertial navigation and aiding sensors to compensate the INS errors increasing with the passage of time. Various aid sensors can be applied such as Global Navigation Satellite System (GNSS), radar, barometer, etc., but there might exist time delay caused by signal processing or transferring aid information. This time delay leads out-of-sequence measurements (OOSM) systems. Previously, optimal and suboptimal measurment update method for OOSM systems, where the time delay length are known, are proposed. However, previous algorithm does not guarantee the positive definite property of covariance matrix. In order to improve numerical stability for aided navigation using delayed-measurement, this paper proposes a new measurement covariance update algorithm be similar to Joseph-form in Kalman filter. Futhermore, we propose how to implement it in indirect feedback Kalman filter structure, which is commonly used in aided navigation systems, for time-delayed measurement systems. Simulation and vehicle test results show effectiveness of a proposed algorithm.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.69-75
• /
• 2012

In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.05a
• /
• pp.383-389
• /
• 2003

In this paper, we propose a solution, called M_DQDMR, for generating delay-constrained boundwidth-appropriated multicast routing trees to reduce the delay and conserved boundwidth resources of nodes in mobile computing environment. At the current router installation, we according the routing table and the information of link which neighboring rude to guarantee QoS(Quality of Service). When we construct multicast tree, M_DQDMR algorithm dynamically adjusts its appropriate tree construction policy based on how far the destination node from the delay bound and boundwidth our QoS requirement. Through simulations and comparing to another multicast algorithm, we reach a conclusion is that M_DQDMR can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve boundwidth resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3446-3464
• /
• 2017

Backoff mechanism serves as one of the key technologies in the MAC-layer of wireless mobile networks. The traditional Binary Exponential Backoff (BEB) mechanism in IEEE 802.11 Distributed Coordination Function (DCF) and other existing backoff mechanisms poses several performance issues. For instance, the Contention Window (CW) oscillations occur frequently; a low delay QoS guarantee cannot be provided for real-time transmission, and services with different priorities are not differentiated. For these problems, we present a novel Multi-Priority service differentiated and Adaptive Backoff (MPAB) algorithm over IEEE 802.11 DCF for wireless mobile networks in this paper. In this algorithm, the backoff stage is chosen adaptively according to the channel status and traffic priority, and the forwarding and receding transition probability between the adjacent backoff stages for different priority traffic can be controlled and adjusted for demands at any time. We further employ the 2-dimensional Markov chain model to analyze the algorithm, and derive the analytical expressions of the saturation throughput and average medium access delay. Both the accuracy of the expressions and the algorithm performance are verified through simulations. The results show that the performance of the MPAB algorithm can offer a higher throughput and lower delay than the BEB algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.2
• /
• pp.449-454
• /
• 2008

As demand for the application in multimedia networks is increasing rapidly, it is important to provide these services in Mobile Environments (ME). Obtaining to multimedia services which satisfy synchronization constraints in ME and improving the delay time and Quality of Service(QoS) between media streams to be presented, new specification model has to be proposed. In this paper we propose Mobile Synchronization Model(MSM) as a new specification model for describing efficiently the QoS and the delay time. Also, we propose the multimedia synchronization algorithm where is a dynamic synchronization method that minimizes the effects of adaptive transmission delay time. The proposed model has higher the guarantee of QoS such as the loss rate and the playout rate than it of the previous work.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1100-1105
• /
• 2003

In this paper, we propose a solution, called DQDMR, for generating delay-constrained bandwidth- appropriated multicast routing trees to reduce end-to-end delay and conserved bandwidth resources. At the current router system the router keep the information of link which neighboring node in the routing table to guarantee QoS(Quality of Service). When we construct multicast tree, DQDMR algorithm dynamically adjusts the path in the least delay and appropriate bandwidth. Through simulations comparing to another multicast algorithms, we reach a conclusion that DQDMR algorithm can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve bandwidth resources.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.494-498
• /
• 2011

Satellite digital multimedia broadcasting (S-DMB) systems use gap fillers (GFs) to provide wireless multimedia services to non-line-of-sight locations. GFs act as repeaters, and S-DMB systems require GF networks in order to guarantee mobile reception. Each GF covers a cell or sector. In order to provide contiguous coverage of an area comprising two or more cells or sectors, multiple GFs are needed. However, when multiple GFs are situated close to each other, interference is likely to occur. As a result, in this study, we have investigated system-level environments for planning the design of interference-free GF networks in S-DMB systems. Our investigations revealed that S-DMB services are unavailable because of quality deterioration caused by interference when the delay attributable to a GF and the satellite signals exceeds ${\pm}$256 chips and the distance between the GF and its reception terminal is greater than 4.6 km. On the basis of this analysis, we conducted a field test that confirmed that the above-mentioned time delay can be controlled in such a way as to ensure high quality S-DMB services.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.186-193
• /
• 2008

The Internet's low cost and ubiquity present an attractive option for real-time distributed control of processes on the factory floor. When integrated with the Internet, the LonWorks open control network can give ubiquitous accessibility with the distributed control nature of information on the factory floor. One of the most important points in real-time distributed control of processes is timely response. There are many processes on the factory floor that require timely response. However, the uncertain time delay inherent in the network makes it difficult to guarantee timely response in many cases. Especially, the transmission characteristics of the LonWorks/IP network show a highly stochastic nature. Therefore, the time delay problem has to be resolved to achieve high performance and quality of the real-time distributed control of the process in the LonWorks/IP Virtual Device Network (VDN). It should be properly predicted and compensated. In this paper, a new distributed control scheme that can compensate for the effects of the time delay in the network is proposed. It is based on the PID controller augmented with the Smith predictor and disturbance observer. Designing methods for output feedback filter and disturbance observer are also proposed. Tracking position control experiment of a geared DC Servo motor is performed using the proposed control method. The performance of the proposed controller is compared with that of the Internal Model Controller (IMC) with the Smith predictor. The result shows that the performance is improved and guaranteed by augmenting a PID controller with both the Smith predictor and disturbance observer under the stochastic time delay in the LonWorks/IP VDN.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.31-41
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.