• ETRI Journal
• /
• v.30 no.6
• /
• pp.765-773
• /
• 2008

Spatial correlation is a result of insufficient antenna spacing among multiple antenna elements, while temporal correlation is caused by Doppler spread. This paper compares the effect of spatial and temporal correlation in order to investigate the performance of multiuser scheduling algorithms in multiple-input multiple-output (MIMO) broadcast channels. This comparison includes the effect on the ergodic capacity, on fairness among users, and on the sum-rate capacity of a multiuser scheduling algorithm utilizing statistical channel state information in spatio-temporally correlated MIMO broadcast channels. Numerical results demonstrate that temporal correlation is more meaningful than spatial correlation in view of the multiuser scheduling algorithm in MIMO broadcast channels. Indeed, the multiuser scheduling algorithm can reduce the effect of the Doppler spread if it exploits the information of temporal correlation appropriately. However, the effect of spatial correlation can be minimized if the antenna spacing is sufficient in rich scattering MIMO channels regardless of the multiuser scheduling algorithm used.

• Korean Management Science Review
• /
• v.28 no.1
• /
• pp.43-52
• /
• 2011

The basic objective of broadcast scheduling is to get the smallest length TDMA frame, where many nodes are allowed to transmit simultaneously in a single time slot in a conflict-free manner. The secondary objective is to maximize the number of such transmissions for maximum use of the channel. An Artificial Bee Colony (ABC) with ranking strategy is proposed in this paper for the broadcast scheduling problem. Our proposed method is very efficient for generating initial and neighbor feasible solutions. We can get the best number of time slots and transmission utilization comparing to previous researches.

• The Journal of Information Technology
• /
• v.7 no.1
• /
• pp.57-67
• /
• 2004

Data broadcast has attracted a lot of attention as an efficient way of disseminating data to very large client populations. The main motivation of data broadcast systems is that the number of clients that they serve can grow arbitrarily large without any effect on their performance. The performance of broadcast system depends mainly on client caching strategies and on data broadcast scheduling mechanisms. This paper addresses the latter issue and proposes a new broadcast scheduling scheme, named RxW$^{\alpha}$, that is suitable to data broadcast systems. This paper also evaluates the performance of RxW$^{\alpha}$ on the basis of a simulation model. The performance results indicate that RxW$^{\alpha}$ is capable of improving the performance in the variance of response time significantly, showing a reasonable performance in the response time.

• Journal of Information Technology Services
• /
• v.8 no.1
• /
• pp.179-192
• /
• 2009

In wireless environments, it is very effective to introduce a data broadcast system for providing a number of clients with mobile data services. In particular, an efficient broadcast scheduling and a caching strategy are very important for performance of data broadcast systems in wireless environments which have such inherent restrictions as low bandwidth, frequent disconnections, and short battery life. In this paper, we present a data broadcast scheduling strategy using bit vectors to cope with dynamic request patterns of clients. In addition, we also propose an efficient caching strategy, 2FWT, that takes characteristics of the broadcast scheduling strategy into account. Finally, we evaluate performance of the data broadcast system. According to the results, the proposed system generally shows better performance than others.

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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.131-140
• /
• 2018

A broadcast scheduling scheme is an essential technique to improve the performance of data broadcast systems. This paper explores the problem of data broadcast over multiple channels to reduce query response time, and proposes a new hybrid data broadcast scheduling scheme named HDAMA. The proposed scheme employs the strategy that combines the advantages of push-based broadcast and pull-based broadcast. HDAMA could enhance the performance of query response time since it is capable of controlling the influence of access probability properly reflecting the characteristics of multi-data queries and broadcasting pull data items relatively on time. Simulation is performed to evaluate the performance of the proposed scheme. The simulation results show that the performance of HDAMA is superior to other schemes in terms of the average response time.

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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.61-69
• /
• 2021

On-demand broadcast is an effective data dissemination technique in mobile computing environments. This paper explores the issues for scheduling multi-data queries in on-demand broadcast environments, and proposes a new broadcast scheduling scheme named CASS. The proposed scheme prioritizes queries by reflecting the characteristics of multi-data queries, and selects the data that has not been broadcast in the query for the longest time as the broadcast data according to the query priority. Simulation is performed to evaluate the performance of CASS. The simulation results show that the proposed scheme outperforms other schemes in terms of the average response time since it can show highly desirable characteristics in the aspects of query data adjacency and data conflict rate.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.481-488
• /
• 2009

This paper proposes a new multiuser scheduling algorithm that can simultaneously support a variety of different quality-of-service (QoS) user groups while satisfying fairness among users in the same QoS group in MIMO broadcast channels. Toward this goal, the proposed algorithm consists of two parts: a QoS-aware fair (QF) scheduling within a QoS group and an antenna trade-off scheme between different QoS groups. The proposed QF scheduling algorithm finds a user set from a certain QoS group which can satisfy the fairness among users in terms of throughput or delay. The antenna trade-off scheme can minimize the QoS violations of a higher priority user group by trading off the number of transmit antennas allocated to different QoS groups. Numerical results demonstrate that the proposed QF scheduling method satisfies different types of fairness among users and can adjust the degree of fairness among them. The antenna trade-off scheme combined with QF scheduling can improve the probability of QoS-guaranteed transmission when supporting different QoS groups.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.248-256
• /
• 2002

In this paper, new multicast scheduling algorithms are proposed for the WDM single－hop broadcast－and－select networks. The existing multicast scheduling algorithms do not concerned the previous state of receivers, but the proposed method call H－EAR and PGM that partition a multicast group to subgroups using the tunable transmitter, state information of receivers, and pseudo group concept. the performance of proposed algorithms are evaluated through the computer simulation. They show the better Performance comparing with the existing multicast scheduling algorithm.