English
Related papers

Related papers: Minimum Length Scheduling for Multi-cell Full Dupl…

200 papers

This paper studies the newly emerging wireless powered communication network (WPCN) in which one hybrid access point (H-AP) with constant power supply coordinates the wireless energy/information transmissions to/from distributed users that…

Information Theory · Computer Science 2014-07-22 Hyunsgsik Ju , Rui Zhang

We study the half-duplex multiple-relay channel (HD-MRC) where every node can either transmit or listen but cannot do both at the same time. We obtain a capacity upper bound based on a max-flow min-cut argument and achievable transmission…

Information Theory · Computer Science 2012-12-04 Lawrence Ong , Mehul Motani , Sarah J. Johnson

In this paper we address the problem of joint admission control and resource scheduling for \emph{Ultra Reliable Low Latency Communications} (URLLC). We examine two models: (i) the \emph{continuous}, where all allocated resource blocks…

Information Theory · Computer Science 2019-04-26 Apostolos Destounis , Georgios S. Paschos

Cell-free wireless networks have attracted significant interest for their ability to eliminate cell-edge effects and deliver uniformly high service quality through macro-diversity. In this paper, we develop an algorithm to jointly optimize…

Information Theory · Computer Science 2026-04-07 Achini Jayawardane , Rajitha Senanayake , Erfan Khordad , Jamie Evans

This paper studies the fundamental problem of how to reroute $k$ unsplittable flows of a certain demand in a capacitated network from their current paths to their respective new paths, in a congestion-free manner and fast. This scheduling…

Data Structures and Algorithms · Computer Science 2018-05-22 Saeed Akhoondian Amiri , Szymon Dudycz , Mahmoud Parham , Stefan Schmid , Sebastian Wiederrecht

We consider a set of transmitter-receiver pairs, or links, that share a common channel and address the problem of emptying backlogged queues at the transmitters in minimum time. The problem amounts to determining activation subsets of links…

Information Theory · Computer Science 2012-07-20 Vangelis Angelakis , Anthony Ephremides , Qing He , Di Yuan

In this paper we present new algorithms and analysis for the linear inverse sensor placement and scheduling problems over multiple time instances with power and communications constraints. The proposed algorithms, which deal directly with…

Information Theory · Computer Science 2018-02-14 Cristian Rusu , John Thompson , Neil M. Robertson

We address the problem of efficient data gathering in a wireless network through multi-hop communication. We focus on the objective of minimizing the maximum flow time of a data packet. We prove that no polynomial time algorithm for this…

Data Structures and Algorithms · Computer Science 2019-07-01 Vincenzo Bonifaci , Peter Korteweg , Alberto Marchetti-Spaccamela , Leen Stougie

We derive a fast and optimal algorithm for solving practical weighted max-min SINR problems in cell-free massive MIMO networks. For the first time, the optimization problem jointly covers long-term power control and distributed beamforming…

Information Theory · Computer Science 2022-09-01 Lorenzo Miretti , Renato Luis Garrido Cavalcante , Slawomir Stanczak

The noticeably increased deployment of wireless networks for battery-limited industrial applications in recent years highlights the need for tractable performance analysis methodologies as well as efficient QoS-aware transmit power…

Performance · Computer Science 2017-08-22 Neda Petreska , Hussein Al-Zubaidy , Rudi Knorr , James Gross

In this paper, we aim to maximize the energy efficiency of cellular wireless networks. Specifically, we address the power allocation problem in multi-cell multi-carrier systems. Considering realistic base station power consumption models,…

Networking and Internet Architecture · Computer Science 2016-10-18 Kemal Davaslioglu , Cemil Can Coskun , Ender Ayanoglu

Many data applications in the next generation cellular networks, such as content precaching and video progressive downloading, require flow-level quality of service (QoS) guarantees. One such requirement is deadline, where the transmission…

Information Theory · Computer Science 2012-10-04 Huasen Wu , Youguang Zhang , Xin Liu

We consider the problem of Joint Routing, Scheduling and Power-control (JRSP) problem for multihop wireless networks (MHWN) with multiple antennas. We extend the problem and a (sub-optimal) heuristic solution method for JRSP in MHWN with…

Networking and Internet Architecture · Computer Science 2011-10-04 Harish Vangala , Rahul Meshram , Prof. Vinod Sharma

We consider a virtualized RAN architecture for 5G networks where the Remote Units are connected to a central unit via a mid-haul. To support high data rates, the midhaul is realized with a Passive Optical Network (PON). In this…

Networking and Internet Architecture · Computer Science 2019-03-28 Abhishek Sinha , Matthew Andrews , Prasanth Ananth

We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate…

Networking and Internet Architecture · Computer Science 2016-11-15 Yufang Xi , Edmund M. Yeh

This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequency- division multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate…

Information Theory · Computer Science 2015-06-17 Mirza Golam Kibria , Hidekazu Murata

This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization and stochastic network theory have been successful in…

Networking and Internet Architecture · Computer Science 2009-12-13 Juan Jose Jaramillo , R. Srikant

Many practical wireless communications systems select their transmit rate from a finite set of modulation and coding schemes, which correspond to a set of discrete rates. In this paper, we therefore formulate a joint coordinated precoding…

Information Theory · Computer Science 2016-04-20 Rasmus Brandt , Mats Bengtsson

We consider mixed-integer optimal control problems with combinatorial constraints that couple over time such as minimum dwell times. We analyze a lifting and decomposition approach into a mixed-integer optimal control problem without…

Optimization and Control · Mathematics 2021-04-21 Simone Göttlich , Falk M. Hante , Andreas Potschka , Lars Schewe

Small cell enchantment is emerging as the key technique for wireless network evolution. One challenging problem for small cell enhancement is how to achieve high data rate with as-low-as-possible control and computation overheads. As a…

Networking and Internet Architecture · Computer Science 2014-02-12 Shuqin Li , Liyu Cai
‹ Prev 1 4 5 6 7 8 10 Next ›