• 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 Korea Multimedia Society
• /
• v.13 no.10
• /
• pp.1423-1435
• /
• 2010

Building wireless sensor networks requires a constituting sensor node to consider the following limited hardware resources: a small battery lifetime limiting available power supply for the sensor node, a low-power microprocessor with a low-performance computing capability, and scarce memory resources. Despite such limited hardware resources of the sensor node, the sensor node platform needs to activate real-time sensing, guarantee the real-time processing of sensing data, and exchange data between individual sensor nodes concurrently. Therefore, in this paper, we propose an energy-efficient real-time task scheduling technique for battery-powered wireless sensor nodes. The proposed energy-efficient task scheduling technique controls the microprocessor's operating frequency and reduces the power consumption of a task by exploiting the slack time of the task when the actual execution time of the task can be less than its worst case execution time. The outcomes from experiments showed that the proposed scheduling technique yielded efficient performance in terms of guaranteeing the completion of real-time tasks within their deadlines and aiming to provide low power consumption.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.676-678
• /
• 2002

In this work, we present the novel scheduling algorithm of the multimedia data retrieval for the mobile disk drive. Our algorithm is focused on minimizing the power consumption involved in data retrieval from the local disk drive. The prime commodity in mobile devices is the electricity. Strict restriction on power consumption requirement of the mobile device put unique demand in designing of its hardware and software components. State of the art disk based storage subsystem becomes small enough to be embedded in handhold devices. It delivers abundant storage capacity and portability. However, it is never be trivial to integrate small hard disk or optical disk drive in handhold devices due to its excessive power consumption. Our algorithm ARM in this article generates the optimal schedule of retrieving data blocks from the mobile disk drive while guaranteeing continuous playback of multimedia data.

• Journal of Korea Multimedia Society
• /
• v.8 no.10
• /
• pp.1383-1390
• /
• 2005

Mobile Multimedia Storage Server should provide to store and transfer a data that the number of concurrent datum by Personal Digital Assistant(PDA) requests in real time. simultaneously. But, While the large number of a PDA request connect to MTS (Mobile Translation Storage) server with BottleNeck problem in mobile internet environment by many constraints such as limited bandwidth can be introduced. This paper introduces an optimal method of new DVDS (Dynamic Variable Disk Scheduling) for MTS server which is based on the Weight Value to solve the BottleNeck problems that occur when transfer and store capture images through mounted digital camera on the PDA in real time simultaneously. The comparison with previous research shows that the proposed scheme provides better.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1151-1168
• /
• 2009

Improving packet loss does not necessarily coincide with the improvement in user perceivable QoS because each frame carries different degree of importance. We propose Significance-aware packet scheduling (SAPS) to maximize user perceivable QoS. SAPS carries out two fundamental issues of packet scheduling: "What to transmit" and "When to transmit?" To adapt to the available bandwidth, it is necessarily to transmit the subset of the data packets if the entire set of packets can not be transmitted. "Packet Significance" quantifies the importance of the frame by elaborately incorporating frames' dependency. Greedy approach is used in selecting packets and transmission schedule is determined based on the Packet Significance. The proposed scheme is tested using publicly available MPEG-4 video clips. Decoding engine is embedded in the simulation software and user perceivable QoS is exposeed in termstermiSNR. Throughout the simulation based experiment, the performance of the proposed scheme is compared two other schemes: Size-based packet scheduling and Bit-rate based best effort packet scheduling. SAPS successfully incorporates the semantics of a packet and improves user perceivable QoS significantly. It successfully provides unequal protection to more important packets.

• Journal of Korea Multimedia Society
• /
• v.19 no.5
• /
• pp.924-931
• /
• 2016

In this paper, Various network adaptive MAC scheduling technique is proposed to effectively overcome limits of narrow bandwidth and low transmission speed in underwater. UPFC(Underwater Packet Flow Control) is a technique to reduce both the number of transmission and transmission time using three types (Normal, Blocked, Parallel) of data transmission. In this technique, the load information, in which a transmission node have, is transmitted to destination node using marginal bit in reserved header. Then the transmitted information is referred to determine weighting factor. According to the weighting factor, scheduling is dynamically changed adaptively. The performance of UPFC is analyzed and flow control technique which can be applied to Cluster Based Network and Ad Hoc network as well.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.71-73
• /
• 2004

Recently many peoples served multimedia data from Internet. But characteristic of multimedia-object about that effect on weight and transport-time causes Streaming Application is restricted to high-quality-service. This research propose the Quality-of-service(QoS) supporting for Home Gateway that behaving Routing and media platform equipment, using CBQ Scheduling scheme. The QoS Supporting for Multimeda Service that using general Rouging policy is difficult because media platform locate in Home Gateway. Therefore this research propose Routing mechanism to QoS support of media platform located in Gateway using TCP based CBQ Control.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.445-452
• /
• 2004

Zoning technology of disk improved the performance of disk subsystem with increase of storage capacity and average transfer bandwidth. SCAN disk scheduling with double buffering is used to utilize the performance of zoned disk in multimedia system. However, this method has a problem that generates jitter when the number of steams increases. In this article, we propose the novel approach, pre-buffering policy, to overcome this problem. Pre-buffering avoids jitter by buffering the lack of data before starting service, which is estimated from the current cycle length and the maximum cycle length. We can calculate cycle length, data sire needed in each cycle and the possible lack of data caused by the increase of the number of streams using the numerical model of disk subsystem. Pre-buffering can be applied for multimedia systems and contribute to provide clients with high quality service without jitter.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1521-1529
• /
• 2009

There is a serious unfairness problem between upstream and downstream flows of AP in IEEE 802.11 Wireless LAN. This problem is because Wireless LAN's DCF MAC protocol provides AP with equal channel access priority to mobile noded. Also, it makes this problem worse that the TCP's Data segment loss is more effective on throughput than the TCP's ACK segment. In this paper, we first make several simulations to analysis the unfairness in the various point of view and to find reasons of the unfairness. Also, this paper presents AP's scheduling scheme to alleviate the unfairness problem and evaluate the scheme through ns2 simulator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.11C
• /
• pp.94-101
• /
• 2001

In this paper, we propose WRR cell scheduling algorithm that improve current smoothing scheme. In proposed cell scheduling algorithm, using the number of practical input cell in each VC and variable thats indicate weight and state of queue, we could service VC of buffer efficiently that input cells over weight value and input cells smaller than weight value. And, we could service multimedia data by providing remained bandwidth after that allocate to real time traffic with non-real time traffic. In this result, the number of serviceable average cells were increased and length of buffer was decreased. Through the computer simulation, we evaluated the performance of proposed algorithm. According to the results, the proposed algorithm showed good performance.