English
Related papers

Related papers: Optimality of Orthogonal Access for One-dimensiona…

200 papers

We study the achievable capacity regions of full-duplex links in the single- and multi-channel cases (in the latter case, the channels are assumed to be orthogonal -- e.g., OFDM). We present analytical results that characterize the uplink…

Networking and Internet Architecture · Computer Science 2016-05-25 Jelena Marašević , Gil Zussman

The capacity region of a multiple access channel is discussed. It was found that orthogonal multiple access and non orthogonal multiple access have the same capacity region under the constraint of same sum power.

Information Theory · Computer Science 2016-05-11 Xuezhi Yang

We present a unified analytical framework within which power control, rate allocation, routing, and congestion control for wireless networks can be optimized in a coherent and integrated manner. We consider a multi-commodity flow model with…

Networking and Internet Architecture · Computer Science 2007-09-18 Yufang Xi , Edmund M. Yeh

Motivated by potential applications in power systems, we study a problem of optimizing a sum of $n$ convex functions on dynamic networks of $n$ nodes when each function is known to only a single node. The nodes' variables, while satisfy…

Optimization and Control · Mathematics 2016-10-04 Thinh T. Doan , Alex Olshevsky

We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have suggested that, in such a scenario, selection, i.e., a single…

Information Theory · Computer Science 2009-03-16 Sachin Kadloor , Raviraj Adve

We propose a cell planning scheme to maximize the resource efficiency of a wireless communication network while considering quality-of-service requirements imposed by different mobile services. In dense and heterogeneous cellular 5G…

Signal Processing · Electrical Eng. & Systems 2018-05-31 Florian Bahlke , Oscar D. Ramos-Cantor , Steffen Henneberger , Marius Pesavento

In this paper, we provide joint subcarrier assignment and power allocation schemes for quality-of-service (QoS)-constrained energy-efficiency (EE) optimization in the downlink of an orthogonal frequency division multiple access…

Information Theory · Computer Science 2016-11-01 Jie Tang , Daniel K. C. So , Emad Alsusa , Khairi Ashour Hamdi , Arman Shojaeifard , Kai-Kit Wong

We show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. Hyperbolic geometry facilitates maximally efficient greedy forwarding in these networks. Greedy forwarding is topology-oblivious.…

Statistical Mechanics · Physics 2010-09-13 Fragkiskos Papadopoulos , Dmitri Krioukov , Marian Boguna , Amin Vahdat

Many problems in power systems involve optimizing a certain objective function subject to power flow equations and engineering constraints. A long-standing challenge in solving them is the nonconvexity of their feasible sets. In this paper,…

Optimization and Control · Mathematics 2023-10-03 Ling Zhang , Daniel Tabas , Baosen Zhang

Non-orthogonal communication is a promising technique for future wireless networks (e.g., 6G and Wi-Fi 7). In the vector channel model, designing efficient non-orthogonal communication schemes amounts to the following extremum problem: \[…

Metric Geometry · Mathematics 2021-05-11 Gergely Ambrus , Bo Bai , Jianfeng Hou

The lack of interoperability between cellular access networks has long been a challenging burden, which telecommunication engineers and researchers are trying to overcome. In second generation networks for example, this problem lies in the…

Networking and Internet Architecture · Computer Science 2015-06-05 Hasni Neji , Ridha Bouallegue

Orthogonal coding schemes, known to asymptotically achieve the capacity per unit cost (CPUC) for single-user ergodic memoryless channels with a zero-cost input symbol, are investigated for single-user compound memoryless channels, which…

Information Theory · Computer Science 2009-09-29 Wenyi Zhang , Urbashi Mitra

A drawing of a graph is greedy if for each ordered pair of vertices u and v, there is a path from u to v such that the Euclidean distance to v decreases monotonically at every vertex of the path. The existence of greedy drawings has been…

Large-scale networked systems typically operate under resource constraints, and it is also difficult to exactly obtain the network structure between nodes. To address these issues, this paper investigates a sparse optimal control for…

Optimization and Control · Mathematics 2025-07-25 Takuya Ikeda , Masaaki Nagahara

This paper studies a class of distributed optimization algorithms by a set of agents, where each agent has only access to its own local convex objective function, and jointly minimizes the sum of the functions. The communications among…

Optimization and Control · Mathematics 2016-11-11 Qingguo Lü , Huaqing Li

The development of mobile virtual network operators, where multiple wireless technologies (e.g. 3G and 4G) or operators with non-overlapping bandwidths are pooled and shared is expected to provide enhanced service with broader coverage,…

Information Theory · Computer Science 2016-03-23 Abishek Sankararaman , Jeong-woo Cho , Francois Baccelli

In this paper, we study the problem of massive connections over limited radio spectrum for the cellular Internet-of-Things (IoT) in the fifth-generation (5G) wireless network. To address the challenging issues associated with channel state…

Information Theory · Computer Science 2019-06-26 Rundong Jia , Xiaoming Chen , Caijun Zhong , Derrick Wing Kwan Ng , Hai Lin , Zhaoyang Zhang

We introduce a comprehensive analytical framework to compare between open access and closed access in two-tier femtocell networks, with regard to uplink interference and outage. Interference at both the macrocell and femtocell levels is…

Networking and Internet Architecture · Computer Science 2013-08-13 Wei Bao , Ben Liang

We provide a general framework for the problem of data offloading in a heterogeneous wireless network, where some demand of cellular users is served by a complementary network. The complementary network is either a small-cell network that…

Information Theory · Computer Science 2016-11-18 Chin Keong Ho , Di Yuan , Sumei Sun

We consider a homogeneous multiple cellular scenario with multiple users per cell, i.e., $K\geq 1$ where $K$ denotes the number of users in a cell. In this scenario, a degrees of freedom outer bound as well as an achievable scheme that…

Information Theory · Computer Science 2011-08-09 Taejoon Kim , David J. Love , Bruno Clerckx , Duckdong Hwang