• 제목/요약/키워드: Transmission Constraints

검색결과 311건 처리시간 0.051초

Optimal Cooperation and Transmission in Cooperative Spectrum Sensing for Cognitive Radio

  • Zhang, Xian;Wu, Qihui;Li, Xiaoqiang;Yun, Zi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권2호
    • /
    • pp.184-201
    • /
    • 2013
  • In this paper, we study the problem of designing the power and number of cooperative node (CN) in the cooperation phase to maximize the average throughput for secondary user (SU), under the constraint of the total cooperation and transmission power. We first investigate the scheme of cooperative spectrum sensing without a separated control channel. Then, we prove that there indeed exist an optimal CN power when the number of CNs is fixed and an optimal CN number when CN power is fixed. The case without the constraints of the power and number of CN is also studied. Finally, numerical results demonstrate the characteristics and existences of optimal CN power and number. Meanwhile, Monte Carlo simulation results match to the theoretical results well.

Scheduling and Power Control Framework for Ad hoc Wireless Networks

  • Casaquite, Reizel;Yoon, Myung-Hyun;Hwang, Won-Joo
    • 한국멀티미디어학회논문지
    • /
    • 제10권6호
    • /
    • pp.745-753
    • /
    • 2007
  • The wireless medium is known to be time-varying which could affect and result to a poor network's performance. As a solution, an opportunistic scheduling and power control algorithm based on IEEE 802.11 MAC protocol is proposed in this paper. The algorithm opportunistically exploits the channel condition for better network performance. Convex optimization problems were also formulated i.e. the overall transmission power of the system is minimized and the "net-utility" of he system is maximized. We have proven that an optimal transmission power vector may exist, satisfying the maximum power and SINR constraints at all receivers, thereby minimizing overall transmission power and maximizing net-utility of the system.

  • PDF

최근 국내전력계통 계통제약 발생현황 및 증가원인 분석 (The Recent Trend of Constraints in Korea Power System and Analysis of the Cause of its Increasing)

  • 심정운;방민재;이진문
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 하계학술대회 논문집 A
    • /
    • pp.3-6
    • /
    • 2004
  • 전력시장에서 예비력, 송전망 설비 유한성, 열병합발전소 열공급, 수요예측 오차, LNG, 국내무연탄의 우선소비 정책 둥에 의해 경제급전 원칙을 완벽하게 지킬 수 없다. 이로 인하여 고연료비 발전기가 제약에 의해 운전될 수밖에 없고 이 제약발전에 의해 시장가격이 상승하고 소비자 입장에서 보면 전력구입비용이 증가하게 된다. 이 논문에서는 2002, 2003년도 국내전력계통에서 발생한 계통제약 발생현황을 지역별, 월별로 분석하고 2002년 대비 2003계통제약 증가원인을 분석하였다.

  • PDF

Protecting Multicast Sessions in WDM Networks with Sparse-Splitting Constraints

  • Wang, Xiong;Wang, Sheng;Li, Lemin
    • ETRI Journal
    • /
    • 제29권4호
    • /
    • pp.524-526
    • /
    • 2007
  • In this letter, we study the multicast protection problem in sparse-splitting wavelength-division multiplexing (WDM) optical network, and propose a novel multicast protection algorithm called the shared source-leaf path-based protection (SLPP) algorithm. Unlike the proposals in previous studies, the backup paths derived by SLPP can share wavelength with the primary tree in sparse-splitting WDM networks. Simulations are used to evaluate the effectiveness of the SLPP algorithm.

  • PDF

A GTS Scheduling Algorithm for Voice Communication over IEEE 802.15.4 Multihop Sensor Networks

  • Kovi, Aduayom-Ahego;Bleza, Takouda;Joe, Inwhee
    • International journal of advanced smart convergence
    • /
    • 제1권2호
    • /
    • pp.34-38
    • /
    • 2012
  • The recent increase in use of the IEEE 802.15.4 standard for wireless connectivity in personal area networks makes of it an important technology for low-cost low-power wireless personal area networks. Studies showed that voice communications over IEEE 802.15.4 networks is feasible by Guaranteed Time Slot (GTS) allocation; but there are some constraints to accommodate voice transmission beyond two hops due to the excessive transmission delay. In this paper, we propose a GTS allocation scheme for bidirectional voice traffic in IEEE 802.15.4 multihop networks with the goal of achieving fairness and optimization of resource allocation. The proposed scheme uses a greedy algorithm to allocate GTSs to devices for successful completion of voice transmission with efficient use of bandwidth while considering closest devices with another factor for starvation avoidance. We analyze and validate the proposed scheme in terms of fairness and resource optimization through numeral analysis.

