• 제목/요약/키워드: Non-Cooperative

검색결과 432건 처리시간 0.024초

Hybrid TOA/AOA Cooperative Mobile Localization in 4G Cellular Networks

  • Wu, Shixun;Wang, Shuliang;Xu, Kai;Wang, Honggang
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제2권2호
    • /
    • pp.77-85
    • /
    • 2013
  • this study examined hybrid Time of Arrival/Angle of Arrival (TOA/AOA) localization technique in a cellular network. Based on the linearized equations from the TOA and AOA measurements, the weighted least square (WLS) method is proposed to obtain the location estimation of a mobile station (MS) by analyzing the statistical properties of the error vector in Line of Sight (LOS) and Non-line of Sight (NLOS) environments, respectively. Moreover, the precise expression of the Cramer-Rao lower bound (CRLB) for hybrid TOA/AOA measurements in different LOS/NLOS conditions was derived when the LOS error is a Gaussian variable and the NLOS error is an exponential variable. The idea of cooperative localization is proposed based on the additional information from short-range communication among the MSs in fourth generation (4G) cellular networks. Therefore, the proposed hybrid TOA/AOA WLS method can be improved further with the cooperative scheme. The simulation results show that the hybrid TOA/AOA method has better performance than the TOA only method, particularly when the AOA measurements are accurate. Moreover, the performance of the hybrid TOA/AOA method can be improved further by the cooperative scheme.

  • PDF

ON A TIME-CONSISTENT SOLUTION OF A COOPERATIVE DIFFERENTIAL TIME-OPTIMAL PURSUIT GAME

  • Kwon, O-Hun;Svetlana, Tarashinina
    • 대한수학회지
    • /
    • 제39권5호
    • /
    • pp.745-764
    • /
    • 2002
  • In this paper we Study a time-optimal model of pursuit in which the players move on a plane with bounded velocities. This game is supposed to be a nonzero-sum group pursuit game. The main point of the work is to construct and compare cooperative and non-cooperative solutions in the game and make a conclusion about cooperation possibility in differential pursuit games. We consider all possible cooperations of the players in the game. For that purpose for every game $\Gamma(x_0,y_0,z_0)$ we construct the corresponding game in characteristic function form $\Gamma_v(x_0,y_0,z_0)$. We show that in this game there exists the nonempty core for any initial positions of the players. The core can take four various forms depending on initial positions of the players. We study how the core changes when the game is proceeding. For the original agreement (an imputation from the original core) to remain in force at each current instant t it is necessary for the core to be time-consistent. Nonemptiness of the core in any current subgame constructing along a cooperative trajectory and its time-consistency are shown. Finally, we discuss advantages and disadvantages of choosing this or that imputation from the core.

Resource allocation in downlink SWIPT-based cooperative NOMA systems

  • Wang, Longqi;Xu, Ding
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권1호
    • /
    • pp.20-39
    • /
    • 2020
  • This paper considers a downlink multi-carrier cooperative non-orthogonal multiple access (NOMA) transmission, where no direct link exists between the far user and the base station (BS), and the communication between them only relies on the assist of the near user. Firstly, the BS sends a superimposed signal of the far and the near user to the near user, and then the near user adopts simultaneous wireless information and power transfer (SWIPT) to split the received superimposed signal into two portions for energy harvesting and information decoding respectively. Afterwards, the near user forwards the signal of the far user by utilizing the harvested energy. A minimum data is required to ensure the quality of service (QoS) of the far user. We jointly optimize power allocation, subcarrier allocation, time allocation, the power allocation (PA) coefficient and the power splitting (PS) ratio to maximize the number of data bits received at the near user under the energy causality constraint, the minimum data constraint and the transmission power constraint. The block-coordinate descent method and the Lagrange duality method are used to obtain a suboptimal solution of this optimization problem. In the final simulation results, the superiority of the proposed NOMA scheme is confirmed compared with the benchmark NOMA schemes and the orthogonal multiple access (OMA) scheme.

