• 한국통신학회논문지
• /
• 제38A권6호
• /
• pp.535-544
• /
• 2013

본 논문은 단일 송신안테나를 갖는 다수의 모바일 터미널이 가상 MIMO 링크를 구성하는 MIMO 시스템에서의 역방향 전력 제어 방법을 제안한다. 기존의 성능을 향상 시키기 위하여 전력 벌칙 항을 추가하는 게임이론 기반의 전력 제어 방식과 달리, 전체 유효 간섭 전력에 대한 제한 조건 하에서 선형 수신 빔형성을 이용한 전송율의 유틸리티 함수를 최대화 하는 방법을 고려하였다. 또한, 전력제어 과정에 이너시아를 도입하여 제안 전력 제어가 수렴함을 보였다. 모의 실험을 통하여 간섭이 지배적인 다중셀 시스템에서 제안 전력 제어 방법이 시스템의 성능을 크게 향상 시킴을 입증하였다.

• ETRI Journal
• /
• 제38권2호
• /
• pp.314-325
• /
• 2016

This paper examines the resource gain that can be obtained from the creation of clusters of nodes in densely populated areas. A single node within each such cluster is designated as a "hotspot"; all other nodes then communicate with a destination node, such as a base station, through such hotspots. We propose a semi-distributed algorithm, referred to as coordinated cognitive tethering (CCT), which clusters all nodes and coordinates hotspots to tether over locally available white spaces. CCT performs the following these steps: (a) groups nodes based on a modified k-means clustering algorithm; (b) assigns white-space spectrum to each cluster based on a distributed graph-coloring approach to maximize spectrum reuse, and (c) allocates physical-layer resources to individual users based on local channel information. Unlike small cells (for example, femtocells and WiFi), this approach does not require any additions to existing infrastructure. In addition to providing parallel service to more users than conventional direct communication in cellular networks, simulation results show that CCT can increase the average battery life of devices by 30%, on average.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.137-144
• /
• 2003

We consider Two-echelon Single source Capacitated Facility Location Problem (TSCFLP). TSCFLP is a variant or Capacitated Facility Location Problem (CFLP). which has been an important issue in boa academic and industrial aspects. Given a set or possible facility locations in two echelons (warehouse / plant), a set or customers, TSCFLP is a decision problem to find a set or facility locations to open and to determine an allocation schedule that satisfies the demands or the customers and the capacity constraints or the facilities, while minimizing the overall cost. It ran be shown that TSCFLP Is strongly NP-hard For TSCFLf, few algorithms are known. which are heuristics. We propose a disaggregated version or the standard mixed integer programming formulation or TSCFLP We also provide a class or valid Inequalities Branch-and-price algorithm with rutting plane method Is used to find an optimal solution Efficient branching strategy compatible with subproblem optimization problems Is also provided. We report computational results or tests on 15 randomly generated instances.

• 대한임베디드공학회논문지
• /
• 제11권6호
• /
• pp.379-392
• /
• 2016

This paper presents the design and simulation of a laser power beaming (LPB) system for an electric vehicle that establishes an optimal power transmission path based on the received signal strength. The LPB system is possible to transfer power from multiple transmitters to a single receiver according to the characteristics of the laser and the solar panel. When the laser beams of multiple transmitters aim at a solar panel at the same time, the received power is the sum of all energy at a solar panel. Our proposed LPB system consists of multiple transmitters and multiple receivers. The transmitter sends its power characteristics as optically coded pulses with a class 1 laser beam and powers as a high-intensity laser beam. By using the attenuated power level, the receiver can estimate the maximum receivable powers from the transmitters and select optimal transmitters. Throughout the simulation, we verified the possibility that different LPB receivers were achieved their required power by the optimal allocation of the transmitter among the various transmitters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권12호
• /
• pp.4776-4798
• /
• 2015

The location selection of virtual machines in distributed cloud is difficult because of the physical resource distribution, allocation of multi-dimensional resources, and resource unit cost. In this study, we propose a multi-object virtual machine location selection algorithm (MOVMLSA) based on group information, doubly linked list structure and genetic algorithm. On the basis of the collaboration of multi-dimensional resources, a fitness function is designed using fuzzy logic control parameters, which can be used to optimize search space solutions. In the location selection process, an orderly information code based on group and resource information can be generated by adopting the memory mechanism of biological immune systems. This approach, along with the dominant elite strategy, enables the updating of the population. The tournament selection method is used to optimize the operator mechanisms of the single-point crossover and X-point mutation during the population selection. Such a method can be used to obtain an optimal solution for the rapid location selection of virtual machines. Experimental results show that the proposed algorithm is effective in reducing the number of used physical machines and in improving the resource utilization of physical machines. The algorithm improves the utilization degree of multi-dimensional resource synergy and reduces the comprehensive unit cost of resources.

