Dynamic Energy Trading for Energy Harvesting Communication Networks: A Stochastic Energy Trading Game

被引:31
|
作者
Xiao, Yong [1 ]
Niyato, Dusit [2 ]
Han, Zhu [1 ]
DaSilva, Luiz A. [3 ,4 ]
机构
[1] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA
[2] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
[3] Trinity Coll Dublin, CONNECT, Dublin 2, Ireland
[4] Virginia Tech, Blacksburg, VA USA
基金
爱尔兰科学基金会; 美国国家科学基金会;
关键词
Energy harvesting; energy trading; stable marriage; belief update; stable matching; communication networks; game theory; stochastic game; wireless power transfer; WIRELESS POWER TRANSFER; CELLULAR NETWORKS; INFORMATION; ARCHITECTURE;
D O I
10.1109/JSAC.2015.2481204
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper studies energy-harvesting communication systems in which different energy-harvesting devices (EHDs) can harvest different amounts of energy and transmit different numbers of data packets in different time slots. We introduce a dynamic energy trading framework that allows the EHDs to transfer and trade their harvested energy with each other. The EHDs are divided into two groups: seller EHDs that can harvest more energy than they can use, and buyer EHDs that cannot harvest sufficient energy to support their required communication services. In the proposed framework, the role of each EHD as a seller EHD or a buyer EHD as well as the amount of energy that each EHD can buy or sell to others change over time. Each EHD cannot observe complete information regarding the harvested energy or the number of data packets transmitted by other EHDs. We introduce a simple energy trading scheduling protocol for the EHDs to discover their nearby EHDs and establish energy trading links with each other. We formulate a new game theoretic model called stochastic energy trading game to analyze the dynamic energy trading among EHDs in a stochastic environment. We derive an optimal energy-trading policy for each EHD to sequentially optimize its decisions. We prove that the proposed policy can achieve a stable and optimal sequence of matchings between buyer and seller EHDs. We present numerical results to compare our proposed energy trading policy with an existing transmit packet scheduling approach, under various network settings and conditions.
引用
收藏
页码:2718 / 2734
页数:17
相关论文
共 50 条
  • [21] Energy Trading in the Smart Grid: A Game Theoretic Approach
    Yaagoubi, Naouar
    Mouftah, Hussein T.
    2015 IEEE INTERNATIONAL CONFERENCE ON SMART ENERGY GRID ENGINEERING (SEGE 2015), 2015,
  • [22] Dynamic Incentive Mechanism for Direct Energy Trading
    Zhao, Nan
    Fan, Pengfei
    Wu, Minghu
    He, Xiao
    Fan, Menglin
    Tian, Chao
    INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING, IMIS-2018, 2019, 773 : 403 - 411
  • [23] Optimal Energy Trading with Battery Energy Storage under Dynamic Pricing
    Tan, Xiaoqi
    Wu, Yuan
    Tsang, Danny H. K.
    2014 IEEE INTERNATIONAL CONFERENCE ON SMART GRID COMMUNICATIONS (SMARTGRIDCOMM), 2014, : 722 - 727
  • [24] Transforming Energy Networks via Peer-to-Peer Energy Trading The potential of game-theoretic approaches
    Tushar, Wayes
    Yuen, Chau
    Mohsenian-Rad, Hamed
    Saha, Tapan
    Poor, H. Vincent
    Wood, Kristin L.
    IEEE SIGNAL PROCESSING MAGAZINE, 2018, 35 (04) : 90 - 111
  • [25] Energy and Emissions Trading
    Galarza, Martina
    BWK, 2012, 64 (12): : 55 - 55
  • [26] Energy and emissions Trading
    Ziegler, Thorsten
    BWK, 2012, 64 (04): : 32 - 32
  • [27] ENERGY Potemkin Trading
    Victor, David G.
    TECHNOLOGY REVIEW, 2009, 112 (04) : 12 - 12
  • [28] Energy trading cards
    不详
    OIL & GAS JOURNAL, 2003, 101 (09) : 17 - 17
  • [29] Energy Trading & Investing: Trading, Risk Management and Structuring Deals in Energy Markets
    Conn, David R.
    LIBRARY JOURNAL, 2017, 142 (02) : 34 - 34
  • [30] STOCHASTIC BACKPRESSURE IN ENERGY HARVESTING NETWORKS
    Calvo-Fullana, Miguel
    Matamoros, Javier
    Anton-Haro, Carles
    Ribeiro, Alejandro
    2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 3724 - 3728