OFDM 기반의 트랜스패런트 다중 홉 릴레이 시스템에서 도플러 확산의 영향 분석 (An Analysis of the Effect of Doppler Spread on Transparent Multi-hop Relays Systems Based on OFDM)

  • 우경수;조용수
    • 대한전자공학회논문지TC
    • /
    • 제44권5호
    • /
    • pp.40-46
    • /
    • 2007
  • 본 논문에서는 OFDM(Orthogonal Frequency Division Multiplexing) 기반의 트랜스패런트(transparent) 이동 다중 홉 릴레이(mobile multi-hop relay; MMR)시스템에서 MS(Mobile Station)가 이동함에 따라 발생하는 도플러 확산(Doppler spread)에 대한 영향을 분석한다. 상호협력(cooperative) MMR 또는 비상호협력(non-cooperative) 수율 증가(throughput enhancement;TE) MMR을 갖는 OFDM 시스템에서 부채널간 간섭(interchannel interference; ICI) 전력과 ICI 전력의 상계(upper bound)를 유도한다. 또한, 신호 대 간섭비(signal-to-interference ratio; SIR)와 SIR의 하계(lower bound)를 유도하고, WiBro(mobile WiMAX)용 파라미터를 이용하여 모의 실험을 통해 유도 결과를 검증한다.??

Unfolding of Ervatamin C in the Presence of Organic Solvents: Sequential Transitions of the Protein in the O-state

  • Sundd, Monica;Kundu, Suman;Dubey, Vikash Kumar;Jagannadham, Medicherla V.
    • BMB Reports
    • /
    • 제37권5호
    • /
    • pp.586-596
    • /
    • 2004
  • The folding of ervatamin C was investigated in the presence of various fluorinated and non-fluorinated organic solvents. The differences in the unfolding of the protein in the presence of various organic solvents and the stabilities of O-states were interpreted. At pH 2.0, non-fluorinated alkyl alcohols induced a switch from the native $\alpha$-helix to a $\beta$-sheet, contrary to the $\beta$-sheet to $\alpha$-helix conversion observed for many proteins. The magnitude of ellipticity at 215 nm, used as a measure of $\beta$-content, was found to be dependent on the concentration of the alcohol. Under similar conditions of pH, fluorinated alcohol enhanced the intrinsic a-helicity of the protein molecule, whereas the addition of acetonitrile reduced the helical content. Ervatamin C exhibited high stability towards GuHCl induced unfolding in different O-states. Whereas the thermal unfolding of O-states was non-cooperative, contrary to the cooperativity seen in the absence of the organic solvents under similar conditions. Moreover, the differential scanning calorimetry endotherms of the protein acquired at pH 2.0 were deconvoluted into two distinct peaks, suggesting two cooperative transitions. With increase in pH, the shape of the thermogram changed markedly to exhibit a major and a minor transition. The appearance of two distinct peaks in the DSC together with the non-cooperative thermal transition of the protein in O-states indicates that the molecular structure of ervatamin C consists of two domains with different stabilities.

셀룰러 시스템의 섹터 간 협력 전송 시 최적의 안테나 틸팅 각도 결정 방식 (On Optimal Antenna Tilting Angles for Cooperative Transmissions Between Sectors in Cellular Systems)

  • 고진석;김재원;박종현;성원진
    • 대한전자공학회논문지TC
    • /
    • 제47권7호
    • /
    • pp.29-35
    • /
    • 2010
  • 최근 3GPP LTE-Advanced 및 IEEE 802.16m과 같은 차세대 통신 규격에서 섹터 간 협력 전송이 중요 연구주제가 되었고, 그에 따라 기존 비협력 전송에서와 마찬가지로 섹터 간 협력 전송 시에도 최적의 안테나 틸팅 각도를 결정하는 방식의 필요성이 대두되고 있다. 본 논문에서는 섹터 간 협력 전송 및 비협력 전송 시 최적의 안테나 틸팅 각도를 결정하는 방식들을 제안한다. 제안하는 방식은 섹터 반경 내에 동일하게 분포하는 사용자의 전송률 평균인 셀 평균 전송률 또는 셀 평균 로그 전송률을 최대화하는 목적함수를 활용한다. 또한 이론적 용량인 Shannon 전송률 대신 실제 셀룰러 시스템에서 활용되는 AMC (adaptive modulation and coding) 방식을 고려한 셀 평균 AMC 전송률을 최대화하는 목적함수도 함께 활용한다. 협력 및 비협력 전송 시 셀 평균 전송률을 목적함수로 고려하는 경우에는 시스템 전송 효율성을 최대화 하며, 셀 평균 로그 전송률 및 AMC를 목적함수로 활용하는 경우에는 특히 셀 경계 사용자의 전송 효율성 증대를 크게 반영하는 최적의 안테나 틸팅 각도를 결정하는 방식을 제시한다.

