• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.25-33
• /
• 2008

Video telephony is a representative service in 3G mobile network. And there have been efforts to improve quality of video telephony service in different fields. In Korea, the leading mobile service provider SKTelecom and KTF service the WCDMA network as 3G mobile network. Now, more than a million people is using the network. In this paper, we study about video telephony over WCDMA network. and propose error minimizing algorithm using cross-layer adaptation between physical layer and video codec. We simulated 3G-324M protocol with MPEG-4 video codec, and simulation results show suggested algorithm improve packet transmission rate for improving quality of video telephony service.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.17-27
• /
• 2012

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

• Journal of Communications and Networks
• /
• v.10 no.4
• /
• pp.412-421
• /
• 2008

We observe simultaneous transmission of relay stations (RSs) allowed in current IEEE 802.16j draft standard for multi-hop relay networks may involve severe interference among the RSs, hence leading to throughput degradation. Allowing only 1/3 of the RSs to simultaneously transmit instead of 1/2 RSs as in the current draft standard reduces the interference but results in reduced throughput. To remedy this problem, we devise schemes to incorporate network coding at link-layer level (decode-and-forward) into the simultaneous transmission of RSs. Data movement is rearranged to maximize coding gain. Formula is derived to dictate exact movement of packets traveling between base station (BS) and mobile stations (MSs) via intermediate RSs. The frame structure in the current IEEE 802.16j draft standard does not allow broadcast needed for network coding. We devise a new frame structure which supports the broadcast. A new R-MAP (pointers to the burst data) is introduced to implement the broadcast. Since our new frame structure is used only for BS to RS or RS to RS communication, our schemes retain backward compatibility with legacy MSs based on IEEE 802.16e standard. Simulation based on simple configuration of RSs shows considerable improvement in terms of system throughput and round trip delay. For a 4-hop relay network with 1 BS and 4 RSs with symmetric traffic in uplink (UL) and downlink (DL), throughput is improved by 49% in DL and by 84% in UL traffic compared with IEEE 802.16j draft standard under the assumption that omni-directional antennae are used in BS and RSs.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.715-722
• /
• 2001

Mobile computing has become a reality thank to the convergence of two technologies :powerful portable computers and the wireless networks. The restrictions of wireless network such as bandwidth and energy limitations make data broadcasting an attractive data communication method. This paper addresses the clustering of wireless broadcast data for multipoint queries. By effective clustering of broadcast data the mobile client can access the data on the air in short latency In the paper we define the data affinity and segment affinity measures. The data affinity is the degree that two data objects are accessed by queries, and the segment affinity is the degree that two sets of data (i.e segments) are accessed by queries Our method clusters data objects based on data and segment affinity measures we show that the performance of our method is scarcely infuenced by the growth of the number of queries.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.215-226
• /
• 2014

The 3D technology has been spread slowly and the reason would be attributed to the fact that most commercialized 3D displays require 3D glasses. There have been various researches on human factors of glass type 3D display. In this study we measured and modeled crosstalk as well as 3D visual fatigue induced by mobile glassless 3D display. Crosstalk as well as visual fatigue varied depending on horizontal position of the 3D mobile display. Measured crosstalk was relative low around the center of the display and it increased at the side of the display. Similar results were found in the measurement of 3D visual fatigue and discomfort. These results imply that human factors should be considered in the process of design and evaluation of mobile 3D displays.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.4
• /
• pp.157-163
• /
• 2013

The development of the latest media technology has changed the traditional broadcasting system. The traditional broadcasting system, which was operated by the mass media and the terrestrial broadcasters, is now transformed to the viewer-centered and bidirectional media through the convergence of internet and mobile. In terms of broadcasting environment, the function of the traditional TVs has been changed to the Smart TVs combined with an open platform which not only deliver visual contents, but also supply various applications and additional information linking the content providers and viewers. This ongoing broadcasting environmental change has made it possible for viewers to participate in the programs such as reality shows or sports events through SNS, texting or phone calls. Therefore, the purpose of this experiment is to present the ways to promote easier and more convenient viewer-participation in the programs by applying mobile messenger to existing broadcasting system in order to enhance the involvement of broadcasters and viewers of the programs and to diversify the roles of content providers and viewers in broadcasting.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.10
• /
• pp.1330-1336
• /
• 2021

Media sharing platform such as YouTube have grown significantly in the mobile environment. This is a platform that allows users to select and view broadcast programs that are only available on TV through network-connected PCs and mobiles, and share their media content to communicate. Currently, in the era where mobile and TV broadcasts can be viewed equally, there is a time difference between the video and real-time screen transmitted to TV and mobile, different from the actual situation.We want this time difference to be realized in the same way as the real time, and there is a need for a system that can broadcast in a free environment at any time. Therefore, in this paper, a broadcasting system was designed and implemented in a mobile environment. The result of reducing the delay time difference due to the improvement of the processing method was obtained.

• Journal of Broadcast Engineering
• /
• v.16 no.3
• /
• pp.427-438
• /
• 2011

In this paper, we propose a content retrieval system using pictures taken from a display for more intelligent mobile services. We focus on the search robustness by minimizing the influence of photographing conditions such as changes in the illumination intensity. For an efficient search and precise detection, as well as robustness, we use a two-step comparison method based on indexing features and a binary map based on luminance and chrominance difference with the adjacent blocks. We also evaluate the proposed algorithm by comparing with the existing algorithms, and we show the content retrieval system that we've implemented using the proposed algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4B
• /
• pp.170-177
• /
• 2005

Due to the redundant rebroadcast packets, network-wide broadcasting is a costly operation in wireless mobile ad hoc networks. To reduce this redundancy, most of previous approaches implicitly or explicitly require periodic refreshing of neighborhood information which continuously imposes additional broadcast overheads. In this paper, we propose a practical broadcast pruning scheme based on the local prediction of a remained coverage area. As the proposed scheme uses only information available in the on-going broadcast process, it can minimize the overheads prevalent in previous approaches.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.185-194
• /
• 2002

Most of mobile computing systems allow mostly read-only transactions from mobile clients for retrieving various types of Information such as stock data, traffic information and news updates. Since previous concurrence control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose OCC/UTF(Optimistic Concurrence Control with Update Transaction First) that is most appropriate for broadcast environment. OCC/UTF lets a query transaction, that has already read the data item which was invalidated by update transaction, read again the same data item without the abort of the query transaction due to non-serializability. Therefore, serializable order is maintained and the query transaction is committed safely regardless of commitment of update transactions. In OCC/UTF, Clients need not require server to commit their query transactions. Because of broadcasting the validation reports including values updated recently to clients, it reduces the overhead of requesting recent values from the server and the server need not also re-broadcast the newest values. As a result, OCC/UTF makes full use of the asymmetric bandwidth. It can also improve transaction throughput by increasing the commit ratio of query transactions as much as possible.