Related papers: Scheduling Under Fading and Partial Channel Inform…
One of the fundamental challenges in the design of distributed wireless networks is the large dynamic range of network state. Since continuous tracking of global network state at all nodes is practically impossible, nodes can only acquire…
We consider a computation offloading system where jobs are processed sequentially at a local server followed by a higher-capacity cloud server. The system offers two service modes, differing in how the processing is split between the…
Imposing fairness in resource allocation incurs a loss of system throughput, known as the Price of Fairness ($PoF$). In wireless scheduling, $PoF$ increases when serving users with very poor channel quality because the scheduler wastes…
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling…
In this paper, we propose downlink signal design and optimal uplink scheduling for the wireless powered communication networks (WPCNs). Prior works give attention to resource allocation in a static channel because users are equipped with…
Suppose sender-receiver transmission links in a downlink network at given data rate are subject to fading, path-loss and inter-cell interference, and that transmissions either pass, suffer loss, or incur retransmission delay. We introduce a…
Coordinated information processing by the base stations of multi-cell wireless networks enhances the overall quality of communication in the network. Such coordinations for optimizing any desired network-wide quality of service (QoS)…
We consider scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining…
This paper investigates the performance of wireless systems that employ finite-blocklength channel codes for transmission and operate under queueing constraints in the form of limitations on buffer overflow probabilities. A block fading…
In the conventional information theoretic analysis of multiterminal communication scenarios, it is often assumed that all of the distributed terminals use the communication channel simultaneously. However, in practical wireless…
In this paper, we consider the problem of link scheduling in multi-hop wireless networks under general interference constraints. Our goal is to design scheduling schemes that do not use per-flow or per-destination information, maintain a…
The design of a scheduling scheme is crucial for the efficiency and user-fairness of wireless networks. Assuming that the quality of all user channels is available to a central controller, a simple scheme which maximizes the utility…
Network coding is a highly efficient data dissemination mechanism for wireless networks. Since network coded information can only be recovered after delivering a sufficient number of coded packets, the resulting decoding delay can become…
Age-of-Information (AoI) is a recently proposed metric for quantifying the freshness of information from the UE's perspective in a communication network. Recently, Kadota et al. [1] have proposed an index-type approximately optimal…
This work studies remote state estimation of multiple linear time-invariant systems over shared wireless time-varying communication channels. We model the channel states by a semi-Markov process which captures both the random holding period…
In this paper, we consider a set of agents, which may receive an observation of their state by a central observa- tion post via a shared wireless network. The aim of this work is to design a scheduling mechanism for the central observation…
We consider a wireless node that randomly receives data from different sensor units. The arriving data must be compressed, stored, and transmitted over a wireless link, where both the compression and transmission operations consume power.…
Consider a wireless network where each communication link has a minimum bandwidth quality-of-service requirement. Certain pairs of wireless links interfere with each other due to being in the same vicinity, and this interference is modeled…
Optimization of information freshness in wireless networks has usually been performed based on queueing analysis that captures only the temporal traffic dynamics associated with the transmitters and receivers. However, the effect of…
In this paper, secure transmission of information over fading broadcast channels is studied in the presence of statistical queueing constraints. Effective capacity is employed as a performance metric to identify the secure throughput of the…