• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2797-2808
• /
• 1998

Multimedia scenario database system is a read-only multimedia-on-demand system which transfers scenarios representing the display ordering of multimedia objects. A scenario is a graph of multimedia objects and it contains spatial, temporal and contextual information of multimedia data. By structuring multimedia objects as a scenario, it is possible to enforce their display order based on their context. Furthermore, it can provide multiple display paths as well as the sharing of objects between different scenarios. As a result, the multimedia scenario database system can perform the pre-scheduling of multimedia objects, which makes it possible to reorder the transmission order of objects in a scenario. Consequently, the overall system resource such as data buffer and network bandwidth can be highly utilized. In this paper, we discuss the requirements of structuring a scenario to design a scenario database that stores and manages multimedia scenario. Furthermore, we devise and analyze several scheduling policies based on the reordering mechanism for the objects in a scenario.

• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.814-826
• /
• 2012

In this paper, we propose scheduling algorithms for transporting variable-bit-rate video stream using playback buffer level of the clients over wireless communication networks. The proposed algorithms attempt to maximize the utilization of limited bandwidth between the central video server and the clients over a mobile network. Since a video server may serve several video request at the same time, it is important to allocate and utilize network bandwidth to serve them fairly and efficiently. In order to improve the quality of service and real-time performance of individual video playback, the video server attempts to allocate temporarily more network bandwidth to serve a video request with the lower buffer level preferentially. The simulation results prove the fair service and load balancing among the mobile concurrent clients with different buffer levels and hence maximizing the number of frames that are transported successfully to the client prior to their playback times.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.722-733
• /
• 2006

In scalable streaming application, there are two important knobs to tune to effectively exploit the underlying network resource and to maximize the user perceivable quality of service(QoS): layer selection and packet scheduling. In this work, we propose Semantics Aware Packet Scheduling (SAPS) algorithm to address these issues. Using packet dependency graph, SAPS algorithm selects a layer to maximize QoS. We aim at minimizing distortion in selecting layers. In inter-frame coded video streaming, minimizing packet loss does not imply maximizing QoS. In determining the packet transmission schedule, we exploit the fact that significance of each packet loss is different dependent upon its frame type and the position within group of picture(GOP). In SAPS algorithm, each packet is assigned a weight called QoS Impact Factor Transmission schedule is derived based upon weighted smoothing. In simulation experiment, we observed that QOS actually improves when packet loss becomes worse. The simulation results show that the SAPS not only maximizes user perceivable QoS but also minimizes resource requirements.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.99-109
• /
• 2007

IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.246-255
• /
• 2016

The orthogonal frequency-division multiple access (OFDMA) systems are well suited to multi-rate multicast transmission, as they allow flexible resource allocation across both frequency and time, and provide adaptive modulation and coding schemes. Unlike layered video coding, the multiple description coding (MDC) enables flexible decomposition of the raw video stream into two or more substreams. The quality of the video stream is expected to be roughly proportional to data rate sustained by the receiver. This paper describes a mathematical model of resource allocation and throughput in the multi-rate video multicast for the OFDMA wireless and mobile networks. The impact on mean opinion score (MOS), as a measurement of user-perceived quality (by employing a variety of scheduling disciplines) is discussed in terms of utility maximization and proportional fairness. We propose a pruning algorithm to ensure a minimum video quality even for a subset of users at the resource limitation, and show the optimal number of substreams and their rates can sustain.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.12
• /
• pp.61-68
• /
• 2010

In this paper, we investigate the performance of ARQ-aided Time Switched Transmit Diversity (ARQ-TSTD) applying the multi-level control signaling in the WCDMA LCR-TDD system. Proposed ARQ-TSTD system applies the multi-level control signaling scheme in which the receiver sends the response signal (ACK or NACK signal) to the transmitter and defines NACK2 signal for multi-level control. Transmitter utilize the NACK2 control signal to the postponement of transmission and multi-user scheduling scheme proposed by this paper. Simulation results demonstrate that the proposed postponement of transmission and multi-user scheduling scheme yield about 1.3dB, 1.4dB performance gain respectively, compared with the conventional ARQ-TSTD with antenna switching scheme in tenn of the frame error rate (FER) for mobile speed of 3km/h and FER value of 10%. In addition, 14% and 11.5% of throughput gain respectively is shown when Eb/N0=-3dB.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.16-27
• /
• 2017

