Hypergraph-Based Analysis of Clustered Cooperative Beamforming with Application to Edge Caching

October 21, 2015 Β· Declared Dead Β· πŸ› IEEE Wireless Communications Letters

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Bahar Azari, Osvaldo Simeone, Umberto Spagnolini, Antonia M. Tulino arXiv ID 1510.06222 Category cs.IT: Information Theory Cross-listed cs.NI Citations 42 Venue IEEE Wireless Communications Letters Last Checked 6 months ago
Abstract
The evaluation of the performance of clustered cooperative beamforming in cellular networks generally requires the solution of complex non-convex optimization problems. In this letter, a framework based on a hypergraph formalism is proposed that enables the derivation of a performance characterization of clustered cooperative beamforming in terms of per-user degrees of freedom (DoF) via the efficient solution of a coloring problem. An emerging scenario in which clusters of cooperative base stations (BSs) arise is given by cellular networks with edge caching. In fact, clusters of BSs that share the same requested files can jointly beamform the corresponding encoded signals. Based on this observation, the proposed framework is applied to obtain quantitative insights into the optimal use of cache and backhaul resources in cellular systems with edge caching. Numerical examples are provided to illustrate the merits of the proposed framework.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted