Cost-Aware Green Cellular Networks with Energy and Communication Cooperation

Energy cost of cellular networks is ever-increasing to match the surge of wireless data traffic, and the saving of this cost is important to reduce the operational expenditure (OPEX) of wireless operators in future. The recent advancements of renewable energy integration and two-way energy flow in smart grid provide potential new solutions to save the cost. However, they also impose challenges, especially on how to use the stochastically and spatially distributed renewable energy harvested at cellular base stations (BSs) to reliably supply time- and space-varying wireless traffic over cellular networks. To overcome these challenges, in this article we present three approaches, namely, {\emph{energy cooperation, communication cooperation, and joint energy and communication cooperation}}, in which different BSs bidirectionally trade or share energy via the aggregator in smart grid, and/or share wireless resources and shift loads with each other to reduce the total energy cost.Comment: Submitted for possible publicatio

Cooperative Local Caching under Heterogeneous File Preferences

Local caching is an effective scheme for leveraging the memory of the mobile terminal (MT) and short range communications to save the bandwidth usage and reduce the download delay in the cellular communication system. Specifically, the MTs first cache in their local memories in off-peak hours and then exchange the requested files with each other in the vicinity during peak hours. However, prior works largely overlook MTs' heterogeneity in file preferences and their selfish behaviours. In this paper, we practically categorize the MTs into different interest groups according to the MTs' preferences. Each group of MTs aims to increase the probability of successful file discovery from the neighbouring MTs (from the same or different groups). Hence, we define the groups' utilities as the probability of successfully discovering the file in the neighbouring MTs, which should be maximized by deciding the caching strategies of different groups. By modelling MTs' mobilities as homogeneous Poisson point processes (HPPPs), we analytically characterize MTs' utilities in closed-form. We first consider the fully cooperative case where a centralizer helps all groups to make caching decisions. We formulate the problem as a weighted-sum utility maximization problem, through which the maximum utility trade-offs of different groups are characterized. Next, we study two benchmark cases under selfish caching, namely, partial and no cooperation, with and without inter-group file sharing, respectively. The optimal caching distributions for these two cases are derived. Finally, numerical examples are presented to compare the utilities under different cases and show the effectiveness of the fully cooperative local caching compared to the two benchmark cases