IEEE 802.15.6 standard, a Wireless Body Area Network, aims to transfer not only medical data but also non-medical data, such as physical activity, streaming, multimedia game, living information, and entertainment. Services which transfer those data have very various data rates, intervals and frequencies of continuous access to a medium. Therefore, an efficient anti-collision operations and medium assigning operation have to be carried out when multiple nodes with different data rates are accessing shared medium. IEEE 802.15.6 standard for CSMA/CA medium access control method distributes access to the shared medium, transmits a control packet to avoid collision and checks status of the channel. This method is energy inefficient and causes overhead. These disadvantages conflict with the low power, low cost calculation requirement of wireless body area network, shall minimize such overhead for efficient wireless body area network operations. Therefore, in this paper, we propose a medium access scheduling scheme, which adjusts the time interval for accessing to the shared transmission medium according to the amount of data for generating respective sensor node, and a priority control algorithm, which temporarily adjusts the priority of the sensor node that causes transmission concession due to the data priority until next successful transmission to ensure fairness.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.633-640
• /
• 2008

Sensor node clustering is one of the most popular research topics to reduce the energy of sensor nodes in wireless sensor networks. Previous researches, however, did not consider prediction effects of sensed environment information on TDMA scheduling of a cluster, resulting energy inefficiency. In this paper, we suggest an energy efficient cluster-based scheduling scheme that can be applied flexibly to many environment information systems. This scheme reflects the environment information obtained at the application layer to the MAC layer to set up the schedule of a cluster. The application layer information sets up the scheduling referring to the similarity of sensed data of cluster head. It determines the data transmission considering the result of similarity. We show that our scheme is more efficient than LEACH and LEACH-C in energy, which are popular clustering schemes, through simulation.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.5
• /
• pp.25-34
• /
• 1997

Relatively slow tuning speed of optical device causes the unwanted delay in high speed single-hop multiwavelength networks. To lessen the overhead, we present a channel access protocol with dynamjic message scheduling. Th eframe structure of proposed protocol adopts hybrid multiaccess scheme in which WDMA is used as a basic multiaccess technique and TDMA is used to provide subchannels within a wavelength band. This architecture has two merits : the network extention is not limited by available number of wavelengths, and the transmission delay caused by optical device tuning time can to minimize the number of tunings. It schedules messages that require same wavelength channels sequencely, so the total transmission delay is reduced by decreasement of wavelength changes. The performance of proposed protocol is evaluated through numerical analysis based on probability and queueing theory. The peformance of proposed protocol is evaluated through numerical analysis based on probability and queueing theory. The numeric results show that the peformance of proposed protocol is better than that of previous one.

• International journal of advanced smart convergence
• /
• v.1 no.2
• /
• pp.34-38
• /
• 2012

The recent increase in use of the IEEE 802.15.4 standard for wireless connectivity in personal area networks makes of it an important technology for low-cost low-power wireless personal area networks. Studies showed that voice communications over IEEE 802.15.4 networks is feasible by Guaranteed Time Slot (GTS) allocation; but there are some constraints to accommodate voice transmission beyond two hops due to the excessive transmission delay. In this paper, we propose a GTS allocation scheme for bidirectional voice traffic in IEEE 802.15.4 multihop networks with the goal of achieving fairness and optimization of resource allocation. The proposed scheme uses a greedy algorithm to allocate GTSs to devices for successful completion of voice transmission with efficient use of bandwidth while considering closest devices with another factor for starvation avoidance. We analyze and validate the proposed scheme in terms of fairness and resource optimization through numeral analysis.