• 한국인터넷방송통신학회논문지
• /
• 제16권1호
• /
• pp.245-251
• /
• 2016

본 논문은 다중공항의 도착/출발 문제에 대해 항공기 지연을 최소화시키는 최적 해를 얻을 수 있는 휴리스틱 알고리즘을 제안하였다. 단일 공항의 출발/도착 항공기의 지연 대수를 최소화시키는 최적 해를 찾는 문제에 대해 수학적 방법만이 제안되고 있다. 다중공항의 경우는 선형계획법이나 메타휴리스틱 방법의 일종인 유전자 알고리즘이 적용되고 있다. 제안된 알고리즘은 먼저, 각 공항의 i번째 단위시간 (15분)에서 총 도착/출발 항공기 대수에 대해 지연을 최소화시키는 운영 능력들 중 중앙값을 선택하였다. 다음으로 공항간 도착 항공기의 도착지를 변경시켰다. 실험 결과 제안된 알고리즘은 유전자 알고리즘에 비해 지연 항공기 대수에 대해 보다 좋은 결과를 얻었다.

• Asia pacific journal of information systems
• /
• 제2권2호
• /
• pp.31-54
• /
• 1992

Generating an action plan and obtaining commitment to achieve it is desired in organizations, but not always achieved. Whatever the reason, there is a room for an improved approach to decision making, so that people can arrive at a common understanding of a problem and commitment to action. Those are the purposes of a Decision Conferencing(DC). A DC, one example of single workstation-based GDSSs, is a two-day session attended by a group of people who attempt to resolve important issues of concern to their organization with the help of group facilitation techniques and decision analytic computer modelling. The interchange of differing perspectives on the issues is encouraged by the facilitator who attends to group processes but does not contribute to the content of discussions. Decision analysis provides a variety of structures for modelling the differing perspectives. Information and value judgements are incorporated in these models, whose results usually reveal new, higher-level perspectives on the issues. Information technology is needed to combine the part of the model and to facilitate on-the-spot replay of results. The experimental case study in this paper shows that how a DC can help a Korea's trading company to develop new, corporate level resource allocation strategies which are based on improved consensus among competing participants.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.118-123
• /
• 2009

In this paper, we propose packet selection and significance based interval allocation algorithm for real-time streaming service. In real-time streaming of inter-frame (and layer) coded video, minimizing packet loss does not imply maximizing QoS. It is true that packet loss adversely affects the QoS but one single packet can have more impact than several other packets. We exploit the fact that the significance of each packet loss is different from the frame type it belongs to and its position within GoP. Using packet dependency and PSNR degradation value imposed on the video from the corresponding packet loss, we find each packet's significance value. Based on the packet significance, the proposed algorithm determines which packets to send and when to send them. The proposed algorithm is tested using publicly available MPEG-4 video traces. Our scheduling algorithm brings significant improvement on user perceivable QoS. We foresee that the proposed algorithm manifests itself in last mile connection of the network where intervals between successive packets from the source and to the destination are well preserved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5253-5270
• /
• 2016

With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

• 한국항공우주학회지
• /
• 제39권4호
• /
• pp.354-361
• /
• 2011

본 연구에서는 단일 함정에 대해 근접방어용 대공방어유도탄을 이용한 대함유도탄 방어 기법 로직을 제안한다. 방어함정은 레이더 정보를 이용해 대함유도탄 궤적을 예측하고, 예측된 궤적을 바탕으로 방어 기법 로직에 의해 교전 계획을 수립한다. 방어 기법 로직은 최대한 많은 수의 대함유도탄을 함정으로부터 최대한 먼 곳에서 요격하는 로직으로 이전 발사가 요격에 실패했을 경우에 대비하기 위함이다. 방어유도탄의 할당에 관한 결정은 통합 격추 확률과 예상 요격 지점 비교를 통해 이루어진다. 제안한 로직의 성능은 비선형 2차원 평면 시뮬레이션을 통해 검증하였다.