• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.337-344
• /
• 2011

In this paper, a multiple-input and multiple-output (MIMO) spatial multiplexing (SM) relay system is studied in a bit error rate (BER) sense, where every node is deployed with multiple antennas. In order to efficiently use the limited power resource, it is essential to optimally allocate the power to nodes and antennas. In this context, the power allocation (PA) algorithm based on minimum BER (MBER) for a MIMO SM relay system is proposed, which is derived by direct minimization of the average BER, and divided into inter-node and inter-antenna PA algorithm. The proposed scheme outperforms the conventional equal power allocation (EPA) algorithm without extra power consumption.

• Survey Research
• /
• v.12 no.2
• /
• pp.77-88
• /
• 2011

Korean telephone surveys have been based on telephone directory and thus criticized for considerable under-coverage. Now, Korean survey institutions progress to random digit dialing (RDD) very actively. But still most surveys are administered by quota sampling, prone to assign heavier weights to social classes with more hours staying indoor. As a practical remedy, time-balanced quota sampling scheme was proposed by Huh and Hwang (2006). This study compares two telephone surveys on TV audience environment in Korea: RDD with conventional quota sampling versus RDD with time-balanced quota sampling.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.1-7
• /
• 1989

A new algorithm for frequency channel assignment in high capacity cellular mobile communication systems is proposed. The algorithm is the advanced type of the fixed channel assignment scheme. It enables calls having all nominal channels busy to be served by adjacent cells have idle channels. Thus, it considerably reduces the blocking probability compared with the fixed channel assignment. Simulation has been performed for a 49-cell system having uniform traffic density hexagonal array as a representative system lay out. Results showed that new algorithm is better than the fixed channel assignment scheme in high capacity cellular mobile communication systems.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.117-126
• /
• 2005

This paper presents an adaptive processor allocation strategy to reduce fragmentation in a large multi-user multicomputer system. A small number of jobs with unexpectedly large submesh allocation requirements may significantly increase the queuing delay of the rest of jobs. Under such circumstances, our strategy further tries to allocate L-shaped submeshes instead of signaling the allocation failure unlike other strategies. We have developed the efficient algorithm to find the allocatable L-shaped submeshes. Thus, our strategy reduces the mean response time by minimizing the queuing delay, even though jobs are scheduled in an FCFS to preserve fairness. The simulations show that our strategy performs more efficiently than other strategies in terms of the job response time and the system utilization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.987-990
• /
• 2009

The MAC protocol of HiperLAN/2 is based on TDMA/TDD. The radio channels are assigned by AP(Access Point) that is centrally operated. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Therefore, number of RCH should be allocated properly according to traffic. From these viewpoint, this paper proposes an advanced scheme that dynamically changed the number of RCH which is based on the number of success and collision of RR message in previous MAC frame. To prove efficiency of proposed scheme, a lots of simulations are conducted and analyzed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.131-134
• /
• 2009

The MOST network, which is a network for vehicle infotainment network, requires efficient channel allocation to provide multimedia service effectively. Though there is a study on channel allocation according to network traffic as studies on channel allocation for MOST network, there have scarcely been studies on channel allocation according to bandwidth of multimedia for transferring. Therefore, in this paper, we propose the channel allocation method which calculates the number of channels by analyzing multimedia data for transferring and assigns the optimal number of channels for the given data. The proposed method reduces wasting of channels by optimally allocating channels and prevents initializing network due to change of Boundary Descriptor.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1131-1136
• /
• 2020

Cooperative networks enhance the performance of communication systems by combining received signals from the several relay nodes where the source node transmits signals to relay nodes. In this paper, we analyze the effect of resource allocation in cooperative networks. We assume that the cooperative networks use the conventional modulation scheme between the source and relay nodes, and adopt space-time code between the relays and destination node. Both the synchronous and differential modulations are applied for the conventional scheme and differential modulation is used for the space-time code. We consider relay location and energy allocation for resource allocation, and the performance of cooperative networks depending on the number of relay is also investigated.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.11-21
• /
• 2010

Increase in the number of sensor nodes in sensor networks and sensor node to automatically assign addresses are needed. The method developed to address existing severe wasting, coordinators have all address information, each sensor node when addressing the shortcomings are a lot of traffic. In this paper, 6LoWPAN automatically from the sensor nodes capable of efficiently addressing Hop-Count based hierarchical address allocation algorithm is proposed. How to propose a hop-count of divided areas are separated, with no overlap and can be assigned a unique address, DAD(Duplicate Address Detection) reduced area. Perform DAD to reduce traffic, packet transmission in the IP header destination address, respectively, with a minimum 32-bit compression and packet transmission over a non-compression method to reduce the number of 11.1%.

• Environmental and Resource Economics Review
• /
• v.15 no.4
• /
• pp.591-642
• /
• 2006

This paper intends to analyze economic impacts of commitment period and initial allocation in emissions trading using computable general equilibrium (CGE) modeling. The fully dynamic CGE model with perfect foresight assumption is employed to illustrate (i) how a model displays economic impact of $CO_2$ regulation upon different commitment periods: one-year budget clearing vs. 5-year commitment period, (ii) how major 8 energy-intensive industries respond to different ways to allocate initial allowances. According to the results of the analysis, it IS found that market players are motivated to bank the permits and tend to sell permits in earlier stage and to buy permits in later stage of commitment period. This implies that banking allows permit trading within a commitment period, which supports the conclusions of Kling and Rubin (1997). Other findings are related to efficiency. That is, emissions trading surpasses command and control, in terms of economic efficiency and longer terms of commitment period converge on lower permit price, In long term, initial allocation based on value-added performs the lowest GDP loss among different initial allocations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.442-460
• /
• 2001

In video-on-demand(VOD) systems it is important to minimize initial latency and memory requirements. The minimization of initial latency enables the system to provide services with short response time, and the minimization of memory requirements enables the system to service more concurrent user requests with the same amount of memory. In VOD systems, since initial latency and memory requirement increase according to the increment of buffer size allocated to user requests, the buffer size allocated to user requests must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that thy system is in fully loaded state. Thus, when the system is in partially loaded state, the scheme allocates user requests unnecessarily large buffers. This paper proposes a dynamics buffer allocation scheme that allocates user requests the minimum buffer size in fully loaded state as well as a partially loaded state. This scheme dynamically determines the buffer size based on the number of user requests in service and the number of user requests arriving while servicing current requests. In addition, through analyses and simulations, this paper validates that the dynamics buffer allocation outperforms the statics buffer allocation in initial latency and the number of concurrent user requests that can be supported. Our simulation results show that, in proportion to the static buffer allocation scheme, the dynamic buffer allocation scheme reduces the average initial latency by 29%~65%, and in a systems having several disks. increases the average number of concurrent user requests by 48%~68%. Our results show that the dynamic buffer allocation scheme significantly improves the performance and reduce the capacity requirements of VOD systems.