• Title/Summary/Keyword: Non-Cooperative

Search Result 431, Processing Time 0.027 seconds

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
    • /
    • v.2 no.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
    • Journal of the Korean Mathematical Society
    • /
    • v.39 no.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)
    • /
    • v.14 no.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.

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

  • Woo, Kyung-Soo;Cho, Yong-Soo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.40-46
    • /
    • 2007
  • In this paper, the effect of a Doppler Spread caused by a mobile station (MS) is analyzed for transparent mobile multi-hop relays (MMR) systems based on orthogonal frequency division multiplexing (OFDM). The exact expression of interchannel interference (ICI) power and the upper bounds of ICI power are derived for OFDM systems with cooperative MMR or non-coopeartive throughput enhancement (TE) MMR. Also, the exact signal-to-interference ratio (SIR) and its lower bound as well as ICI power and its upper bound, derived in this paper, are evaluated by computer simulation with the OFDM parameter set used for mobile WiMax (WiBro) systems.

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
    • /
    • v.37 no.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 (셀룰러 시스템의 섹터 간 협력 전송 시 최적의 안테나 틸팅 각도 결정 방식)

  • Ko, Jin-Seok;Kim, Jae-Won;Park, Jong-Hyun;Sung, Won-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.7
    • /
    • pp.29-35
    • /
    • 2010
  • The cooperative transmission between sectors in next generation communications standards, e.g., 3GPP LTE-Advanced and IEEE 802.16m, has become an important research issue. Hence methods to decide the optimal antenna tilting angle in cooperative transmission between sectors are needed. This paper proposes methods to decide the optimal antenna tilting angle in cases of non-cooperative and cooperative transmissions between sectors. The proposed methods use an objective function that maximizes the cell average log rate or the cell average rate for users distributed uniformly within the radius of the sector. Also, the objective function which maximizes the cell average rate determined by adaptive modulation and coding (AMC) used in actual cellular systems is considered. When the cell average rate becomes the objective function, the system rate efficiency increases significantly for both cooperative and non-cooperative transmission. When the cell average log rate and the AMC rate become the objective functions, an optimal antenna tilting decision method which effectively increases the efficiency of cell boundary users is discussed.

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
    • /
    • v.26 no.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
    • /
    • v.43 no.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 (고스트들의 협력전술에 의한 팩맨게임 난이도 제고)

  • Choi, Taeyeong;Na, Hyeon-Suk
    • Journal of Korea Game Society
    • /
    • v.15 no.5
    • /
    • pp.89-98
    • /
    • 2015
  • The artificial intelligence (AI) of Non-Player Companions (NPC), especially opponents, is a key element to adjust the level of games in game design. Smart opponents can make games more challenging as well as allow players for diverse experiences, even in the same game environment. Since game users interact with more than one opponent in most of today's games, collaboration control of opponent characters becomes more important than ever before. In this paper, we introduce a cooperative strategy based on the A* algorithm for enemies' AI in the Pac-Man game. A survey from 17 human testers shows that the levels with our collaborative opponents are more difficult but interesting than those with either the original Pac-Man's personalities or the non-cooperative greedy opponents.

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)
    • /
    • v.10 no.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.