• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.12
• /
• pp.3219-3236
• /
• 2012

A tree routing structure is often adopted for many-to-one data gathering and aggregation in sensor networks. For real-time scenarios, considering lossy wireless links, it is an important issue how to construct a maximum-lifetime data gathering tree with delay constraint. In this work, we study the problem of lifetime-preserving and delay-constrained tree construction in unreliable sensor networks. We prove that the problem is NP-complete. A greedy approximation algorithm is proposed. We use expected transmissions count (ETX) as the link quality indicator, as well as a measure of delay. Our algorithm starts from an arbitrary least ETX tree, and iteratively adjusts the hierarchy of the tree to reduce the load on bottleneck nodes by pruning and grafting its sub-tree. The complexity of the proposed algorithm is $O(N^4)$. Finally, extensive simulations are carried out to verify our approach. Simulation results show that our algorithm provides longer lifetime in various situations compared to existing data gathering schemes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.59.5-59
• /
• 2002

In this paper, we present a robust controller design method that can not only deal with the constant time delay plant but also an uncertain time delay one. For a constant time delay plant. The proposed DTC can independently adjust the set response and the disturbance response without any stability constraint. And in the uncertain time delay case, one can process the control design step with uncertainty norm bound. To verify real effectiveness, theoretical analysis and simulation results are given.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.10a
• /
• pp.53-53
• /
• 1994

• Journal of Biomedical Engineering Research
• /
• v.9 no.1
• /
• pp.87-92
• /
• 1988

In this paper, a new focusing method, to be called the pipelined sampled delay focusing (PSDF), is implemented. This method improves the lateral resolution in ultrasound imaging system. In PSDF, the analog belay lines are no longer necessary because sampling sum process can replace the conventional delay sum process. Also, the method offers continuous dynamic focusing on the resolution pixel basis, and eliminates the constraint that the maximum delay time is less than the sampling interval. Second order sampling is adopted in order to extend the sampling interval.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.91-102
• /
• 1996

The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4B
• /
• pp.270-281
• /
• 2003

E-PON supports efficiently the increased Internet data traffic and efficient bandwidth assignment function by which the shared upstream bandwidth in the broadband access networks. In this paper, when different types of incoming sources are mapped into QoS-aware source and Best-Effort(BE) source, we propose the Dual-GPS schedulaer in E-PON that has the characteristics to provide delay and delay-constraint application, and maximizes the bandwidth to best-effort service. When transmit upstream data in E-PON, The proposed scheme supports the control capabilities of delay and delay-variation for required QoS flow through the novel bandwidth assignment scheme. Simulation results show our scheme outperforms the conventional bandwidth allocation scheme in controlling the delay and delay-variation of E-PON system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.305-309
• /
• 2011

A sparse reconfigurable adaptive filter (SRAF) based on a photonic switch determines the appropriate time delays and weight values for an optical switch implementation of tapped-delay-line (TDL) systems. It is well known that the choice of switch delays is significantly important for efficiently implementing the SRAF. If the same values exist as calculating the sum of weight magnitudes for implementing the connection constraint required by the SRAF, conventional connection algorithm based on sequentially selection the maximum elements might not work perfectly. In an effort to increase the effectiveness of system identification, an upgraded connection algorithm used progressive calculation to obtain the better solution is considered in this paper. The performance of the proposed connection constraint algorithm is illustrated by computer simulation for a system identification application.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.218-222
• /
• 2007

This paper presents a new Perfect Tracking Control (PTC) scheme for linear systems with state constraint. The proposed controller increases the number of the steps on-line for perfect tracking to satisfy the given ellipsoid-type state constraint. The unavoidable step delay that we impose is minimized by solving LMI feasibility problems and the possible feedback information loss is avoided. The proposed schemes are easy to develop, theoretically simple and clear, and include the conventional PTC as its special case.