English
Related papers

Related papers: Delay-Optimal Probabilistic Scheduling with Arbitr…

200 papers

We study the problem of optimizing the decisions of a preemptively capable transmitter to minimize the Age of Incorrect Information (AoII) when the communication channel has a random delay. We consider a slotted-time system where a…

Information Theory · Computer Science 2023-02-21 Yutao Chen , Anthony Ephremides

We study the throughput-vs-delay trade-off in an overlay multi-channel single-secondary-user cognitive radio system. Due to the limited sensing capabilities of the cognitive radio user, channels are sensed sequentially. Maximizing the…

Information Theory · Computer Science 2016-12-28 Ahmed Ewaisha , Cihan Tepedelenlioglu

Age of Information (AoI) has attracted much attention recently due to its capability of characterizing the freshness of information. To improve information freshness over fading channels, efficient scheduling methods are highly desired for…

Information Theory · Computer Science 2020-02-24 Yalei Wang , Wei Chen

In this paper, we deal with the problem of jointly determining the optimal coding strategy and the scheduling decisions when receivers obtain layered data from multiple servers. The layered data is encoded by means of Prioritized Random…

Information Theory · Computer Science 2016-11-18 Nikolaos Thomos , Eymen Kurdoglu , Pascal Frossard , Mihaela Van der Schaar

We consider an energy harvesting transmitter broadcasting data to two receivers. Energy and data arrivals are assumed to occur at arbitrary but known instants. The goal is to minimize the total transmission time of the packets arriving…

Information Theory · Computer Science 2011-11-29 Hakan Erkal , F. Mehmet Ozcelik , Elif Uysal-Biyikoglu

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

Trajectory optimization considers the problem of deciding how to control a dynamical system to move along a trajectory which minimizes some cost function. Differential Dynamic Programming (DDP) is an optimal control method which utilizes a…

Systems and Control · Computer Science 2017-01-10 David D. Fan , Evangelos A. Theodorou

In this paper, we consider the dynamic power control for delay-aware D2D communications. The stochastic optimization problem is formulated as an infinite horizon average cost Markov decision process. To deal with the curse of…

Information Theory · Computer Science 2015-04-09 Wei Wang , Fan Zhang , Vincent K. N. Lau

Power grid load scheduling is a critical task that ensures the balance between electricity generation and consumption while minimizing operational costs and maintaining grid stability. Traditional optimization methods often struggle with…

Machine Learning · Computer Science 2024-10-24 Dongwen Luo

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

Distributed opportunistic scheduling is studied for wireless ad-hoc networks, where many links contend for one channel using random access. In such networks, distributed opportunistic scheduling (DOS) involves a process of joint channel…

Information Theory · Computer Science 2016-11-17 Dong Zheng , Man-On Pun , Weiyan Ge , Junshan Zhang , H. Vincent Poor

Cognitive radio (CR) has been considered as a promising technology to enhance spectrum efficiency via opportunistic transmission at link level. Basic CR features allow SUs to transmit only when the licensed primary channel is not occupied…

Networking and Internet Architecture · Computer Science 2016-10-04 Oussama Habachi , Yezekael Hayel , Rachid El-Azouzi

We introduce and study constrained Markov Decision Processes (cMDPs) with anytime constraints. An anytime constraint requires the agent to never violate its budget at any point in time, almost surely. Although Markovian policies are no…

Machine Learning · Computer Science 2024-06-14 Jeremy McMahan , Xiaojin Zhu

In this paper, energy efficient power allocation for the uplink of a multi-cell massive MIMO system is investigated. With the simplified power consumption model, the problem of power allocation is formulated as a constrained Markov decision…

Information Theory · Computer Science 2017-03-22 Peng Li , Yanxiang Jiang , Wei Li , Fuchun Zheng , Xiaohu You

Throughput optimal scheduling policies in general require the solution of a complex and often NP-hard optimization problem. Related literature has shown that in the context of time-varying channels, randomized scheduling policies can be…

Networking and Internet Architecture · Computer Science 2016-11-17 Mahdi Lotfinezhad , Ben Liang , Elvino S. Sousa

To overcome the curse of dimensionality and curse of modeling in Dynamic Programming (DP) methods for solving classical Markov Decision Process (MDP) problems, Reinforcement Learning (RL) algorithms are popular. In this paper, we consider…

Machine Learning · Computer Science 2018-11-29 Arghyadip Roy , Vivek Borkar , Abhay Karandikar , Prasanna Chaporkar

This paper considers designing an optimal policy for deadline-constrained access in cognitive radio networks, where a secondary user needs to complete a packet transmission over the vacant spectrum within a delivery deadline. To minimize…

Systems and Control · Electrical Eng. & Systems 2023-05-23 Zhaolong Xue , Aoyu Gong , Yuan-Hsun Lo , Sirui Tian , Yijin Zhang

This paper considers the discrete convexity of a cross-layer on-off transmission control problem in wireless communications. In this system, a scheduler decides whether or not to transmit in order to optimize the long-term quality of…

Information Theory · Computer Science 2015-08-26 Ni Ding , Parastoo Sadeghi , Rodney A. Kennedy

Standard Markov decision process (MDP) and reinforcement learning algorithms optimize the policy with respect to the expected gain. We propose an algorithm which enables to optimize an alternative objective: the probability that the gain is…

Machine Learning · Computer Science 2023-03-06 Vincent Corlay , Jean-Christophe Sibel

With the rise of critical machine-to-machine applications, next generation wireless communication systems must be designed with strict constraints on the latency and reliability. A key question in this context relates to channel state…

Information Theory · Computer Science 2017-06-06 Sebastian Schiessl , Hussein Al-Zubaidy , Mikael Skoglund , James Gross
‹ Prev 1 3 4 5 6 7 10 Next ›