Caching Meets Millimeter Wave Communications for Enhanced Mobility Management in 5G Networks
January 18, 2017 Β· Declared Dead Β· π IEEE Transactions on Wireless Communications
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Omid Semiari, Walid Saad, Mehdi Bennis, Behrouz Maham
arXiv ID
1701.05125
Category
cs.GT: Game Theory
Cross-listed
cs.IT
Citations
72
Venue
IEEE Transactions on Wireless Communications
Last Checked
5 months ago
Abstract
One of the most promising approaches to overcome the uncertainty and dynamic channel variations of millimeter wave (mmW) communications is to deploy dual-mode base stations that integrate both mmW and microwave ($ΞΌ$W) frequencies. If properly designed, such dual-mode base stations can enhance mobility and handover in highly mobile wireless environments. In this paper, a novel approach for analyzing and managing mobility in joint $ΞΌ$W-mmW networks is proposed. The proposed approach leverages device-level caching along with the capabilities of dual-mode base stations to minimize handover failures, reduce inter-frequency measurement energy consumption, and provide seamless mobility in emerging dense heterogeneous networks. First, fundamental results on the caching capabilities, including caching probability and cache duration are derived for the proposed dual-mode network scenario. Second, the average achievable rate of caching is derived for mobile users. Third, the proposed cache-enabled mobility management problem is formulated as a dynamic matching game between mobile user equipments (MUEs) and small base stations (SBSs). The goal of this game is to find a distributed handover mechanism that subject to the network constraints on HOFs and limited cache sizes, allows each MUE to choose between executing an HO to a target SBS, being connected to the macrocell base station (MBS), or perform a transparent HO by using the cached content. The formulated matching game allows capturing the dynamics of the mobility management problem caused by HOFs. To solve this dynamic matching problem, a novel algorithm is proposed and its convergence to a two-sided dynamically stable HO policy is proved. Numerical results corroborate the analytical derivations and show that the proposed solution will provides significant reductions in both the HOF and energy consumption by MUEs.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Game Theory
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
A Motivational Game-Theoretic Approach for Peer-to-Peer Energy Trading in the Smart Grid
R.I.P.
π»
Ghosted
Computing Resource Allocation in Three-Tier IoT Fog Networks: a Joint Optimization Approach Combining Stackelberg Game and Matching
R.I.P.
π»
Ghosted
Fast Convergence of Regularized Learning in Games
R.I.P.
π»
Ghosted
Computation Peer Offloading for Energy-Constrained Mobile Edge Computing in Small-Cell Networks
R.I.P.
π»
Ghosted
Blockchain Mining Games
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted