English
Related papers

Related papers: The Multi-path Utility Maximization and Multi-path…

200 papers

Non-orthogonal multiple access (NOMA) is a promising technology to increase the spectral efficiency and enable massive connectivity in 5G and future wireless networks. In contrast to orthogonal schemes, such as OFDMA, NOMA multiplexes…

Optimization and Control · Mathematics 2020-05-01 Lou Salaün , Marceau Coupechoux , Chung Shue Chen

Cell-free Massive multiple-input multiple-output (MIMO) is considered, where distributed access points (APs) multiply the received signal by the conjugate of the estimated channel, and send back a quantized version of this weighted signal…

Information Theory · Computer Science 2019-07-09 Manijeh Bashar , Kanapathippillai Cumanan , Alister G. Burr , Hien Quoc Ngo , Merouane Debbah , Pei Xiao

In traditional networks, interfaces of network nodes are duplex. But, emerging communication technologies such as visible light communication, millimeter-wave communications, can only provide a unidirectional interface when cost is limited.…

Networking and Internet Architecture · Computer Science 2018-04-10 Xiaohui Chen , Xiaowei Qin , Li Chen , Huarui Yin , Weidong Wang , Guo Wei , Tianyi Zhang , Yanbin Liu , Ting Zhu , Hailun Liu

This paper proposes new proximal Newton-type methods with a diagonal metric for solving composite optimization problems whose objective function is the sum of a twice continuously differentiable function and a proper closed directionally…

Optimization and Control · Mathematics 2023-10-11 Shotaro Yagishita , Shummin Nakayama

Based upon the idea that network functionality is impaired if two nodes in a network are sufficiently separated in terms of a given metric, we introduce two combinatorial \emph{pseudocut} problems generalizing the classical min-cut and…

Data Structures and Algorithms · Computer Science 2017-04-18 Alan Kuhnle , Tianyi Pan , Victoria G. Crawford , Md Abdul Alim , My T. Thai

In this paper, we focus on solving a distributed convex optimization problem in a network, where each agent has its own convex cost function and the goal is to minimize the sum of the agents' cost functions while obeying the network…

Optimization and Control · Mathematics 2020-02-11 Shi Pu , Wei Shi , Jinming Xu , Angelia Nedić

Current quantum computers can only solve optimization problems of a very limited size. For larger problems, decomposition methods are required in which the original problem is broken down into several smaller sub-problems. These are then…

Optimization and Control · Mathematics 2025-04-30 Zongji Li , Tobias Seidel , Michael Bortz , Raoul Heese

Utility-based power allocation in wireless ad-hoc networks is inherently nonconvex because of the global coupling induced by the co-channel interference. To tackle this challenge, we first show that the globally optimal point lies on the…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-11-17 Lei Yang , Yalin E. Sagduyu , Junshan Zhang , Jason H. Li

Filterless optical transport networks relies on passive optical interconnections between nodes, i.e., on splitters/couplers and amplifiers. While different studies have investigated their design, none of them offer a solution for an optimal…

Networking and Internet Architecture · Computer Science 2021-01-05 Brigitte Jaumard , Yan Wang

Joint transmission is a kind of cooperative transmission technology, which converts other cell interference into signal. In this letter, for single-user joint transmission, we propose that a power pool can be created in order to increase…

Information Theory · Computer Science 2017-04-24 Tong Zhang , Xiaodong Xu , Xiaofeng Tao , Qimei Cui

We consider an online version of the well-studied network utility maximization problem, where users arrive one by one and an operator makes irrevocable decisions for each user without knowing the details of future arrivals. We propose a…

Data Structures and Algorithms · Computer Science 2021-01-27 Ying Cao , Bo Sun , Danny H. K. Tsang

We study two variants of \textsc{Maximum Cut}, which we call \textsc{Connected Maximum Cut} and \textsc{Maximum Minimal Cut}, in this paper. In these problems, given an unweighted graph, the goal is to compute a maximum cut satisfying some…

Data Structures and Algorithms · Computer Science 2019-08-12 Hiroshi Eto , Tesshu Hanaka , Yasuaki Kobayashi , Yusuke Kobayashi

In this work, we design a generalized joint transmission coordinated multi-point (JT-CoMP)-non-orthogonal multiple access (NOMA) model for a virtualized multi-infrastructure network. In this model, all users benefit from multiple joint…

Information Theory · Computer Science 2021-03-24 Sepehr Rezvani , Nader Mokari , Mohammad R. Javan , Eduard A. Jorswieck

In this paper, we propose a novel resource management scheme that jointly allocates the transmit power and computational resources in a centralized radio access network architecture. The network comprises a set of computing nodes to which…

Networking and Internet Architecture · Computer Science 2021-06-24 Mohsen Tajallifar , Sina Ebrahimi , Mohammad Reza Javan , Nader Mokari , Luca Chiaraviglio

We present a novel communication-efficient Newton-type algorithm for finite-sum optimization over a distributed computing environment. Our method, named DINO, overcomes both theoretical and practical shortcomings of similar existing…

Optimization and Control · Mathematics 2020-06-09 Rixon Crane , Fred Roosta

Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and…

Networking and Internet Architecture · Computer Science 2016-11-17 Mohamed Lamine Lamali , Nasreddine Fergani , Johanne Cohen , Hélia Pouyllau

Graphs are fundamental objects that find widespread applications across computer science and beyond. Graph Theory has yielded deep insights about structural properties of various families of graphs, which are leveraged in the design and…

Data Structures and Algorithms · Computer Science 2023-08-30 Rachit Nimavat

Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem in general involves an exponential number of variables,…

Information Theory · Computer Science 2013-05-14 Raúl Etkin , Farzad Parvaresh , Ilan Shomorony , A. Salman Avestimehr

The increasing demand for massive connectivity and high data rates has made the efficient use of existing spectrum resources an increasingly challenging problem. Non-orthogonal multiple access (NOMA) is a potential solution for future…

In this paper, the multiple-input multiple-output (MIMO) transmit beampattern matching problem is considered. The problem is formulated to approximate a desired transmit beampattern (i.e., an energy distribution in space and frequency) and…

Optimization and Control · Mathematics 2018-02-21 Ziping Zhao , Daniel P. Palomar
‹ Prev 1 8 9 10 Next ›