• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.26-35
• /
• 2009

In this paper, we investigate how to do resource allocation to guarantee a minimum user data rate at low signaling overhead in multi-cell orthogonal frequency division multiple access (OFDMA) wireless systems. We devise dynamic resource allocation (DRA) algorithms that can minimize the QoS violation ratio (i.e., the ratio of the number of users who fail to get the requested data rate to the total number of users in the overall network). We assume an OFDMA system that allows dynamic control of frequency reuse factor (FRF) of each sub-carrier. The proposed DRA algorithms determine the FRFs of the sub-carriers and allocate them to the users adaptively based on inter-cell interference and load distribution. In order to reduce the signaling overhead, we adopt a hierarchical resource allocation architecture which divides the resource allocation decision into the inter-cell coordinator (ICC) and the base station (BS) levels. We limit the information available at the ICC only to the load of each cell, that is, the total number of sub-carriers required for supporting the data rate requirement of all the users. We then present the DRA with limited coordination (DRA-LC) algorithm where the ICC performs load-adaptive inter-cell resource allocation with the limited information while the BS performs intra-cell resource allocation with full information about its own cell. For performance comparison, we design a centralized algorithm called DRA with full coordination (DRA-FC). Simulation results reveal that the DRA-LC algorithm can perform close to the DRA-FC algorithm at very low signaling overhead. In addition, it turns out to improve the QoS performance of the cell-boundary users, and achieve a better fairness among neighboring cells under non-uniform load distribution.

• Industrial Engineering and Management Systems
• /
• v.7 no.1
• /
• pp.57-65
• /
• 2008

Available-to-promise (ATP) exhibiting availability of manufacturing resources can be used to support customer order promising. Recently, one advanced function called Capable-to-promise (CTP) is provided by several modern APS (advanced planning system) that checks available capacity for placing new production orders or increasing already scheduled production orders. At the customer enquiry stage while considering the order delivery date and quantity to quote, both ATP and CTP are allocated to support order promising. In particular, current trends of mass customization and multi-side production chain derive several new constraints that should be considered when ATP/CTP allocation planning for order promising - such as customer's preference plants or material vendors, material compatibility, etc. Moreover, ATP/CTP allocation planning would be executed over a rolling time horizon. To utilize capacity and material manufacturing resource flexibly and fulfill more customer orders, ATP/CTP rolling planning should possess resource reallocation mechanism under the constraints of order quantities and delivery dates for all previous order promising. Therefore, to enhance order promising with reliability and flexibility to reallocate manufacturing resource, the ATP/CTP reallocation planning mechanism is needed in order to reallocate material and capacity resource for fulfilling all previous promised and new customer orders beneficially with considering new derived material and capacity constraints.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.189-200
• /
• 2001

This paper proposes a memory allocation model for Real-Time Linux. The proposed model allows users to create several continuous memory regions in an application, to specify an appropriate region allocation policy for each memory region, and to request memory blocks from a necessary memory region. Instead of using single memory management module in order to support the proposed model, we adopt two-layered structure that is consisted of region allocators implementing allocation policies and a region manager controlling regions and region allocator modules. This structure separates allocation policy from allocation mechanism, thus allows system developers to implement same allocation policy using different algorithms in case of need. IN addition, it enables them to implement new allocation policy using different algorithms in case of need. In addition, it enables them to implement new allocation policy easily as long as they preserver predefined internal interfaces, to add the implemented policy into the system, and to remove unnecessary allocation policies from the system, Because the proposed model provides various allocation policies implemented previously, system builders can also reconfigure the system by just selecting most appropriate policies for a specific application without implementing these policies from scratch.

• Journal of Energy Engineering
• /
• v.16 no.1 s.49
• /
• pp.15-21
• /
• 2007

In order to solve problems of global warming, many policies and measures has been implemented in various countries. In January 2005, the European Union Emission Trading Scheme officially started. In order to take it into action, the EU ETS stated that all members must submit the national allocation plan including the national's total allowances, allowances for installations, reserve for new entrants, etc. In the process of this decision-making, it was also stated that problems related with early action should be solved by each member state at its option. This paper is a study on necessity of compensation for early action and its limitation of its practices. With a comparative study on dealing with early action in the key nations including Germany, the Netherlands and United Kingdom, we can get insights and strategies for effective processes of dealing with early action and the direction for harmonizing data collection and allocation rules.

• Journal of Digital Contents Society
• /
• v.9 no.3
• /
• pp.433-439
• /
• 2008

A moving picture in online game is one of major ways to advertise online games, which gives a lot of help in playing game. In this case, a moving picture is compressed to variable bit rate for efficient storage use and network resource efficiency. Adaptable bandwidth allocation technique builds a transmission plan of a game moving picture. And, then some frames are discarded when transmission rate by the transmission plan is larger than available transmission rate, until transmission rate satisfies available transmission rate. Thus, performance evaluation factors in adaptable bandwidth allocation technique may be dependent on discarding order of a frame which transmission rate is much influenced. In this paper, in order to show the performance, a CBA algorithm, an MCBA algorithm, an MVBA algorithm, [6] and [7] algorithm were applied to a transmission plan in the adaptable band width allocation technique using various frame discard methods and performance evaluation factors were compared in among smoothing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.505-516
• /
• 2012