On the Fairness of the Multiuser Eigenmode Transmission System

  • Xu, Jinghua;Zhou, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권6호
    • /
    • pp.1101-1112
    • /
    • 2011
  • The Multiuser Eigenmode Transmission (MET) has generated significant interests in literature due to its optimal performance in linear precoding systems. The MET can simultaneously transmit several spatial multiplexing eigenmodes to multiple users which significantly enhance the system performance. The maximum number of users that can be served simultaneously is limited due to the constraints on the number antennas, and thus an appropriate user selection is critical to the MET system. Various algorithms have been developed in previous works such as the enumerative search algorithm. However, the high complexities of these algorithms impede their applications in practice. In this paper, motivated by the necessity of an efficient and effective user selection algorithm, a low complexity recursive user selection algorithm is proposed for the MET system. In addition, the fairness of the MET system is improved by using the combination of the proposed user selection algorithm and the adaptive Proportional Fair Scheduling (PFS) algorithm. Extensive simulations are implemented to verify the efficiency and effectiveness of the proposed algorithm.

분기 한정법에 의한 송전계통의 확충 계획 (Transmission System Expansion Planning Using Branch and Bound)

  • 트란트룬 틴;강성록;김근호;이지훈;최재석
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 하계학술대회 논문집 A
    • /
    • pp.46-49
    • /
    • 2003
  • This paper proposes a method to solve expansion problem for a transmission network, given future generation and load strategy, and alternative types of lines available, subject to load, reliability and right of way constraints, the problem is formulated as a series of zero one integer programs which are solved by an efficient branch and bound algorithm A study test result on the 63-buses test system shows that the proposed method is practical and efficiently applicable to the transmission expansion planning.

  • PDF

온라인 발전계획을 위한 강건한 경제급전 알고리즘 (A Robust Algorithm for On-line Economic Dispatch)

  • 송경빈;한승수
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 하계학술대회 논문집 C
    • /
    • pp.1111-1113
    • /
    • 1998
  • A robust economic dispatch algorithm involving transmission losses is proposed and investigated for a possibility of on-line applications. In this paper, the penalty factors are calculated directly from transposed Jacobian of load flow analysis with advantages of superiority to B-coefficients method based on its computation time and suitability for real time application since the approach is based on a current system condition. The proposed algorithm is systematically handling the generation capacity constraints with transmission losses. Implementation of the algorithm for IEEE systems and EPRI Scenario systems shows that computation time is enough to apply on-line economic dispatch to large power system and production cost is saved compared with the crude classical economic dispatch algorithm without considering transmission losses.

  • PDF

다자게임 전력시장에서 송전선 혼잡시의 복합전략 내쉬균형 계산 (Solving Mixed Strategy Equilibria of Multi-Player Games with a Transmission Congestion)

  • 이광호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제55권11호
    • /
    • pp.492-497
    • /
    • 2006
  • Nash Equilibrium (NE) is essential to investigate a participant's bidding strategy in a competitive electricity market. The transmission line constraints make it difficult to compute the NE due to causing a mixed strategy NE instead of a pure strategy NE. Computing a mixed strategy is more complicated in a multi-player game. The competition among multi-participants is modeled by a two-level hierarchical optimization problem. A mathematical programming approach is widely used in finding this equilibrium. However, there are difficulties to solving a mixed strategy NE. This paper presents two propositions to add heuristics to the mathematical programming method. The propositions are based on empirical studies on mixed strategies in numerous sample systems. Based on the propositions a new formulation is provided with a set of linear and nonlinear equations, and an algorithm is suggested for using the prepositions and the newly-formulated equations.

반응표면법을 이용한 헬리컬기어 치형수정의 최적화 (Optimization of the Tooth Surface in the Helical Gears Using a Response Surface Method)

  • 박찬일
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2005년도 추계학술대회논문집
    • /
    • pp.760-763
    • /
    • 2005
  • Optimum design of the tooth surface for the reduction of transmission error is very difficult to determine analytically due to nonlinearity of transmission error under the several load condition. The design of tooth surface that can give a low noise under the various load condition is very important. Therefore, this study proposes the method to determine the optimal lead curve and robust design of the tooth surface by using the response surface method. To do so, the design variables are selected by a screening experiment. Then the fitted regression model Is built with the check of the usefulness of the model. The model with constraints is solved to obtain the optimum values for the lead curve and the robust design fur the tooth surface.

  • PDF