• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권5호
• /
• pp.2015-2028
• /
• 2016

In this paper, we propose a sum transmission rate maximization based cooperative spectrum sharing protocol with quality-of-service (QoS) support for both of the primary and secondary systems, which exploits the situation when the primary system experiences a weak channel. The secondary transmitter ST_b which provides the best performance for the primary and secondary systems is selected to forward the primary signal. Specifically, ST_b helps the primary system achieve the target rate by using a fraction of its power to forward the primary signal. As a reward, it can gain spectrum access by using the remaining power to transmit its own signal. We study the secondary user selection and optimal power allocation such that the sum transmission rate of primary and secondary systems is maximized, while the QoS of both primary and secondary systems can be guaranteed. Simulation results demonstrate the efficiency of the proposed spectrum sharing protocol and its benefit to both primary and secondary systems.

• 자동차안전학회지
• /
• 제5권2호
• /
• pp.11-16
• /
• 2013

This paper presents a unified control algorithm of independent braking and steering for collision avoidance. The desired motion of the vehicle in the yaw plane is determined using the probabilistic risk assessment method based on target state estimation. For the purpose of coordinating the independent braking and steering, a non-linear vehicle model has been developed, which describes the vehicle dynamics in the yaw plane in both linear and extended non-linear ranges of handling. A control allocation algorithm determines the control inputs that minimize the difference between the desired and actual vehicle motions, while satisfying all actuator constraints. The performance of the proposed control algorithm has been investigated via computer simulations conducted using the vehicle dynamics software CARSIM and Matlab/Simulink.

• 정보처리학회논문지B
• /
• 제8B권6호
• /
• pp.601-608
• /
• 2001

The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.

• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.112-117
• /
• 2007

In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

• 한국통신학회논문지
• /
• 제33권3A호
• /
• pp.248-255
• /
• 2008

OFDMA 시스템에서 주파수축에서의 다중사용자 스케줄링의 성능은 채널의 주파수 선택적 특성과 상관이 있다. 채널이 주파수축에서 평탄하면 다중사용자 스케줄링의 이득이 줄어들 수 있으며 반대로 주파수 선택적 특성이 너무 커서 할당 대역폭 내에서 채널의 변화가 심하게 일어난다면 충분한 스케줄링 이득을 얻기 어려워진다. 다중 사용자 스케줄링 이득을 최대화하기 위해서는 순환지연 다이버시티를 적용하여 채널의 주파수 선택적 특성을 조절할 수 있다. 이 논문에서는 할당 대역폭과 채널 특성을 고려하여 순환지연 다이버시티를 적용할 때의 최적의 지연값을 결정하는 방법을 제안한다.

• 정보처리학회논문지D
• /
• 제16D권3호
• /
• pp.295-306
• /
• 2009

질의실행시간최소화는 분산 데이타베이스 설계에 있어 가장 중요한 목적중의 하나이다. 총시간최소화는 온라인거래처리시스템의 목적인 반면, 반응시간최소화는 의사결정지원 질의시스템의 목적이다. 본 논문에서는 질의실행시간최소화를 달성하기 위해 질의를 세분화하여 최적의 데이터베이스 사이트에 할당하는 분석모델을 개발하였으며, 문제해결방법으로 유전자알고리즘을 채택하였다. 총시간최소화 관점에서의 질의실행 계획은 반응시간최소화 관점의 질의실행계획에는 적합하지 않다는 것을 증명하였으며, 그 반대의 경우도 증명하였다. 최대 20개의 조인이 포함되는 질의를 설계하여 시뮬레이션 실험을 통해 테스트를 수행하였고, 유전자알고리즘과 완전한 전수조사와의 결과를 비교함으로써 모든 경우에 유전자알고리즘을 채택한 해결책이 최적의 결과를 도출하였음을 증명하였다.

• 대한산업공학회지
• /
• 제39권6호
• /
• pp.599-608
• /
• 2013

