JOURNAL ARTICLE

Joint user association and content placement for Cache-enabled wireless access networks

Abstract

This paper considers the optimal placement of content in cache-enabled base-stations (BSs) for reducing backhaul traffic in a densely deployed wireless access network. By caching popular files, users requesting these files can be served directly by their associated BSs without needing to fetch content from the core network. This paper makes an observation that a real network consists of distinct classes of users with different file preferences, so jointly optimizing cache placement and user-BS association can result in significant benefit. This paper considers such a joint optimization problem for achieving an optimized tradeoff between load balancing and backhaul saving, while accounting for both the physical layer wireless propagation characteristics and the finite cache size at the BSs. By proposing a numerical algorithm that iteratively optimizes the content placement policy for fixed user-association and optimizes the user association policy for fixed content placement, with a goal of maximizing a backhaul-aware proportional fairness network utility, this paper shows that placing similar content at strategically located BSs can result in significant backhaul saving without sacrificing as much in user access rates.

Keywords:
Backhaul (telecommunications) Computer science Computer network Cache Base station Wireless network Wireless Core network Distributed computing Operating system

Metrics

43
Cited By
7.76
FWCI (Field Weighted Citation Impact)
7
Refs
0.98
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Caching and Content Delivery
Physical Sciences →  Computer Science →  Computer Networks and Communications
Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Wireless Network Optimization
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.