ADMM驱动的异构缓存小型蜂窝网络分布式调度算法优化

38 浏览量更新于2024-08-26 收藏 229KB PDF 举报

本文主要探讨了在小型蜂窝网络中，利用异构缓存功能来设计一种分布式调度算法，以优化多归属用户的网络性能。随着移动流量的急剧增长，特别是从2012年至2024年预计将增长13倍，对于小型基站（SCBS）如何有效管理和分配资源，提升服务质量（QoS）变得至关重要。研究者Zhilong Zhang和Danpu Liu来自北京邮电大学网络系统架构与融合实验室，他们提出了一种基于交替方向方法乘子（Alternating Direction Method of Multipliers，ADMM）的分布式调度方案。 ADMM是一种强大的优化工具，它允许将复杂问题分解为更易于处理的部分，然后在各个SCBS上并行执行，实现了计算效率的提升。该算法的核心目标是在满足所有用户QoS需求的前提下，最小化整个网络的操作成本。通过将问题分解为子问题，并在每个SCBS之间进行通信和协调，ADMM能够实现全局最优解的收敛，即使在分布式环境中也能保证算法的有效性和效率。与传统分布式方法相比，新提出的基于ADMM的算法展现了显著的优势。在模拟实验中，结果显示经过几次迭代后，操作成本就能够达到全局最优，显示出其在实际应用中的高效性和优越性。因此，关键词包括：分布式调度、异构缓存、多归属用户、ADMM等，这些都是本文研究的核心概念和技术手段。在无线网络日益复杂的背景下，这篇研究不仅为小型蜂窝网络的资源管理提供了创新解决方案，也为其他类似场景下的分布式优化问题提供了一个有价值的参考框架。通过理解和应用这种方法，网络运营商可以更好地应对未来流量增长带来的挑战，确保用户获得无缝且高效的网络体验。

A distributed scheduling algorithm for heterogeneous cache-enabled small cell

networks using ADMM

Zhilong Zhang, Danpu Liu

Beijing Key Laboratory of Network System Architecture and Convergence

Beijing University of Posts and Telecommunications, Beijing, P. R. China 100876

jerome.zl.zhang@gmail.com, dpliu@bupt.edu.cn

Abstract—We consider designing a distributed scheduling

algorithm for multi-homing users in heterogeneous cache-

enabled small cell networks. The aim is to minimize the total

operation cost on condition that all users’ QoS requirements

are satisﬁed. The proposed algorithm is based on alternating

direction method of multipliers (ADMM) and can be carried

out in each small cell base station (SCBS) independently.

Simulation results show that the operation cost converges to the

global optimum after a few iterations and the proposed algo-

rithm outperforms a conventional distributed method largely.

Keywords-Distributed scheduling, cache-enabled small cell,

multi-homing, ADMM

I. INTRODUCTION

Recently, mobile trafﬁc grows dramatically in wireless

networks and is predicted to increase 13-fold from 2012

until 2017 [1]. It has been observed that a great amount of

the transmitted data is a small portion of popular videos.

To relieve the burden of networks, operators deploy cache-

enabled small cell base stations (SCBSs). With the help

of cache-enabled SCBSs, popular ﬁles can be downloaded

directly from the caches with a certain probability, rather

than downloaded from the costly backhaul links. Recent

years have also witnessed an increasing growth of user

equipments (UEs) which are equipped with multiple wireless

interfaces. They are usually called multi-homing UEs [2–

4]. When moving into an area covered by heterogeneous

small cell networks, they can be possibly associated to and

download from multiple SCBSs simultaneously.

Many previous academic literature focuses on the caching

strategies and aim at maximizing some utilities of networks

or users, such as maximizing the cache hit rate [5] and

enhancing the users QoS by ofﬂoading trafﬁcs to local

device-to-device links [6]. Power saving is also considered

in cache-enabled networks [7]. In most of the works, it

is usually assumed that a UE’s average downloading rate

is pre-known and ﬁxed during the ﬁle downloading period

[4, 8]. However, in fact, the rate can be variable and depends

on the scheduling strategy adopted by the SCBSs. For

example, if a requested ﬁle is cached by a SCBS but the

cost to transmit the ﬁle through wireless channels is too

large, then it is better to ofﬂoad the trafﬁc to a proper SCBS,

even though the requested ﬁles have to be downloaded from

backhaul links. Therefore, scheduling strategies should be

considered in addition to the caching methods.

Moreover, when the cache-enabled small cell networks

meet multi-homing UEs, distributed scheduling methods

considering both the cache-enabled and multi-homing char-

acteristics of network nodes are needed. Although several

researches have studied the resource allocation algorithm for

multi-homing service in heterogeneous networks [2–4], none

of them aim to minimize the network operation cost in the

presence of caches at SCBSs.

In this paper, our problem arises as how to allocate

wireless resources to multi-homing UEs in heterogeneous

cache-enabled small cell networks. We consider a scenario

that a group of UEs are served by a set of cache-enabled

SCBSs from different operators. An optimization problem is

formulated in terms of minimizing the total operation cost.

A distributed optimal scheduling strategy for the SCBSs is

proposed based on alternating direction method of multipli-

ers (ADMM) [9] which is a distributed algorithm widely

discussed recently.

The rest of the paper is organized as follows. Section

II describes the system model and elaborates the problem

setting. In Section III, a distributed algorithm based on

ADMM is proposed by solving the optimization problem.

Simulation results verify our proposal in Section IV and a

summary concludes the paper in Section V.

II. SYSTEM MODEL AND PROBLEM FORMULATION

A. Network model

We consider a region covered by a group of cache-enabled

SCBSs denoted by M = {1, 2, ..., M}. They are connected

to the core network via limited backhaul links. In this region,

there exists a set of multi-homing UEs N = {1, 2, ..., N}

which are able to access multiple SCBSs simultaneously as

shown in Fig. 1. Assume that the nth UE has been associated

with a set of SCBSs denoted by M

, where M

⊆ M, and

the mth SCBS serves a set of UEs denoted by N

, where

⊆ N . Obviously, if n ∈ N

, then m ∈ M

, and vice

versa.

If all the resources of SCBS m are allocated to UE n, the

downloading data rate of UE n is calculated by

m,n

= W

log

(1 + SIN R

m,n

(1)

下载后可阅读完整内容，剩余4页未读，立即下载

weixin_38695159

粉丝: 5
资源: 942

ADMM驱动的异构缓存小型蜂窝网络分布式调度算法优化

MATLAB代码：基于分布式ADMM算法的考虑碳排放交易的电力系统优化调度研究 关键词：分布式调度 ADMM算法 交替方向乘子法

基于matlab实现ADMM算法在分布式调度中的应用源码+详细代码注释.zip

如何应用分布式的ADMM算法

分布式优化算法有哪些，各有什么优劣？

scala构造ADMM算法

分布式一致性ADMM算法MATLAB代码

解决全局优化问题的分布式优化算法

3000字围绕ADMM算法介绍CBD与ADMM之间的联系，ADMM算法的时间复杂度

TNNR算法ADMM算法以及TNNR-ADMM算法

ADMM算法处理大规模问题可行性

最新资源

MATLAB代码：基于分布式ADMM算法的考虑碳排放交易的电力系统优化调度研究关键词：分布式调度 ADMM算法交替方向乘子法