English
Related papers

Related papers: Throughput Optimal Multi-user Scheduling via Hiera…

200 papers

In this paper, we propose a joint dynamic power control and user pairing algorithm for power-efficient and low-latency hybrid multiple access systems. In a hybrid multiple access system, user pairing determines whether the transmitter…

Signal Processing · Electrical Eng. & Systems 2019-08-13 Minseok Choi , Joongheon Kim , Jaekyun Moon

Multi-User scheduling is a challenging problem under the relaying scenarios. Traditional schemes, which are based on the instantaneous signal-to-interference-plus-noises ratios (SINRs), cannot solve the inherent disparities of the qualities…

Information Theory · Computer Science 2018-02-23 Pihe Hu , Cheng Li , Dingjie Xu , Bin Xia

We present a number of novel algorithms, based on mathematical optimization formulations, in order to solve a homogeneous multiprocessor scheduling problem, while minimizing the total energy consumption. In particular, for a system with a…

Operating Systems · Computer Science 2015-11-13 Mason Thammawichai , Eric C. Kerrigan

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

We propose a distributed algorithm for controlling traffic signals, allowing constraints such as periodic switching sequences of phases and minimum and maximum green time to be incorporated. Our algorithm is adapted from backpressure…

Systems and Control · Computer Science 2014-07-07 Tichakorn Wongpiromsarn , Tawit Uthaicharoenpong , Emilio Frazzoli , Yu Wang , Danwei Wang

Load balancing plays a critical role in efficiently dispatching jobs in parallel-server systems such as cloud networks and data centers. A fundamental challenge in the design of load balancing algorithms is to achieve an optimal trade-off…

Performance · Computer Science 2020-12-16 Mark van der Boor , Sem Borst , Johan van Leeuwaarden

It is well known that opportunistic scheduling algorithms are throughput optimal under full knowledge of channel and network conditions. However, these algorithms achieve a hypothetical achievable rate region which does not take into…

Networking and Internet Architecture · Computer Science 2013-07-05 Mehmet Karaca , Yunus Sarikaya , Ozgur Ercetin , Tansu Alpcan , Holger Boche

Next-generation wireless networks need to handle massive user access effectively. This paper addresses the problem of joint group scheduling and multicast beamforming for downlink transmission with many active user groups. Aiming to…

Information Theory · Computer Science 2024-06-26 Chong Zhang , Min Dong , Ben Liang , Ali Afana , Yahia Ahmed

In this paper, we study the downlink multi-user scheduling problem for a time-slotted system with simultaneous wireless information and power transfer. In particular, in each time slot, a single user is scheduled to receive information,…

Information Theory · Computer Science 2013-10-01 Rania Morsi , Diomidis S. Michalopoulos , Robert Schober

Millimeter-wave (mmWave) communication is a promising technology to cope with the exponential increase in 5G data traffic. Such networks typically require a very dense deployment of base stations. A subset of those, so-called macro base…

Networking and Internet Architecture · Computer Science 2020-07-07 Dingwen Yuan , Hsuan-Yin Lin , Jörg Widmer , Matthias Hollick

In beam-based massive multiple-input multiple-output systems, signals are processed spatially in the radio-frequency (RF) front-end and thereby the number of RF chains can be reduced to save hardware cost, power consumptions and pilot…

Information Theory · Computer Science 2017-11-21 Zhiyuan Jiang , Sheng Chen , Sheng Zhou , Zhisheng Niu

We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the…

Networking and Internet Architecture · Computer Science 2012-03-20 Eyjolfur I. Asgeirsson , Magnus M. Halldorsson , Pradipta Mitra

It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate region which does not take into account the overhead…

Networking and Internet Architecture · Computer Science 2019-11-12 Mehmet Karaca , Tansu Alpcan , Ozgur Ercetin

In this paper, we design the first streaming algorithms for the problem of multitasking scheduling on parallel machines with shared processing. In one pass, our streaming approximation schemes can provide an approximate value of the optimal…

Data Structures and Algorithms · Computer Science 2022-04-06 Bin Fu , Yumei Huo , Hairong Zhao

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

We consider the problem of scheduling packets of different lengths via a directed communication link prone to jamming errors. Dynamic packet arrivals and errors are modelled by an adversary. We focus on estimating relative throughput of…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-10-21 Tomasz Jurdzinski , Dariusz R. Kowalski , Krzysztof Lorys

Broadcasting systems such as P2P streaming systems represent important network applications that support up to millions of online users. An efficient broadcasting mechanism is at the core of the system design. Despite substantial efforts on…

Networking and Internet Architecture · Computer Science 2013-12-13 Shaoquan Zhang

Dynamic spectrum access (DSA) enables secondary networks to find and efficiently exploit spectrum opportunities. A key factor to design a DSA network is the spectrum sensing algorithms for multiple channels with multiple users. Multi-user…

Information Theory · Computer Science 2015-05-21 Chun-Hao Liu , Arash Azarfar , Jean-Francois Frigon , Brunilde Sanso , Danijela Cabric

We consider a single-hop switched queueing network. Amongst a plethora of applications, these networks have been used to model wireless networks and input queued switches. The MaxWeight scheduling policies have proved popular, chiefly,…

Optimization and Control · Mathematics 2013-01-17 N. S. Walton

Consider a Compute and Forward (CF) relay network with $L$ users and a single relay. The relay tries to decode a linear function of the transmitted signals. For such a network, letting all $L$ users transmit simultaneously, especially when…

Information Theory · Computer Science 2018-11-07 Ori Shmuel , Asaf Cohen , Omer Gurewitz
‹ Prev 1 3 4 5 6 7 10 Next ›