• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.2
• /
• pp.63-72
• /
• 2011

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. With the objective of minimizing this wait time, this paper explores the problem of data broadcast over multiple channels. In traditional approaches, data items are partitioned based on their access probabilities and allocated on multiple channels, assuming flat data scheduling per channel. If the data items allocated on the same channel are broadcast in different frequencies based on their access probabilities, the performance will be enhanced further. In this respect, this paper proposes a new broadcast scheduling scheme named two level dynamic programming(TLDP) which can reflect a variation of access probabilities among data items allocated on the same channel.

• ETRI Journal
• /
• v.36 no.5
• /
• pp.819-828
• /
• 2014

To solve the increasing popularity of video streaming services over the Internet, recent research activities have addressed the locality of content delivery from a network edge by introducing a storage module into a router. To employ in-network caching and persistent request routing, this paper introduces a hybrid content delivery network (CDN) system combining novel content routers in an underlay together with a traditional CDN server in an overlay. This system first selects the most suitable delivery scheme (that is, multicast or broadcast) for the content in question and then allocates an appropriate number of channels based on a consideration of the content's popularity. The proposed scheme aims to minimize traffic volume and achieve optimal delivery cost, since the most popular content is delivered through broadcast channels and the least popular through multicast channels. The performance of the adaptive scheme is clearly evaluated and compared against both the multicast and broadcast schemes in terms of the optimal in-network caching size and number of unicast channels in a content router to observe the significant impact of our proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8A
• /
• pp.601-611
• /
• 2012

In this paper, we first study the spatial multiplexing gain for the 3-cell interfering broadcast channels (IFBC) where all base stations and mobile users are equipped with multiple antennas. Then, we present the IA scheme in conjunction with user selection which outperforms the TDMA technique in the IFBC environment. The optimal scheduling method utilizes multiuser diversity to achieve a significant fraction of sum capacity by using an exhaustive search algorithm. To reduce the computational complexity, a suboptimal scheduling method is proposed based on a coordinate ascent approach.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.07a
• /
• pp.11-16
• /
• 2003

본 논문에서는 새로운 공개키 다중채널 broadcast encryption scheme(이하 PK-MCBE라 부른다)을 제안한다. 일반적인 broadcast encryption은 하나의 채널스트림을 전송하는 반면 PK-MCBE는 다수채널의 컨텐츠 스트림을 전송한다. 본 논문에서 제안하는 방식에서 수신자는 단지 하나의 비밀키만을 필요로 하며 한번 받은 비밀키는 변경되지 않는다. 제안하는 방식에서는 각 채널당 송신자가 전송하는 메세지의 공통부분을 한번만 전송하여 전체 전송 메세지의 길이를 줄일 수 있다. 또한 배신자(traitors)를 추적하여 효과적으로 강제 탈퇴시킬 수 있다.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.272-275
• /
• 2014

In this paper, the spectrum sharing cognitive radio network is investigated. For assuming that channels for the secondary network are double Rayleigh fading channels, we derive the exact and the approximate outage probabilities. Numerical results verify the validity of our theoretical analysis by comparison with Monte Carlo simulation results.

• Journal of Broadcast Engineering
• /
• v.6 no.1
• /
• pp.72-81
• /
• 2001

An adaptive channel estimation technique for OFDM-based DTV receivers is proposed using a new mobility estimator. Sample mean techniques for channel estimation have displayed good performance in slow fading channels, because averaging reduces noise In channel estimation operation. This paper suggests an algorithm which selects the optimal number of symbols within which the sample mean of consecutive pilot data can be obtained. The designed mobility estimator determines the optimal number by comparing mobility variance and estimated noise valiance. The algorithm using the mobility estimator obtains an optimal channel function under time-invariant or time-variant multipath fading channels, thereby making the best BER performance.

• ETRI Journal
• /
• v.38 no.3
• /
• pp.435-443
• /
• 2016

In this paper, an efficient beam tracking algorithm for a regularized zero-forcing (RZF) approach in slowly fading multiple-input and single-output (MISO) broadcast channels is considered. By modifying an RZF equation, an RZF beam tracking algorithm is proposed using matrix perturbation theory. The proposed algorithm utilizes both beams from the previous time step and channel difference (between the previous and current time steps) to calculate the RZF beams. The tracking performance of the proposed algorithm is analyzed in terms of the mean square error (MSE) between a tracking approach and an exact recomputing approach, and in terms of the additional MSE caused by the beam tracking error at the receiver. Numerical results show that the proposed algorithm has almost the same performance as the exact recomputing approach in terms of the sum rate.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.609-611
• /
• 2010

IPTV(Internet Protocol Television)is the point in commercial and broadcast content from the numerous channels that are growing exponentially, Many people with mobile devices anywhere, anytime you want to use IPTV, demand will increase. Numerous channels for collecting information about EPG (Electronic Program Guide) service, IP (Internet Protoco) communications using a fast search of content for broadcast EPG is time to take advantage of the service. Using the current wired network, the Android-based IPTV services to take advantage of the EPG in the mobile environment to provide an environment being studied, and Country of the European digital broadcast standard DVB-MHP standard is followed by subsequent research and development of the EPG service is required. In this study, using the existing wired network, IPTV EPG service information of the channel in a mobile environment user-friendly as possible by providing channels for EPG service information to users quickly and easily search for content to provide an environment and Android-based mobile IPTV environment to take advantage of the EPG service channels of broadcast channels with in the EPG service for users to gather information retrieval system is proposed.