Related papers: On the Throughput-Delay Tradeoff in Cellular Multi…
Massive multiple-input multiple-output (MIMO) systems achieve high sum spectral efficiency by offering an order of magnitude increase in multiplexing gains. In time division duplexing systems, however, the reuse of uplink training pilots…
The quality of service (QoS) requirements are usually different from user to user in a multiaccess system, and it is necessary to take the different requirements into account when allocating the shared resources of the system. In this…
Towards the development of 6G mobile networks, it is promising to integrate a large number of devices from multi-dimensional platforms, and it is crucial to have a solid understanding of the theoretical limits of large-scale networks. We…
The fundamental diversity-multiplexing tradeoff of the three-node, multi-input, multi-output (MIMO), quasi-static, Rayleigh faded, half-duplex relay channel is characterized for an arbitrary number of antennas at each node and in which…
Supporting the quality of service of unlicensed users in cognitive radio networks is very challenging, mainly due to dynamic resource availability because of the licensed users' activities. In this paper, we study the optimal admission…
We study broadcast capacity and minimum delay scaling laws for highly mobile wireless networks, in which each node has to disseminate or broadcast packets to all other nodes in the network. In particular, we consider a cell partitioned…
In this paper, we investigate centralized scheduling strategies for cooperative incremental redundancy retransmissions in the slow-fading half-duplex multiple access multiple relay channel. Time Division Multiple Access is assumed for the…
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…
In cache-aided networks, the server populates the cache memories at the users during low-traffic periods, in order to reduce the delivery load during peak-traffic hours. In turn, there exists a fundamental trade-off between the delivery…
We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees, defined by instantaneous throughput and hard packet deadlines. Using a network slicing model to decouple the queueing dynamics between flows,…
In this work, we aim to obtain the optimal tradeoff between the average delay and the average power consumption in a communication system. In our system, the arrivals occur at each timeslot according to a Bernoulli arrival process and are…
This paper studies the instantaneous rate maximization and the weighted sum delay minimization problems over a K-user multicast channel, where multiple antennas are available at the transmitter as well as at all the receivers. Motivated by…
We consider a transmitter with mmWave/sub6 dual interfaces. Due to the intermittency of mmWave channel, the transmitter must schedule packets wisely across the interfaces to minimize the average delay by observing the system state. We…
In this study, a scheduling policy of layered decoding for quasi-cycle (QC) low-density parity-check (LDPC) codes with high throughput and good performance is designed. The influence of scheduling on the delay of the decoder's hardware…
Optimal delay-throughput trade-offs for two-dimensional i.i.d mobility models have been established in [23], where we showed that the optimal trade-offs can be achieved using rate-less codes when the required delay guarantees are sufficient…
A coflow is a collection of parallel flows belonging to the same job. It has the all-or-nothing property: a coflow is not complete until the completion of all its constituent flows. In this paper, we focus on optimizing \emph{coflow-level…
This paper investigates the performance of streaming codes in low-latency applications over a multi-link three-node relayed network. The source wishes to transmit a sequence of messages to the destination through a relay. Each message must…
In this paper, we consider CSMA policies for scheduling of multihop wireless networks with one-hop traffic. The main contribution of this paper is to propose Unlocking CSMA (U-CSMA) policy that enables to obtain high throughput with low…
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…
In this paper two scheduling models are addressed. First is the standard model (unicast) where requests (or jobs) are independent. The other is the broadcast model where broadcasting a page can satisfy multiple outstanding requests for that…