GAME MODEL AND ITS SOLVING METHOD FOR OPTIMAL SCALE OF POWER PLANTS ENTERING GENERATION POWER MARKET

  • Tan, Zhongfu;Chen, Guangjuan;Li, Xiaojun
    • Journal of applied mathematics & informatics
    • /
    • 제26권1_2호
    • /
    • pp.337-347
    • /
    • 2008
  • Based on social welfare maximum theory, the optimal scale of power plants entering generation power market being is researched. A static non-cooperative game model for short-term optimization of power plants with different cost is presented. And the equilibrium solutions and the total social welfare are obtained. According to principle of maximum social welfare selection, the optimization model is solved, optimal number of power plants entering the market is determined. The optimization results can not only increase the customer surplus and improve power production efficiency, but also sustain normal profits of power plants and scale economy of power production, and the waste of resource can also be avoided. At last, case results show that the proposed model is efficient.

  • PDF

Power allocation-Assisted secrecy analysis for NOMA enabled cooperative network under multiple eavesdroppers

  • Nayak, V. Narasimha;Gurrala, Kiran Kumar
    • ETRI Journal
    • /
    • 제43권4호
    • /
    • pp.758-768
    • /
    • 2021
  • In this work, the secrecy of a typical wireless cooperative dual-hop non-orthogonal multiple access (NOMA)-enabled decode-and-forward (DF) relay network is investigated with the impact of collaborative and non-collaborative eavesdropping. The system model consists of a source that broadcasts the multiplexed signal to two NOMA users via a DF relay, and information security against the eavesdropper nodes is provided by a helpful jammer. The performance metric is secrecy rate and ergodic secrecy capacity is approximated analytically. In addition, a differential evolution algorithm-based power allocation scheme is proposed to find the optimal power allocation factors for relay, jammer, and NOMA users by employing different jamming schemes. Furthermore, the secrecy rate analysis is validated at the NOMA users by adopting different jamming schemes such as without jamming (WJ) or conventional relaying, jamming (J), and with control jamming (CJ). Simulation results demonstrate the superiority of CJ over the J and WJ schemes. Finally, the proposed power allocation outperforms the fixed power allocation under all conditions considered in this work.

고스트들의 협력전술에 의한 팩맨게임 난이도 제고 (Making Levels More Challenging with a Cooperative Strategy of Ghosts in Pac-Man)

  • 최태영;나현숙
    • 한국게임학회 논문지
    • /
    • 제15권5호
    • /
    • pp.89-98
    • /
    • 2015
  • NPC, 특히 적 캐릭터들의 인공지능은 게임의 설계 단계에 있어 난이도를 조절하기 위해 핵심적인 요소이다. 지능적인 적들은 게임을 보다 도전적으로 만들 뿐 아니라, 동일한 게임 환경에서도 유저들에게 다양한 경험을 제공할 수 있다. 오늘날 대부분의 게임 유저들은 다수의 적들과 상호작용을 하기 때문에, 적 캐릭터들의 협업을 제어하는 것은 이전 어느 때보다 그 중요성이 크다고 할 수 있다. 본 연구는 팩맨 게임의 적 인공지능에 구현될 수 있는 A* 알고리즘 기반의 협력전술을 제안한다. 17명의 피실험자로부터 얻은 설문 결과는 제안된 협력전술을 따르는 적으로 구성된 레벨이, 기존 팩맨게임에서의 적들 또는 비협력적인 적들로 구성된 레벨들보다 더 어렵고 흥미로웠음을 보여준다.

Conflicts in Overlay Environments: Inefficient Equilibrium and Incentive Mechanism

  • Liao, Jianxin;Gong, Jun;Jiang, Shan;Li, Tonghong;Wang, Jingyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.2286-2309
    • /
    • 2016
  • Overlay networks have been widely deployed upon the Internet by Service Providers (SPs) to provide improved network services. However, the interaction between each overlay and traffic engineering (TE) as well as the interaction among co-existing overlays may occur. In this paper, we adopt both non-cooperative and cooperative game theory to analyze these interactions, which are collectively called hybrid interaction. Firstly, we model a situation of the hybrid interaction as an n+1-player non-cooperative game, in which overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE) for this game. Secondly, we model another situation of the hybrid interaction as a 1-leader-n-follower Stackelberg-Nash game, in which TE is the leader and co-existing overlays are followers, and prove that the cost at Stackelberg-Nash equilibrium (SNE) is at least as good as that at NE for TE. Thirdly, we propose a cooperative coalition mechanism based on Shapley value to overcome the inherent inefficiency of NE and SNE, in which players can improve their performance and form stable coalitions. Finally, we apply distinct genetic algorithms (GA) to calculate the values for NE, SNE and the assigned cost for each player in each coalition, respectively. Analytical results are confirmed by the simulation on complex network topologies.