中文
相关论文

相关论文: The Multi-path Utility Maximization and Multi-path…

200 篇论文

Non-orthogonal multiple access (NOMA) has received significant attention for future wireless networks. NOMA outperforms orthogonal schemes, such as OFDMA, in terms of spectral efficiency and massive connectivity. The joint subcarrier and…

网络与互联网体系结构 · 计算机科学 2019-10-07 Lou Salaun , Marceau Coupechoux , Chung Shue Chen

Given an undirected, unweighted graph with $n$ vertices and $m$ edges, the maximum cut problem is to find a partition of the $n$ vertices into disjoint subsets $V_1$ and $V_2$ such that the number of edges between them is as large as…

Large-scale distributed antenna systems with many access points (APs) that serve the users by coherent joint transmission is being considered for 5G-and-beyond networks. The technology is called Cell-free Massive MIMO and can provide a more…

信息论 · 计算机科学 2020-06-30 Trinh Van Chien , Emil Björnson , Erik G. Larsson

By offering shared computational facilities to which mobile devices can offload their computational tasks, the mobile edge computing framework is expanding the scope of applications that can be provided on resource-constrained devices. When…

信息论 · 计算机科学 2018-10-16 Mahsa Salmani , Timothy N. Davidson

In this paper, we design an association scheme to maximize the sum energy efficiency for massive multiple-input and multiple-output (MIMO) enabled heterogeneous cellular networks (HCNs). Considering that the final formulated problem is in a…

信息论 · 计算机科学 2016-07-06 Tianqing Zhou

Resource allocation is investigated for offloading computational-intensive tasks in multi-hop mobile edge computing (MEC) system. The envisioned system has both the cooperative access points (AP) with the computing capability and the MEC…

信息论 · 计算机科学 2021-04-27 Mohammed S. Al-Abiad , Md. Zoheb Hassan , Md. Jahangir Hossain

We solve the (weighted) sum-rate maximization problem over the set of achievable rates characterized by a nonlinear spectral radius function. This set has been recently shown to be convex in some practically relevant settings in modern…

最优化与控制 · 数学 2026-02-26 Hiroki Kuroda , Renato Luis Garrido Cavalcante

In this paper, a novel joint design of beamforming and power allocation is proposed for a multi-cell multiuser multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) network. In this network, base stations (BSs) adopt…

信息论 · 计算机科学 2018-06-13 Xiaofang Sun , Nan Yang , Shihao Yan , Zhiguo Ding , Derrick Wing Kwan Ng , Chao Shen , Zhangdui Zhong

In cellular wireless networks, user association refers to the problem of assigning mobile users to base station cells -- a critical, but challenging, problem in many emerging small cell and heterogeneous networks. This paper considers a…

网络与互联网体系结构 · 计算机科学 2013-04-16 Changkyu Kim , Russell Ford , Yanjia Qi , Sundeep Rangan

In this work, we focus on the Neumann-Neumann method (NNM), which is one of the most popular non-overlapping domain decomposition methods. Even though the NNM is widely used and proves itself very efficient when applied to discrete problems…

数值分析 · 数学 2023-02-28 Bastien Chaudet-Dumas , Martin J. Gander

This paper investigates the coexistence of non-orthogonal multiple access (NOMA) and full-duplex (FD) to improve both spectral efficiency (SE) and user fairness. In such a scenario, NOMA based on the successive interference cancellation…

信号处理 · 电气工程与系统科学 2019-08-05 Hieu V. Nguyen , Van-Dinh Nguyen , Octavia A. Dobre , Diep N. Nguyen , Eryk Dutkiewicz , Oh-Soon Shin

Optimization has been widely used to generate smooth trajectories for motion planning. However, existing trajectory optimization methods show weakness when dealing with large-scale long trajectories. Recent advances in parallel computing…

机器人学 · 计算机科学 2025-07-18 Jiajun Yu , Nanhe Chen , Guodong Liu , Chao Xu , Fei Gao , Yanjun Cao

Given the increasing demand from wireless applications, designing energy-efficient group communication protocols is of great importance to multi-hop wireless networks. A group communication session involves a set of member nodes, each of…

网络与互联网体系结构 · 计算机科学 2012-02-21 Kai Han , Liu Xiang , Jun Luo , Yang Liu

In this paper we consider a distributed optimization scenario in which a set of processors aims at minimizing the maximum of a collection of "separable convex functions" subject to local constraints. This set-up is motivated by peak-demand…

分布式、并行与集群计算 · 计算机科学 2017-03-27 Ivano Notarnicola , Mauro Franceschelli , Giuseppe Notarstefano

Many problems in geometric optics or convex geometry can be recast as optimal transport problems: this includes the far-field reflector problem, Alexandrov's curvature prescription problem, etc. A popular way to solve these problems…

数值分析 · 数学 2017-03-08 Jun Kitagawa , Quentin Mérigot , Boris Thibert

We revisit the Maximum Node-Disjoint Paths problem, the natural optimization version of Node-Disjoint Paths, where we are given a graph $G$, $k$ pairs of vertices $(s_i, t_i)$ and an integer $\ell$, and are asked whether there exist at…

数据结构与算法 · 计算机科学 2025-09-18 Michael Lampis , Manolis Vasilakis

Social utility maximization refers to the process of allocating resources in such a way that the sum of agents' utilities is maximized under the system constraints. Such allocation arises in several problems in the general area of…

计算机科学与博弈论 · 计算机科学 2015-03-10 Abhinav Sinha , Achilleas Anastasopoulos

Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rates are typically very slow. This paper introduces a family of…

最优化与控制 · 数学 2011-04-07 M. Zargham , A. Ribeiro , A. Jadbabaie , A. Ozdaglar

Recently, unmanned aerial vehicle (UAV) has attracted much attention due to its flexible deployment and controllable mobility. As the general communication network cannot meet the emergency requirements, in this paper we study the multi-UAV…

信息论 · 计算机科学 2024-07-17 Yixin Zhang , Wenchi Cheng

We study the problem of computing a minimum equivalent digraph (also known as the problem of computing a strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare a set…

计算复杂性 · 计算机科学 2008-09-02 Piotr Berman , Bhaskar DasGupta , Marek Karpinski