• Journal of Korea Multimedia Society
• /
• v.14 no.9
• /
• pp.1165-1174
• /
• 2011

In data broadcasting systems, servers continuously disseminate data items through broadcast channels, and mobile client only needs to wait for the data of interest to present on a broadcast channel. However, because broadcast channels are shared by a large set of data items, the expected delay of receiving a desired data item may increase. This paper explores the issue of designing proper data allocation on multiple broadcast channels to minimize the average expected delay time of all data items, and proposes a new data allocation scheme named two level bin-packing(TLBP). This paper first introduces the theoretical lower-bound of the average expected delay, and determines the bin capacity based on this value. TLBP partitions all data items into a number of groups using bin-packing algorithm and allocates each group of data items on an individual channel. By employing bin-packing algorithm in two step, TLBP can reflect a variation of access probabilities among data items allocated on the same channel to the broadcast schedule, and thus enhance the performance. Simulation is performed to compare the performance of TLBP with three existing approaches. The simulation results show that TLBP outperforms others in terms of the average expected delay time at a reasonable execution overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.1
• /
• pp.23-34
• /
• 2004

This paper presents architecture and control method of packet scheduler to guarantee QoS of high quality streaming services in high-speed packet-switched networks. Since streaming services need far more stringent QoS requirements than the typical sort of burst data applications, they should be guaranteed minimum bandwidth and end-to-end delay bound to each flow, regardless of the behavior of other flows. To meet these requirements, a packet scheduler isolate a flow from the undesirable effects of other flows and provides end-to-end delay guarantees for individual flow and divides stringently the available link bandwidth among flows sharing the link. Until now, many vendors are developing traffic management chips running at 10Gbps, but most of chips have drawbacks to support high quality streaming services. In this paper, we investigate the drawbacks of commercial TM chips and traffic characteristic of streaming services and present implementation frameworks of the proposed packet scheduler. Finally, we analyze the simulation results of the proposed scheduler.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.19 no.4
• /
• pp.355-362
• /
• 2009

Sound source localization method based on the time delay of arrival(TDOA) is applied to many research fields such as a robot auditory system, teleconferencing and so on. When multi-microphones are utilized to localize the source in 3 dimensional space, the conventional localization methods based on TDOA decide the actual source position using the TDOAs from all microphone arrays and the detection measure, which represents the errors between the actual source position and the estimated ones. Performance of these methods usually depends on the number of microphones because it determines the resolution of an estimated position. In this paper, we proposed the localization method using spatially mapped GCC functions. The proposed method does not use just TDOA for localization such as previous ones but it uses spatially mapped GCC functions which is the cross correlation function mapped by an appropriate mapping function over the spatial coordinate. A number of the spatially mapped GCC functions are summed to a single function over the global coordinate and then the actual source position is determined based on the summed GCC function. Performance of the proposed method for the noise effect and estimation resolution is verified with the real environmental experiment. The mean value of estimation error of the proposed method is much smaller than the one based on the conventional ones and the percentage of correct estimation is improved by 30% when the error bound is ${\pm}20^{\circ}$.

• Journal of Microbiology and Biotechnology
• /
• v.26 no.1
• /
• pp.139-144
• /
• 2016

Synthetic oscillators are gene circuits in which the protein expression will change over time. The delay of transcription, translation, and protein folding is used to form this kind of behavior. Here, we tried to design a synthetic oscillator by a negative feedback combined with a positive feedback. With the mutant promoter P_LacC repressed by LacIq and P_Lux activated by AHL-bound LuxR, two gene circuits, Os-LAA and Os-ASV, were constructed and introduced into LacI-deleted E. coli DH5α cells. When glucose was used as the carbon source, a low level of fluorescence was detected in the culture, and the bacteria with Os-ASV showed no oscillation, whereas a small portion of those carrying Os-LAA demonstrated oscillation behavior with a period of about 68.3 ± 20 min. When glycerol was used as the carbon source, bacteria with Os-ASV demonstrated high fluorescence value and oscillation behavior with the period of about 121 ± 21 min.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.2
• /
• pp.95-103
• /
• 2002

This paper deals with the H$_{\infty}$ control problems for discrete-time linear systems with time-varying delays in states. The existence condition and the design method of the H$_{\infty}$ state feedback controller are given. In this paper, the H$_{\infty}$ control law is assumed to be a memoryless state feedback, and the upper-bound of time-varying delay and S-procedure are used. Through some changes of variables and Schur complement, the obtained sufficient condition can be rewritten as an LMI(linear matrix inequality) form in terms of all variables.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1273-1281
• /
• 2004

There have been a number of researches on real-time packet scheduling based on EDF algorithm to support end-to-end delay bound guarantees for real-time traffic transmission. However, EDF-based packet scheduler could not guarantee the real-time requirements of real-time traffic if there exist non-real-time traffic. In this paper, we propose a new admission control algorithm and packet scheduling scheme considering non-real-time traffic in the real -time packet scheduler based on EDF policy. Proposed admission control algorithm has pseudo-polynomial time complexity, but we show through simulation that it can be used with little run-time overhead.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.2
• /
• pp.878-884
• /
• 2013

This paper presents a transmission power control MAC protocol that allows terminals to vary transmit power level on data frame basis in ad hoc network. Unlike the IEEE 802.11 approach, we do not use the RTS/CTS packets to silence the neighboring nodes. Instead, channel gain and distance information between transmitter and receiver terminal are inserted in the RTS/CTS packets. These informations are used to dynamically bound the transmission power. Simulation results indicate that, compared to the GMAC, the proposed MAC protocol achieves a increase in the average frame delivery ratio and a decrease in the average frame delay.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.631-640
• /
• 2001

Round robin scheduling discipline, which is a sort of frame-based scheduling, is quite simple and straightforward for handling multiple queues, and by putting a different weight on each queue, a network can offer differentiated services such as different bandwidth, or delay bound. The most typical algorithm among this disciplines is the weighted round robin(WRR). Also, WRR algorithm can be implemented efficiently by dynamic binary scheduling wheel(DBSW) architecture. This paper performs the analysis of the DBSW architecture and compares the results with simulation results. The analysis data and simulation data show that the DBSW structure decreases average buffer length because it is capable of maintaining the allocated weight of each VC correctly.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4873-4888
• /
• 2018

A joint blind parameter estimation algorithm based on minimum channel stability function aimed at the non-cooperative high-order modulated paired carrier multiple access (PCMA) signals is proposed. The method, which uses hierarchical search to estimate time delay, amplitude and frequency offset and the estimation of phase offset, including finite ambiguity, is presented simultaneously based on the derivation of the channel stability function. In this work, the structure of hierarchical iterative processing is used to enhance the performance of the algorithm, and the improved algorithm is used to reduce complexity. Compared with existing data-aided algorithms, this algorithm does not require a priori information. Therefore, it has significant advantage in solving the problem of blind parameter estimation of non-cooperative high-order modulated PCMA signals. Simulation results show the performance of the proposed algorithm is similar to the modified Cramer-Rao bound (MCRB) when the signal-to-noise ratio is larger than 16 dB. The simulation results also verify the practicality of the proposed algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.1-9
• /
• 2004

In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IPv6-Based mobile networks. The proposed multicast routing protocol reduces the tree reconstruction overhead by limiting the tunneling length according to the mobility of mobile hosts. In this way, our protocol satisfies the bound of the end-to-end delay and supports the seamless handoff. Analytical and simulation results show that the proposed protocol has better performance in terms of the tree reconstruction, tunneling service and multicast packet loss than the previous protocols does.