• International Journal of Contents
• /
• 제12권1호
• /
• pp.70-75
• /
• 2016

In this paper, we considered heterogeneous spectrum sharing system where the number of subcarriers of the primary user (PU) was twice as much as that of the secondary user (SU). In this case, due to non-orthogonality and inter-carrier interference (ICI) from SU to PU, it is difficult to satisfy the interference constraint of PU. In order to mitigate ICI and satisfy the interference constraint, we proposed a new transmission scheme of the SU with power allocation scheme. The proposed scheme will only generate subcarrier-by-subcarrier interference. Therefore, it can easily satisfy the interference constraint of the PR and enhance the capacity of the SU. In addition, we derived the ergodic capacity of the SU. Based on numerical results, we confirmed that the proposed schemes could guarantee SU with a reliable capacity while satisfying the interference constraint of the PU. In addition, the derived capacity well matched the numerical results.

• 한국경영과학회지
• /
• 제31권2호
• /
• pp.99-112
• /
• 2006

In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase amount constraint. And also, if we order at a certain date which was set by administrative convenience, we have capacity constraint to order the consolidated order demands (capacity constraint). We show this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invent a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.632-650
• /
• 2013

The paper considers a spectrum sharing cognitive radio (CR) network coexisting with a primary network under the average interference power constraint. In particular, the secondary user (SU) is assumed to carry delay-sensitive services and thus shall satisfy a given delay quality-of-service (QoS) constraint. The secondary receiver is also assumed to be equipped with multiple antennas to perform maximal ratio combining (MRC) to enhance SU performance. We investigate the effective capacity of the SU with MRC diversity under aforementioned constraints in Nakagami fading environments. Particularly, we derive the optimal power allocation to achieve the maximum effective capacity of the SU, and further derive the effective capacity in closed-form. In addition, we further obtain the closed-form expressions for the effective capacities under three widely used power and rate adaptive transmission schemes, namely, optimal simultaneous power and rate adaptation (opra), truncated channel inversion with fixed rate (tifr) and channel inversion with fixed rate without truncation (cifr). Numerical results supported by simulations are presented to consolidate our studies. The impacts on the effective capacity of various system parameters such as the number of antennas, the average interference power constraint and the delay QoS constraint are investigated in detail. It is shown that MRC diversity can significantly improve the effective capacity of the SU especially for cifr transmission scheme.

• Journal of electromagnetic engineering and science
• /
• 제10권3호
• /
• pp.99-103
• /
• 2010

Motivated by recent works on spectrum-sharing systems, this paper investigates the effects of transmit diversity on the peak interference power limited cognitive radio(CR) networks. In particular, we derive the ergodic and outage capacities of a spectrum-sharing system with multiple transmit-antennas. To derive the capacities, peak interference power constraint is imposed to protect the primary receiver. In a CR transmitter and receiver pair with multiple antennas at the transmitter side, the allowable transmit power is distributed over the transmit-antennas to achieve transmit diversity at the receiver. We investigate the effect of this power distribution when a peak interference power constraint is imposed to protect the primary receiver. We show that the transmit diversity does not improve the ergodic capacity compared to the single-antenna system. On the other hand, the transmit diversity significantly improves the outage capacity. For example, two transmit-antennas improve the outage capacity 10 times compared to the single-antenna with a 0 dB interference constraint.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.10-26
• /
• 2005

In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase constraint. And also, if we order at a certain date which was set by administrative convenience, we have amount constraint to order the consolidated order demands (capacity constraint). We showed this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invented a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

• Structural Engineering and Mechanics
• /
• 제47권1호
• /
• pp.131-147
• /
• 2013

In this paper, constraint-based fracture mechanics analyses of hollow cylinders with internal circumferential crack under tensile loading are conducted. Finite element analyses of the cracked cylinders are carried out to determine the fracture parameters including elastic T-stresses, and fully-plastic J-integrals. Linear elastic finite element analysis is conducted to obtain the T-stresses, and elastic-plastic analysis is conducted to obtain the fully plastic J-integrals. A wide range of cylinder geometries are studied, with cylinder radius ratios of $r_i/r_o$ = 0.2 to 0.8 and crack depth ratio a/t = 0.2 to 0.8. Fully plastic J-integrals are obtained for Ramberg-Osgood power law hardening material of n = 3, 5 and 10. These fracture parameters are then used to construct conventional and constraint-based failure assessment diagrams (FADs) to determine the maximum load carrying capacity of cracked cylinders. It is demonstrated that these tensile loaded cylinders with circumferential cracks are under low constraint conditions, and the load carrying capacity are higher when the low constraint effects are properly accounted for, using constraint-based FADs, comparing to the predictions from the conventional FADs.