According to distribute of resource of macro cell and reduce distance between transmitter and receiver, Femto cell system is promising to provide costeffective strategy for high data traffic and high spectral efficient services in future wireless cellular system environment. However, the co-channel operation with existing Macro networks occurs some severe interference between Macro and Femto cells. Hence, the interference cancellation or management schemes are imperative between Macro and Femto cells in order to avoid the decrease of total cell throughput. First, we briefly investigate the conventional resource allocation and interference cancellation scheme between Macro and Femto cells. So we found that cell throughput and frequency reuse ware decreased Then, we propose an adaptive resource allocation scheme based on the distribution of Femtocell traffic in order to increase the cell throughput and also maximize the spectral efficiency over the FFR (Fractional Frequency Reuse) based conventional resource allocation schemes. Simulation Results show that the proposed scheme attains a bit similar SINR (Signal to Interference Noise Ratio) distribution but achieves much higher total cell throughput performance distribution over the conventional resource allocation schemes for FFR and future IEEE 802.16m based Femtocell network environment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.9
• /
• pp.1340-1346
• /
• 2022

In this paper, we consider a downlink non-orthogonal multiple access (NOMA) using multiple transmit antennas, where the transmit antenna selection scheme is used to reduce the system complexity. Thus, in this paper, we propose radio resource allocation and receiver selection schemes in order to improve the outage probability performance of the downlink NOMA system using the transmit antenna selection scheme. In particular, the receiver selection scheme is a method of grouping the receivers to improve the outage probability performance, and the radio resource allocation scheme is a method of allocating radio resources to each group in order to enhance the outage probability performance. In addition, through the computer simulation under the assumption of independent Rayleigh fading channels, we show that the proposed radio resource allocation and receiver selection schemes can improve the outage probability performance at the expense of the sum rate performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6A
• /
• pp.455-464
• /
• 2005

In this paper, we implement resource allocation algorithm based on the WiBro system which including OFDMA, TDD, and we propose the algorithm in order to increase bandwidth efficiency. In this algorithm, data is allocated from the subchannel which has large channel gain to the subchannel which has small channel gain with maximum modulation order. The moment total power is more than available power, the modulation order of the latest subchannel is adjusted. The problem of decreasing of throughput in large channel attenuation environment is solved by allocating additional power. Still, this algorithm has large bandwidth efficiency.

• Animal Bioscience
• /
• v.35 no.2
• /
• pp.299-307
• /
• 2022

Objective: The objective of this study was to determine the effects of different social ranking order (SRO) and the enrichments (perch and dust-bath) allocation (EA) on behavior of laying hens in furnished cages. Methods: Total experimental period was 4 weeks. There were 216 Hy-line brown layers beak-trimmed at 1 d of age and selected randomly at 14 weeks of age from a commercial farm, and randomly divided into 36 cages with 6 hens in each cage. High enrichments (perch and dust-bath) allocation (HEA) and low enrichments (perch and dust-bath) allocation (LEA) were provided. Video observations of behavior were obtained from the focal hens between 14 and 18 weeks of age and perching, dust-bathing and other general behaviors of the hens with different social orders were measured. Results: Perching behavior of high SRO hens (HSR) were significantly higher than that of medium SRO hens (MSR), and that of the MSR were significantly higher than that of low SRO hens (LSR) (p<0.01), except for lying on perch (p>0.05). The hens in the high EA cage (HEAC) showed more lying behavior on perch than those in the low EA cage (LEAC) (p<0.01). The different SRO and EA did not affect dust-bathing behavior except vertical wing-shaking behavior (p<0.05). The LEA did not affect general behaviors (p>0.05), except standing and preening behaviors (p<0.01 and p<0.05), of which the hens in the HEAC showed less standing (p<0.01) and more preening behavior than the hens in the LEAC. Conclusion: The SRO of laying hens has a significant effect on the perching behaviors, but SRO and EA have little effect on dust-bathing and general behaviors.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1067-1071
• /
• 2004

In this paper, the performance enhancement algorithm of channel allocation for voice and data transmission in cellular networks is proposed. The voice activity detection has been applied to dynamic channel allocation procedure to detect and separate the silence and speech among conversation periods. Hence a data user can use the silent period of an active voice channel to transmit its information. To control the selecting of channel allocation policies, the information of number of data in transmission waiting queue has been determined in order to accept the performance measurement. In the simulation results, the improvement of the performance shows via the quality of services, which are an average delay in queue, a blocking probability, and an impact of the proposed scheme is presented in the system.