This study is intended to propose optimal maintenance organization to process industry, especially paper industry by analyzing maintenance organization of paper industry and finding out how the maintenance organization and the allocation of maintenance resources influence maintenance performance indices here in this paper. In this study, we analyzed the maintenance organization in detail and studied correlation between maintenance organization and equipment failure rate for the major top six domestic paper-mills in market share. According to the study, the maintenance organization has been changed in accordance with its business environment, but its performance was different by both the allocation way of maintenance resources and the structure of maintenance organization. For paper industry, whose availability is the most important key index that determines the success or failure of a business, it turns out to be the most effective strategy that operates the combination maintenance combined central maintenance with area maintenance and allocates the maintenance resources mainly for preventive maintenance. In particular, it turned out to be that there is the strong positive correlation between the rate of shift workers and the equipment failure rate. The results of this study is not limited to paper industry, but expandable to other industry. So it is expected that the direction of the maintenance organization would be given to the company which is struggling to improve its availability.

• 정보처리학회논문지C
• /
• 제9C권5호
• /
• pp.679-686
• /
• 2002

비디오 서버에서 압축된 형태로 저장된 비디오 데이터를 화질의 저하 없이 클라이언트로 전송하기 위해서는 프레임당 대역폭을 일정하게 조절하는 방법이 필요하다. 이에 스무딩 기법은 프레임당 비트수가 다른 가변 비트율(VBR : Variable Bit Rate)을 가진 비디오 스트림을 일련의 고정된 전송률로 전송하는 방법이다. 본 논문에서는 비디오 서버에 저장된 비디오 스트림을 클라이언트측으로 전송할 경우 최소의 대역폭과 전송률 변화 횟수를 가지며 비디오 서버의 CPU 오버헤드를 최소화하는 스무딩 알고리즘을 제시한다. 제시된 알고리즘의 효용성을 증명하기 위해 기존의 다른 스무딩 알고리즘들과 다양한 환경에서 비친 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권5호
• /
• pp.1973-1991
• /
• 2018

Multimedia applications over wireless networks have been evolving to augmented reality or virtual reality services. However, a rich data size compared to conventional multimedia services causes bandwidth bottlenecks over wireless networks, which is one of the main reasons why those applications are not used widely. To overcome this limitation, bandwidth aggregation techniques, which exploit a multi-path transmission, have been considered to maximize link utilization. Currently, most of the conventional researches have been focusing on the user end problems to improve the quality of service (QoS) through optimal load distribution. In this paper, we address the joint pricing and load distribution problem for multi-homing in heterogeneous wireless access networks (ANs), considering the interests of both the users and the service providers. Specifically, we consider profit from resource allocation and cost of power consumption expenditure for operation as an utility of each service provider. Here, users decide how much to request the resource and how to split the resource over heterogeneous wireless ANs to minimize their cost while supporting the required QoS. Then, service providers compete with each other by setting the price to maximize their utilities over user reactions. We study the behaviors of users and service providers by analyzing their hierarchical decision-making process as a multileader-, multifollower Stackelberg game. We show that both the user and service provider strategies are closed form solutions. Finally, we discuss how the proposed scheme is well converged to equilibrium points.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.2949-2963
• /
• 2019

A novel distributed compress-and-forward (CF) system based on multi-relay network is presented. In this system, as the direct link between the source and destination is invalid due to some reasons, such as the limited power, special working environment, or even economic factors, relays are employed to receive analog signals and carry on distributed compressed encoding. Subsequently, the digital signals are transmitted to the destination via wireless channel. Moreover, a theoretical analysis for the system is provided by utilizing the Chief Executive Officer (CEO) theory and Shannon channel capacity theory, and the rate-distortion function as well as the connection between the transmission rate and the channel capacity are constructed. In addition, an optimal signal-to-noise ratio (SNR) -based power allocation method is proposed to maximize the quantization SNR under the limited total power. Simulation result shows that the proposed CF system outperforms the amplify-and-forward (AF) system versus the SNR performance.