The Experts below are selected from a list of 321 Experts worldwide ranked by ideXlab platform
Byeong Gi Lee - One of the best experts on this subject based on the ideXlab platform.
-
a resource allocation with balanced data throughput and power consumption under qos constraint in mimo interference systems a Noncooperative Game approach
International Conference on Communications, 2008Co-Authors: Hojoong Kwon, Byeong Gi LeeAbstract:In this paper, we investigate resource allocation in MIMO interference systems where multiple MIMO links share the same frequency band and interfere with each other. For MIMO transmission scheme, we consider a spatial multiplexing scheme that uses linear precoder and decoder. We impose the SINR constraint that the received SINR of each data sub-stream should be larger than a predetermined threshold, and the QoS constraint that the data throughput of individual link should be larger than a required level. In this system, a trade-off exists between the data throughput and the power consumption due to the co-channel interference among the multiple MIMO links. So we arrange a new resource allocation algorithm such that the data throughput and the power consumption are balanced and the QoS constraint is met for each link. We model the resource allocation problem as a Noncooperative Game and devise a distributed resource allocation algorithm in which the constituent links find a Nash equilibrium point without coordination. The proposed algorithm turns out to perform close to the optimal point achieved by centralized optimization.
-
ICC - A Resource Allocation with Balanced Data Throughput and Power Consumption under QoS Constraint in MIMO Interference Systems: A Noncooperative Game Approach
2008 IEEE International Conference on Communications, 2008Co-Authors: Hojoong Kwon, Byeong Gi LeeAbstract:In this paper, we investigate resource allocation in MIMO interference systems where multiple MIMO links share the same frequency band and interfere with each other. For MIMO transmission scheme, we consider a spatial multiplexing scheme that uses linear precoder and decoder. We impose the SINR constraint that the received SINR of each data sub-stream should be larger than a predetermined threshold, and the QoS constraint that the data throughput of individual link should be larger than a required level. In this system, a trade-off exists between the data throughput and the power consumption due to the co-channel interference among the multiple MIMO links. So we arrange a new resource allocation algorithm such that the data throughput and the power consumption are balanced and the QoS constraint is met for each link. We model the resource allocation problem as a Noncooperative Game and devise a distributed resource allocation algorithm in which the constituent links find a Nash equilibrium point without coordination. The proposed algorithm turns out to perform close to the optimal point achieved by centralized optimization.
-
distributed resource allocation through Noncooperative Game approach in multi cell ofdma systems
International Conference on Communications, 2006Co-Authors: Hojoong Kwon, Byeong Gi LeeAbstract:In this paper, we present a distributed resource allocation algorithm for multi-cell OFDMA systems by adopting a Game theoretic approach. We first define a utility function that can represent the system performance while taking into account the co-channel interference among cells. Then we model resource allocation problem as a Noncooperative Game. Based on the Game, we devise a iterative algorithm called DRA that requires no coordination among the base stations. We prove that there exists a Nash equilibrium for the Game and the equilibrium is unique in some constrained environment. The proposed DRA algorithm turns out to converge to the equilibrium within a small number of iterations.
-
ICC - Distributed Resource Allocation through Noncooperative Game Approach in Multi-cell OFDMA Systems
2006 IEEE International Conference on Communications, 2006Co-Authors: Hojoong Kwon, Byeong Gi LeeAbstract:In this paper, we present a distributed resource allocation algorithm for multi-cell OFDMA systems by adopting a Game theoretic approach. We first define a utility function that can represent the system performance while taking into account the co-channel interference among cells. Then we model resource allocation problem as a Noncooperative Game. Based on the Game, we devise a iterative algorithm called DRA that requires no coordination among the base stations. We prove that there exists a Nash equilibrium for the Game and the equilibrium is unique in some constrained environment. The proposed DRA algorithm turns out to converge to the equilibrium within a small number of iterations.
Vadim V. Romanuke - One of the best experts on this subject based on the ideXlab platform.
-
Sampling Individually Fundamental Simplexes as Sets of Players’ Mixed Strategies in Finite Noncooperative Game for Applicable Approximate Nash Equilibrium Situations with Possible Concessions
Journal of information and organizational sciences, 2016Co-Authors: Vadim V. RomanukeAbstract:In finite Noncooperative Game, a method for finding approximate Nash equilibrium situations is developed. The method is prior-based on sampling fundamental simplexes being the sets of players’ mixed strategies. Whereas the sampling is exercised, the sets of players’ mixed strategies are mapped into finite lattices. Sampling steps are envisaged dissimilar. Thus, each player within every dimension of its simplex selects and controls one’s sampling individually. For preventing approximation low quality, however, sampling steps are restricted. According to the restricted sampling steps, a player acting singly with minimal spacing over its lattice cannot change payoff of any player more than by some predetermined magnitude, being specific for each player. The finite lattice is explicitly built by the represented routine, where the player’s mixed strategies are calculated and arranged. The product of all the players’ finite lattices approximates the product of continuous fundamental simplexes. This re-defines the finite Noncooperative Game in its finite mixed extension on the finite lattices’ product. In such a finite-mixed-extension-defined Game, the set of Nash equilibrium situations may be empty. Therefore, approximate Nash equilibrium situations are defined by the introduced possible payoff concessions. A routine for finding approximate equilibrium situations is represented. Approximate strong Nash equilibria with possible concessions are defined, and a routine for finding them is represented as well. Acceleration of finding approximate equilibria is argued also. Finally, the developed method is discussed to be a basis in stating a universal approach for the finite Noncooperative Game solution approximation implying unification of the Game solvability, applicability, realizability, and adaptability.
-
Uniform Sampling of the Infinite Noncooperative Game on Unit Hypercube and Reshaping Ultimately Multidimensional Matrices of Player’s Payoff Values
Electrical Control and Communication Engineering, 2015Co-Authors: Vadim V. RomanukeAbstract:There is suggested a method of obtaining the approximate solution of the infinite Noncooperative Game on the unit hypercube. The method is based on sampling uniformly the players’ payoff functions with the constant step along each of the hypercube dimensions. There are stated conditions for the sufficiently accurate sampling. There is suggested a method of reshaping the multidimensional matrix of the player’s payoff values, being the former player’s payoff function before its sampling, into a matrix with minimally possible number of dimensions, where also maintenance of one-to-one indexing has been provided. Requirements for finite NE-strategy from NE-solution of the finite Game as the initial infinite Game approximation are given as definitions of the approximate solution consistency. The approximate solution consistency ensures its relative independence upon the sampling step within its minimal neighborhood or the minimally decreased sampling step. The ultimate reshaping of multidimensional matrices of players’ payoff values to the minimal number of dimensions, being equal to the number of players, stimulates shortened computations.
-
uniform sampling of the infinite Noncooperative Game on unit hypercube and reshaping ultimately multidimensional matrices of player s payoff values
Electrical Control and Communication Engineering, 2015Co-Authors: Vadim V. RomanukeAbstract:There is suggested a method of obtaining the approximate solution of the infinite Noncooperative Game on the unit hypercube. The method is based on sampling uniformly the players’ payoff functions with the constant step along each of the hypercube dimensions. There are stated conditions for the sufficiently accurate sampling. There is suggested a method of reshaping the multidimensional matrix of the player’s payoff values, being the former player’s payoff function before its sampling, into a matrix with minimally possible number of dimensions, where also maintenance of one-to-one indexing has been provided. Requirements for finite NE-strategy from NE-solution of the finite Game as the initial infinite Game approximation are given as definitions of the approximate solution consistency. The approximate solution consistency ensures its relative independence upon the sampling step within its minimal neighborhood or the minimally decreased sampling step. The ultimate reshaping of multidimensional matrices of players’ payoff values to the minimal number of dimensions, being equal to the number of players, stimulates shortened computations.
Hojoong Kwon - One of the best experts on this subject based on the ideXlab platform.
-
a resource allocation with balanced data throughput and power consumption under qos constraint in mimo interference systems a Noncooperative Game approach
International Conference on Communications, 2008Co-Authors: Hojoong Kwon, Byeong Gi LeeAbstract:In this paper, we investigate resource allocation in MIMO interference systems where multiple MIMO links share the same frequency band and interfere with each other. For MIMO transmission scheme, we consider a spatial multiplexing scheme that uses linear precoder and decoder. We impose the SINR constraint that the received SINR of each data sub-stream should be larger than a predetermined threshold, and the QoS constraint that the data throughput of individual link should be larger than a required level. In this system, a trade-off exists between the data throughput and the power consumption due to the co-channel interference among the multiple MIMO links. So we arrange a new resource allocation algorithm such that the data throughput and the power consumption are balanced and the QoS constraint is met for each link. We model the resource allocation problem as a Noncooperative Game and devise a distributed resource allocation algorithm in which the constituent links find a Nash equilibrium point without coordination. The proposed algorithm turns out to perform close to the optimal point achieved by centralized optimization.
-
ICC - A Resource Allocation with Balanced Data Throughput and Power Consumption under QoS Constraint in MIMO Interference Systems: A Noncooperative Game Approach
2008 IEEE International Conference on Communications, 2008Co-Authors: Hojoong Kwon, Byeong Gi LeeAbstract:In this paper, we investigate resource allocation in MIMO interference systems where multiple MIMO links share the same frequency band and interfere with each other. For MIMO transmission scheme, we consider a spatial multiplexing scheme that uses linear precoder and decoder. We impose the SINR constraint that the received SINR of each data sub-stream should be larger than a predetermined threshold, and the QoS constraint that the data throughput of individual link should be larger than a required level. In this system, a trade-off exists between the data throughput and the power consumption due to the co-channel interference among the multiple MIMO links. So we arrange a new resource allocation algorithm such that the data throughput and the power consumption are balanced and the QoS constraint is met for each link. We model the resource allocation problem as a Noncooperative Game and devise a distributed resource allocation algorithm in which the constituent links find a Nash equilibrium point without coordination. The proposed algorithm turns out to perform close to the optimal point achieved by centralized optimization.
-
distributed resource allocation through Noncooperative Game approach in multi cell ofdma systems
International Conference on Communications, 2006Co-Authors: Hojoong Kwon, Byeong Gi LeeAbstract:In this paper, we present a distributed resource allocation algorithm for multi-cell OFDMA systems by adopting a Game theoretic approach. We first define a utility function that can represent the system performance while taking into account the co-channel interference among cells. Then we model resource allocation problem as a Noncooperative Game. Based on the Game, we devise a iterative algorithm called DRA that requires no coordination among the base stations. We prove that there exists a Nash equilibrium for the Game and the equilibrium is unique in some constrained environment. The proposed DRA algorithm turns out to converge to the equilibrium within a small number of iterations.
-
ICC - Distributed Resource Allocation through Noncooperative Game Approach in Multi-cell OFDMA Systems
2006 IEEE International Conference on Communications, 2006Co-Authors: Hojoong Kwon, Byeong Gi LeeAbstract:In this paper, we present a distributed resource allocation algorithm for multi-cell OFDMA systems by adopting a Game theoretic approach. We first define a utility function that can represent the system performance while taking into account the co-channel interference among cells. Then we model resource allocation problem as a Noncooperative Game. Based on the Game, we devise a iterative algorithm called DRA that requires no coordination among the base stations. We prove that there exists a Nash equilibrium for the Game and the equilibrium is unique in some constrained environment. The proposed DRA algorithm turns out to converge to the equilibrium within a small number of iterations.
Tamer Başar - One of the best experts on this subject based on the ideXlab platform.
-
SmartGridComm - A Noncooperative Game for double auction-based energy trading between PHEVs and distribution grids
2011 IEEE International Conference on Smart Grid Communications (SmartGridComm), 2011Co-Authors: Walid Saad, H. Vincent Poor, Zhu Han, Tamer BaşarAbstract:Plug-in hybrid electric vehicles (PHEVs) will constitute a key element in the emerging smart grid system. In this paper, the complex decision making processes of a number of PHEV groups seeking to sell part of their stored energy in a power market are studied using Noncooperative Games and double auctions. In particular, a Noncooperative Game is formulated between the PHEV groups. In this Game, each PHEV group can make a decision on the maximum amount of energy surplus that it is willing to sell so as to maximize a utility function that captures the tradeoff between the economical benefits from energy trading and the associated costs. The trading price governing the energy exchange market between the PHEVs and the smart grid network is determined using a strategy-proof double auction. For solving the Game, an algorithm based on best response dynamics is proposed using which the PHEV groups can reach a Nash equilibrium point. Simulation results show how our approach allows the PHEV groups to act strategically while improving the average utility achieved per PHEV group of up to 100.2% relative to a greedy algorithm.
-
A Noncooperative Game for double auction-based energy trading between PHEVs and distribution grids
2011 IEEE International Conference on Smart Grid Communications (SmartGridComm), 2011Co-Authors: Walid Saad, Vincent Harold Poor, Zhu Han, Tamer BaşarAbstract:Plug-in hybrid electric vehicles (PHEVs) will constitute a key element in the emerging smart grid system. In this paper, the complex decision making processes of a number of PHEV groups seeking to sell part of their stored energy in a power market are studied using Noncooperative Games and double auctions. In particular, a Noncooperative Game is formulated between the PHEV groups. In this Game, each PHEV group can make a decision on the maximum amount of energy surplus that it is willing to sell so as to maximize a utility function that captures the tradeoff between the economical benefits from energy trading and the associated costs. The trading price governing the energy exchange market between the PHEVs and the smart grid network is determined using a strategy-proof double auction. For solving the Game, an algorithm based on best response dynamics is proposed using which the PHEV groups can reach a Nash equilibrium point. Simulation results show how our approach allows the PHEV groups to act strategically while improving the average utility achieved per PHEV group of up to 100.2% relative to a greedy algorithm.
-
cdma uplink power control as a Noncooperative Game
Wireless Networks, 2002Co-Authors: Tansu Alpcan, Tamer Başar, R Srikant, Eitan AltmanAbstract:We present a Game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of Noncooperative Game theory to obtain a distributed and market-based control mechanism. Thus, we address not only the power control problem, but also pricing and allocation of a single resource among several users. A cost function is introduced as the difference between the pricing and utility functions, and the existence of a unique Nash equilibrium is established. In addition, two update algorithms, namely, parallel update and random update, are shown to be globally stable under specific conditions. Convergence properties and robustness of each algorithm are also studied through extensive simulations.
-
cdma uplink power control as a Noncooperative Game
Conference on Decision and Control, 2001Co-Authors: Tansu Alpcan, Tamer Başar, R Srikant, Eitan AltmanAbstract:We present a Game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of Noncooperative Game theory to obtain a distributed and market-based control mechanism. We address not only the power control problem, but also pricing and allocation of a single resource among several users. A cost function is introduced as the difference between pricing and utility functions, and the existence of a unique Nash equilibrium is established. Furthermore, two update algorithms, namely parallel update and random update, are shown to be globally stable under specific conditions. Convergence properties and robustness of each algorithm are also studied through extensive simulations.
-
A Hybrid Noncooperative Game Model for Wireless Communications
Annals of the International Society of Dynamic Games, 1Co-Authors: Tansu Alpcan, Tamer BaşarAbstract:We investigate a hybrid Noncooperative Game motivated by the practical problem of joint power control and base station (BS) assignment in code division multiple access (CDMA) wireless data networks. We model the integrated power control and BS assignment problem such that each mobile user’s action space includes not only the transmission power level but also the respective BS choice. Users are associated with specific cost functions consisting of a logarithmic user preference function in terms of service levels and convex pricing functions to enhance the overall system performance by limiting interference and preserving battery energy. We study the existence and uniqueness properties of pure strategy Nash equilibrium solutions of the hybrid Game, which constitute the operating points for the underlying wireless network. Since this task cannot be accomplished analytically even in the simplest cases due to the nonlinear and complex nature of the cost and reaction functions of mobiles, we conduct the analysis numerically using grid methods and randomized algorithms. Finally, we simulate a dynamic BS assignment and power update scheme, and compare it with “classical” Noncooperative power control algorithms in terms of aggregate signal-to-interference ratio levels obtained by users.
Keqin Li - One of the best experts on this subject based on the ideXlab platform.
-
spectrum resource sharing in heterogeneous vehicular networks a Noncooperative Game theoretic approach with correlated equilibrium
IEEE Transactions on Vehicular Technology, 2018Co-Authors: Zhu Xiao, Xiangyu Shen, Vincent Havyarimana, Fanzi Zeng, Dong Wang, Weiwei Chen, Keqin LiAbstract:In this paper, with the aims of alleviating the pressure from the shortage of spectrum resource and addressing the inefficient spectrum utilization, we investigate the spectrum sharing for moving vehicles in Heterogeneous Vehicular Networks (HVNs) consisting of the macrocells and the Road Side Units (RSUs) with Cognitive Radio (CR) technology. We first propose an incentive mechanism for encouraging macrocells to share spectrum resource with vehicle users, in which the CR-enabled RSUs perform sensing the spectrum availability in the surrounding urban environments. Furthermore, the downlink resource allocation for vehicle users associated with different RSUs is modeled as an $n$ -person Game and solved by designing a Noncooperative Game theoretic approach. By considering transmission power constraint of RSU and inter-RSU interference, the resource allocation and interference mitigation among RSUs are formulated via maximizing the overall utility in the HVNs. We design a Game theoretical strategy optimization algorithm based on regret-matching and then derive the correlated equilibrium solution. Moreover, we propose a heuristic power control algorithm for further mitigating the inter-RSU interference in the Noncooperative Game based resource allocation. Simulation results demonstrate that the proposed approach can achieve the correlated equilibrium with fast convergence and significantly improve the system performance in high mobility HVNs.