• Journal of electromagnetic engineering and science
• /
• 제11권2호
• /
• pp.128-132
• /
• 2011

In interference tolerance based spectrum sharing systems, primary receivers (PRs) are protected by a predefined peak or average interference power constraint. To implement such systems, cognitive radio (CR) transmitters are required to adjust their transmit power so that the interference power received at the PR receivers is kept below the threshold value. Hence, a CR-transmitter requires knowledge of its channel and the primary receiver in order to allocate the transmit power. In practice, it is impossible or very difficult for a CR transmitter to have perfect knowledge of this channel state information (CSI). In this paper, we investigate the impact of imperfect knowledge of this CSI on the performances of both a primary and cognitive radio network. For fixed transmit power, average interference power (AIP) constraint can be maintained through knowledge of the channel distribution information. To maintain the peak interference power (PIP) constraint, on the other hand, the CR-transmitter requires the instantaneous CSI of its channel with the primary receiver. First, we show that, compared to the PIP constraint with perfect CSI, the AIP constraint is advantageous for primary users but not for CR users. Then, we consider a PIP constraint with imperfect CSI at the CR-transmitter. We show that inaccuracy in CSI reduces the interference at the PR-receivers that is caused by the CR-transmitter. Consequently the proposed schemes improve the capacity of the primary links. Contrarily, the capacities of the CR links significantly degrade due to the inaccuracy in CSI.

• 대한전자공학회논문지TC
• /
• 제49권8호
• /
• pp.39-45
• /
• 2012

본 논문에서는 주파수 공유 환경에서 일차 사용자가 양방향 중계기 (full duplex relay, FDR)를 사용하는 경우의 이차 사용자의 통신 용량에 대해서 분석한 논문이다. 주파수 공유 시스템에서, 이차 사용자가 일차 사용자의 주파수를 공유하기 위해서는 다양한 일차 사용자의 시스템에 맞는 주파수 공유 기법이 연구되어야 한다. 그러나 기존의 연구들은 오직 일대일 통신 기반의 일차 사용자 시스템만을 고려하였다. 일차 사용자가 FDR을 사용할 때는 일차 사용자의 중계기와 목적지가 이차 사용자로부터 동시에 간섭을 받게 된다. 따라서 기존의 일대일 통신 기반의 주파수 공유 기법 보다 좀 더 엄격한 간섭 제약이 적용되어야 한다. 따라서 본 논문에서는 일차 사용자가 FDR을 사용하는 주파수 공유 시스템에서 평균 및 순시 간섭 파워 제약 조건 하에서의 이차 사용자의 통신 용량을 분석한다. 또한 이러한 시스템에서 간섭 제약을 고려했을 때의 성능 열화를 분석한다. 모의 실험 결과를 통해서 평균 간섭 파워 제약 조건 하에서의 이차 사용자 통신 용량과 일차 사용자의 통신 용량이 순시 간섭 파워 제약 조건 하에서의 통신용량보다 성능이 좋음을 확인하였다.

• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.286-295
• /
• 2012

To meet the increased demand of video-on-demand (VoD) services, peer-to-peer (P2P) mesh-based multiple video approaches have been recently proposed, where each peer is able to find a video segment interested without resort to the video server. However, they have not considered the constraint of the server's upload bandwidth and the fairness between upload and download amounts at each peer. In this paper, we propose a novel P2P VoD streaming system, named peer cache adaptation (PECAN) where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Against the proposed design objective, some selfish peers may not follow our protocol to increase their payoff. To detect such peers, we design a simple distributed reputation and monitoring system. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer. We finally verify that the control overhead in PECAN caused by the search, reputation, and monitoring systems is very small, which is an important factor for real deployment.

• Industrial Engineering and Management Systems
• /
• 제11권2호
• /
• pp.170-175
• /
• 2012

In this paper, a procedure using a genetic algorithm (GA) and a heuristic local search (HLS) is proposed for solving facility rearrangement problem (FRP). FRP is a decision problem for stopping/running of facilities and integration of stopped facilities to running facilities to maximize the production capacity of running facilities under the cost constraint. FRP is formulated as an integer programming model for maximizing the total production capacity under the constraint of the total facility operating cost. In the cases of 90 percent of cost constraint and more than 20 facilities, the previous solving method was not effective. To find effective alternatives, this solving procedure using a GA and a HLS is developed. Stopping/running of facilities are searched by GA. The shifting the production operation of stopped facilities into running facilities is searched by HLS, and this local search is executed for one individual in this GA procedure. The effectiveness of the proposed procedure using a GA and HLS is demonstrated by numerical experiment.