|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Power allocation scheme for selfish cooperative communications based on game theory and particle swarm optimizer显示文摘In commercial networks,autonomous user nodes operating on batteries are assumed to be selfish to consume their energy solely to maximize their own benefits,e.g.,data throughputs.In this letter a two-user cooperative game is proposed to perform the power allocation for selfish cooperative communication networks.In the game,one selfish user node could trade its transmission power for the other ones cooperative relaying directly,and both user nodes are willing to achieve an optimal data-rate increase through cooperative relaying.To find the Nash bargaining solution(NBS) of the game,a low-complexity numerical particle swarm optimizer(PSO) algorithm is also developed.Simulation results indicate that the NBS of the game is efficient,in that both users could experience better performance than they work independently,and fair,in that the degree of cooperation of a user node only depends on how much contribution its partner can make to improve its own performance. | ZHANG GuoPeng YANG Kun DING EnJie | 2010 | Science China(Information Sciences)2010，53，9： | 9 |
| 2 | Energy efficient resource allocation in non-cooperative multi-cell OFDMA systems显示文摘A non-cooperative game is proposed to perform the sub-carrier assignment and power allocation for the multi-cell orthogonal frequency division multiple access(OFDMA) system.The objective is to raise the spectral efficiency of the system and prolong the life time of user nodes.This paper defines a game player as a cell formed by the unique base station and the served users.The utility function considered here measures the user's achieved utility per power.Each individual cell's goal is to maximize the total utility of its users.To search the Nash equilibrium(NE) of the game,an iterative and distributed algorithm is presented.Since the NE is inefficient,the pricing of user's transmission power is introduced to improve the NE in the Pareto sense.Simulation results show the proposed game outperforms the water-filling algorithm in terms of fairness and energy efficiency.Moreover,through employing a liner pricing function,the energy efficiency could be further improved. | Guopeng Zhang Peng Liu Enjie Ding | 2011 | Journal of Systems Engineering and Electronics2011，22，1： | 5 |
| 3 | A suboptimal joint bandwidth and power allocation for cooperative relay networks:a cooperative game theoretic approach显示文摘In commercial networks, user nodes operating on batteries are assumed to be selfish to consume their resources (i.e., bandwidth and power) solely maximizing their own benefits (e.g., the received signal-to-noise ratios (SNRs) and datarates). In this paper, a cooperative game theoretical framework is proposed to jointly perform the bandwidth and power allocation for selfish cooperative relay networks. To ensure a fair and efficient resource sharing between two selfish user nodes, we assume that either node can act as a source as well as a potential relay for each other and either node is willing to seek cooperative relaying only if the datarate achieved through cooperation is not lower than that achieved through noncooperation (i.e., direct transmission) by consuming the same amount of bandwidth and power resource. Define the cooperative strategy of a node as the number of bandwidth and power that it is willing to contribute for relaying purpose. The two node joint bandwidth and power allocation (JBPA) problem can then be formulated as a cooperative game. Since the Nash bargaining solution (NBS) to the JBPA game (JBPAG) is computationally difficult to obtain, we divide it into two subgames, i.e., the bandwidth allocation game (BAG) and the power allocation game (PAG). We prove that both the subgames have unique NBS. And then the suboptimal NBS to the JBPAG can be achieved by solving the BAG and PAG sequentially. Simulation results show that the proposed cooperative game scheme is efficient in that the performance loss of the NBS result to that of the maximal overall data-rate scheme is small while the maximal-rate scheme is unfair. The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance. | ZHANG GuoPeng DING EnJie YANG Kun LIU Peng | 2013 | Science China(Information Sciences)2013，56，7： | 4 |
| 4 | Energy-efficient power allocation for selfish cooperative communication networks using bargaining game显示文摘In commercial networks,user nodes operating on batteries are assumed to be selfish to consume their energy solely to maximize their own benefits,e.g.,data rates.In this paper,we propose a bargaining game to perform the power allocation for the selfish cooperative communication networks.In our system,two partner nodes can act as a source as well as a relay for each other,and each node is with an energy constraint to transmit one frame.Consider a selfish node is willing to seek cooperative transmission only if the data rate achieved through cooperation will not lower than that achieved through noncooperation by using the same amount of energy.The energy-efficient power allocation problem can be modeled as a cooperative game.We proved that there exists a unique Nash bargaining solution (NBS) for the game by verifying that the game is indeed a bargaining problem.Thus,the two objectives,i.e.,system efficiency and user fairness specified in the selfish networks can be achieved.Simulation results show that the NBS scheme is efficient in that the performance loss of the NBS scheme to that of the maximal overall rate scheme is small while the maximal-rate scheme is unfair.The simulation results also show that the NBS result is fair in that both nodes could experience better performance than they work independently and the degree of cooperation of a node only depends on how much contribution its partner can make to improve its own performance. | DING EnJie ZHANG GuoPeng LIU Peng YANG Kun | 2012 | Science China(Information Sciences)2012，55，4： | 3 |
| 5 | Joint channel bandwidth and power allocation game for selfish cooperative relaying net- works 显示文摘 | ZHANG Guopeng YANG Kun LIu Peng DING En- jie ZHONG Yali | 2012 | IEEE Transactions on Vehicular Technol- ogy2012，61，9： | 1 |
| 6 | Pareto optimal time-frequency resource allocation for selfish wireless cooperative multicast networks显示文摘In selfsh wireless cooperative multicast networks(WCMNs),a source node wants to achieve the optimal beneft(i.e.,rate gain),while the relaying nodes are willing to get fairness rewards(i.e.,rate gains)from the source for the cooperative relaying.In this paper,we implement these two diferent objectives for the source and the relays through the Pareto optimal resource allocation.Defne the cooperative strategy of a node as the fraction of a data-frame that it is willing to contribute to its cooperative partners.Consider the rational decision made by one node will defnitely afect its cooperative partners’choice.Then,we can formulate this resource sharing problem as a Nash bargaining problem(NBP),and the Nash bargaining solution(NBS)to the NBP encapsulates the Pareto optimality naturally.Finally,to enable the nodes to be capable of computing the NBS cooperative strategies rapidly as the wireless channel changes,we propose a fast particle swarm optimizer(PSO)algorithm to search for the NBS.Simulation results show that the two specifed objectives of the source and the relays can be implemented in the Pareto optimal sense,i.e.,the source can achieve a signifcant performance gain in comparison with direct multicast and the relays can get a fair reward by the source according to the level of contribution it has made to improve the performance of the source. | ZHANG GuoPeng LIU Peng DING EnJie | 2013 | Science China(Information Sciences)2013，56，12： | 1 |
| 7 | Space advanced technology demonstration satellite显示文摘The Space Advanced Technology demonstration satellite(SATech-01),a mission for low-cost space science and new technology experiments,organized by Chinese Academy of Sciences(CAS),was successfully launched into a Sun-synchronous orbit at an altitude of~500 km on July 27,2022,from the Jiuquan Satellite Launch Centre.Serving as an experimental platform for space science exploration and the demonstration of advanced common technologies in orbit,SATech-01 is equipped with 16 experimental payloads,including the solar upper transition region imager(SUTRI),the lobster eye imager for astronomy(LEIA),the high energy burst searcher(HEBS),and a High Precision Magnetic Field Measurement System based on a CPT Magnetometer(CPT).It also incorporates an imager with freeform optics,an integrated thermal imaging sensor,and a multi-functional integrated imager,etc.This paper provides an overview of SATech-01,including a technical description of the satellite and its scientific payloads,along with their on-orbit performance. | ZHANG XiaoFeng CHEN Wen ZHU XiaoCheng MENG Na HE JunWang BI XingZi ZHANG YongHe SHI Qi LI Fei LIU Rui FENG ZhengGong LIU Liu LI JinSong WU HaiChen XU DongXiao LI TaiJie HUANG JiangJiang LIU Shuo LI TianTong YU XianSheng GAO Yang ZHOU Heng BAN HanYu ZHANG YanLi ZHANG YueTing YANG YingQuan HE Tao DUAN XuLiang CHEN Xin WANG YaMin SUN AnTai ZHANG KuoXiang SUN Ying WANG YaoBin FAN ChengCheng XIONG ShaoLin LI XinQiao WEN XiangYang LING ZhiXing SUN XiaoJin ZHANG Chen BAI XianYong WANG ZhanShan DENG YuanYong TIAN Hui YANG JianFeng XUE HongBo SANG Peng LIU JinGuo ZHENG HuiLong ZHU Xiang HE JianWu LI Hui XU LuXiang XU ShuYan CHEN WenWu LIU ZhenDong WANG ZhaoLi MAO XiangLong GAO Rong LI ZongXuan DING GuoPeng WANG XinYu DOU RunJiang WENG LuBin LUO Hao WANG YaPing LIANG XianFeng FANG ZiRuo | 2024 | Science China(Technological Sciences)2024，67，1： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员