English
Related papers

Related papers: Delay Constrained Scheduling over Fading Channels:…

200 papers

A delay-constrained scheduling problem for point-to-point communication is considered: a packet of $B$ bits must be transmitted by a hard deadline of $T$ slots over a time-varying channel. The transmitter/scheduler must determine how many…

Information Theory · Computer Science 2008-07-23 Juyul Lee , Nihar Jindal

A hard-deadline, opportunistic scheduling problem in which $B$ bits must be transmitted within $T$ time-slots over a time-varying channel is studied: the transmitter must decide how many bits to serve in each slot based on knowledge of the…

Information Theory · Computer Science 2009-07-01 Juyul Lee , Nihar Jindal

An energy-limited source trying to transmit multiple packets to a destination with possibly different sizes is considered. With limited energy, the source cannot potentially transmit all bits of all packets. In addition, there is a delay…

Information Theory · Computer Science 2017-11-15 Rahul Vaze , Shreyas Chaudhari , Akshat Choube , Nitin Aggarwal

In this paper, we consider a multiple-access fading channel where $N$ users transmit to a single base station (BS) within a limited number of time slots. We assume that each user has a fixed amount of energy available to be consumed over…

Information Theory · Computer Science 2017-02-10 Antonious M. Girgis , Amr El-Keyi , Mohammed Nafie

Energy or time-efficient scheduling is of particular interest in wireless communications, with applications in sensor network design, cellular communications, and more. In many cases, wireless packets to be transmitted have deadlines that…

Information Theory · Computer Science 2023-05-23 Mustafa Can Gursoy , Urbashi Mitra

Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these…

Networking and Internet Architecture · Computer Science 2014-05-06 Bin Li , Atilla Eryilmaz

This paper develops a novel approach to obtaining energy-efficient transmission schedules for delay-limited bursty data arrivals under non-ideal circuit power consumption. Assuming a-prior knowledge of packet arrivals, deadlines and channel…

Information Theory · Computer Science 2015-03-27 Zheng Nan , Tianyi Chen , Xin Wang , Wei Ni

Source-channel coding for an energy limited wireless sensor node is investigated. The sensor node observes independent Gaussian source samples with variances changing over time slots and transmits to a destination over a flat fading…

Information Theory · Computer Science 2016-11-17 Oner Orhan , Deniz Gunduz , Elza Erkip

This paper considers an energy-efficient packet scheduling problem over quasi-static block fading channels. The goal is to minimize the total energy for transmitting a sequence of data packets under the first-in-first-out rule and strict…

Information Theory · Computer Science 2016-11-17 Shengfeng Xu , Tsung-Hui Chang , Shih-Chun Lin , Chao Shen , Gang Zhu

We propose a bit-allocation scheme for powerline orthogonal frequency-division multiplexing (OFDM) that minimizes total transmit energy subject to total-bit and delay constraints. Multiple delay requirements stem from different sets of data…

Information Theory · Computer Science 2020-01-20 Kaemmatat Jiravanstit , Wiroonsak Santipach

A power optimal scheduling algorithm that guarantees desired throughput and bounded delay to each user is developed for fading multi-access multi-band systems. The optimization is over the joint space of all rate allocation and coding…

Information Theory · Computer Science 2007-07-13 Prasanna Chaporkar , Kimmo Kansanen , Ralf R. Müller

We consider optimal/efficient power allocation policies in a single/multihop wireless network in the presence of hard end-to-end deadline delay constraints on the transmitted packets. Such constraints can be useful for real time voice and…

Networking and Internet Architecture · Computer Science 2017-02-17 Satya V Kumar , Vinod Sharma

In this paper, we consider the problem of power efficient uplink scheduling in a Time Division Multiple Access (TDMA) system over a fading wireless channel. The objective is to minimize the power expenditure of each user subject to…

Networking and Internet Architecture · Computer Science 2007-10-08 Nitin Salodkar , Abhay Karandikar , Vivek S. Borkar

We consider multi-hop wireless networks serving multiple flows in which only packets that meet hard end-to-end deadline constraints are useful, i.e., if a packet is not delivered to its destination node by its deadline, it is dropped from…

Networking and Internet Architecture · Computer Science 2021-04-27 Rahul Singh , P. R. Kumar

We investigate energy-efficiency issues and resource allocation policies for time division multi-access (TDMA) over fading channels in the power-limited regime. Supposing that the channels are frequency-flat block-fading and transmitters…

Information Theory · Computer Science 2007-07-13 Xin Wang , Georgios B. Giannakis

In this paper a scheduling policy is presented which minimizes the average delay of the users. The scheduling scheme is investigated both by analysis and simulations carried out in the context of Orthogonal Frequency Division Multiplexing…

Information Theory · Computer Science 2011-11-09 Chan Zhou , Gerhard Wunder

We study the problem of serving randomly arriving and delay-sensitive traffic over a multi-channel communication system with time-varying channel states and unknown statistics. This problem deviates from the classical…

Networking and Internet Architecture · Computer Science 2018-11-28 Semih Cayci , Atilla Eryilmaz

This paper considers optimization of power and delay in a time-varying wireless link using rateless codes. The link serves a sequence of variable-length packets. Each packet is coded and transmitted over multiple slots. Channel conditions…

Information Theory · Computer Science 2015-10-13 Xiaohan Wei , Michael J. Neely

In this work, we address the delay optimal scheduling problem for wireless transmission with fixed modulation over multi-state fading channels. We propose a stochastic scheduling policy which schedules the source to transmit with…

Information Theory · Computer Science 2015-09-18 Juan Liu , Wei Chen , Khaled B. Letaief

We consider the problem of scheduling a set of $n$ tasks on $m$ processors under precedence, communication, and global system energy constraints to minimize makespan. We extend existing scheduling models to account for energy usage and give…

Data Structures and Algorithms · Computer Science 2011-05-27 David Felber , Adam Meyerson
‹ Prev 1 2 3 10 Next ›