English
Related papers

Related papers: Competitive Ratio Analysis of Online Algorithms to…

200 papers

Energy harvesting (EH) has been developed to extend the lifetimes of energy-limited communication systems. In this letter, we consider a single-user EH communication system, in which both of the arrival data and the harvested energy curves…

Information Theory · Computer Science 2017-01-20 Milad Rezaee , Mahtab Mirmohseni , Mohammad Reza Aref

Transmitter-receiver energy harvesting model is assumed, where both the transmitter and receiver are powered by random energy source. Given a fixed number of bits, the problem is to find the optimal transmission power profile at the…

Information Theory · Computer Science 2014-10-07 Rushil Nagda , Siddharth Satpathi , Rahul Vaze

A joint transmitter-receiver energy harvesting model is considered, where both the transmitter and receiver are powered by (renewable) energy harvesting source. Given a fixed number of bits, the problem is to find the optimal transmission…

Information Theory · Computer Science 2016-11-15 Siddhartha Satpathi , Rushil Nagda , Rahul Vaze

We consider the optimal packet scheduling problem in a single-user energy harvesting wireless communication system. In this system, both the data packets and the harvested energy are modeled to arrive at the source node randomly. Our goal…

Information Theory · Computer Science 2010-10-08 Jing Yang , Sennur Ulukus

Energy harvesting has been developed as an effective technology for communication systems in order to extend the lifetime of these systems. In this work, we consider a singleuser energy harvesting wireless communication system, in which…

Information Theory · Computer Science 2016-01-25 Milad Rezaee , Mahtab Mirmohseni , Mohammad Reza Aref

The problem of online packet scheduling to minimize the required conventional grid energy for transmitting a fixed number of packets given a common deadline is considered. The total number of packets arriving within the deadline is known,…

Information Theory · Computer Science 2016-02-05 Aditya Deshmukh , Rahul Vaze

We consider a node where packets of fixed size (in bits) are generated at arbitrary intervals. The node is required to maintain the peak age of information (AoI) at the monitor below a threshold by transmitting potentially a subset of the…

Information Theory · Computer Science 2023-05-02 Kumar Saurav , Rahul Vaze

The high proportions of demand charges in electric bills motivate large-power customers to leverage energy storage for reducing the peak procurement from the outer grid. Given limited energy storage, we expect to maximize the peak-demand…

Systems and Control · Electrical Eng. & Systems 2021-08-25 Yanfang Mo , Qiulin Lin , Minghua Chen , Si-Zhao Joe Qin

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 consider online scheduling weighted packets with time constraints over a fading channel. Packets arrive at the transmitter in an online manner. Each packet has a value and a deadline by which it should be sent. The fade state of the…

Information Theory · Computer Science 2009-09-30 Fei Li , Zhi Zhang

A general theory of online power control for discrete-time battery limited energy harvesting communications is developed, which leads to, among other things, an explicit characterization of a maximin optimal policy. This policy only…

Information Theory · Computer Science 2021-03-26 Shengtian Yang , Jun Chen

As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling…

Information Theory · Computer Science 2013-05-21 Baran Tan Bacinoglu , Elif Uysal-Biyikoglu

In the setting of online algorithms, the input is initially not present but rather arrive one-by-one over time and after each input, the algorithm has to make a decision. Depending on the formulation of the problem, the algorithm might be…

Data Structures and Algorithms · Computer Science 2020-01-10 Mustafa Safa Ozdayi

The minimization of transmission completion time for a given number of bits per user in an energy harvesting communication system, where energy harvesting instants are known in an offline manner is considered. An achievable rate region with…

Information Theory · Computer Science 2011-02-28 Mehmet Akif Antepli , Elif Uysal-Biyikoglu , Hakan Erkal

We consider the online resource minimization problem in which jobs with hard deadlines arrive online over time at their release dates. The task is to determine a feasible schedule on a minimum number of machines. We rigorously study this…

Data Structures and Algorithms · Computer Science 2015-12-09 Lin Chen , Nicole Megow , Kevin Schewior

Online decision-making in the presence of uncertain future information is abundant in many problem domains. In the critical problem of energy generation scheduling for microgrids, one needs to decide when to switch energy supply between a…

Systems and Control · Electrical Eng. & Systems 2022-10-20 Ali Menati , Sid Chi-Kin Chau , Minghua Chen

Communication over a broadband fading channel powered by an energy harvesting transmitter is studied. Assuming non-causal knowledge of energy/data arrivals and channel gains, optimal transmission schemes are identified by taking into…

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

The offline problem of transmission completion time minimization for an energy harvesting transmitter under fading is extended to allow packet arrivals during transmission. A method for computing an optimal power and rate allocation (i.e.,…

Information Theory · Computer Science 2012-08-01 F. Mehmet Ozcelik , Goksel Uctu , Elif Uysal-Biyikoglu

We propose a new approach to competitive analysis in online scheduling by introducing the novel concept of competitive-ratio approximation schemes. Such a scheme algorithmically constructs an online algorithm with a competitive ratio…

Data Structures and Algorithms · Computer Science 2012-11-01 Elisabeth Günther , Olaf Maurer , Nicole Megow , Andreas Wiese

Motivated by damage due to heating in sensor operation, we consider the throughput optimal offline data scheduling problem in an energy harvesting transmitter such that the resulting temperature increase remains below a critical level. We…

Information Theory · Computer Science 2016-11-18 Omur Ozel , Sennur Ulukus , Pulkit Grover
‹ Prev 1 2 3 10 Next ›