Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Hindawi Limited ; 2017
    In:  Wireless Communications and Mobile Computing Vol. 2017 ( 2017), p. 1-10
    In: Wireless Communications and Mobile Computing, Hindawi Limited, Vol. 2017 ( 2017), p. 1-10
    Abstract: A new method about renewable energy cooperation among small base stations (SBSs) is proposed, which is for maximizing the energy efficiency in ultradense network (UDN). In UDN each SBS is equipped with energy harvesting (EH) unit, and the energy arrival times are modeled as a Poisson counting process. Firstly, SBSs of large traffic demands are selected as the clustering centers, and then all SBSs are clustered using dynamic k -means algorithm. Secondly, SBSs coordinate their renewable energy within each formed cluster. The process of energy cooperation among SBSs is considered as Markov decision process. Q -learning algorithm is utilized to optimize energy cooperation. In the algorithm there are four different actions and their corresponding reward functions. Q -learning explores the action as much as possible and predicts better action by calculating reward. In addition, ε greedy policy is used to ensure the algorithm convergence. Finally, simulation results show that the new method reduces data dimension and improves calculation speed, which furthermore improves the utilization of renewable energy and promotes the performance of UDN. Through online optimization, the proposed method can significantly improve the energy utilization rate and data transmission rate.
    Type of Medium: Online Resource
    ISSN: 1530-8669 , 1530-8677
    Language: English
    Publisher: Hindawi Limited
    Publication Date: 2017
    detail.hit.zdb_id: 2045240-8
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages