相关论文: On the Throughput-Delay Tradeoff in Cellular Multi…

We analyze a MISO downlink channel where a multi-antenna transmitter communicates with a large number of single-antenna receivers. Using linear beamforming or nonlinear precoding techniques, the transmitter can serve multiple users…

Interference alignment (IA) is a promising technique for interference mitigation in multicell networks due to its ability to completely cancel the intercell interference through linear precoding and receive filtering. In small networks, the…

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…

Code-division multiple-access (CDMA) has the potential to support traffic sources with a wide range of quality of service (QoS) requirements. The traffic carrying capacity of CDMA channels under QoS constraints (such as delay guarantee) is,…

Exchange of crucial and confidential information leads to the unprecedented attention on the security problem in wireless networks. Though the security has been studied in a number of works, the joint optimization of the physical layer…

Multicasting in wireless systems is a natural way to exploit the redundancy in user requests in a Content Centric Network. Power control and optimal scheduling can significantly improve the wireless multicast network's performance under…

In this paper, we consider the problem of real-time transmission scheduling over time-varying channels. We first formulate the transmission scheduling problem as a Markov decision process (MDP) and systematically unravel the structural…

We study an uplink multi secondary user (SU) system having statistical delay constraints, and an average interference constraint to the primary user (PU). SUs with heterogeneous interference channel statistics, to the PU, experience…

A multi-hop two-way relay channel is considered in which all the terminals are equipped with multiple antennas. Assuming independent quasi-static Rayleigh fading channels and channel state information available at the receivers, we…

Consider a multihop wireless network serving multiple flows in which wireless link interference constraints are described by a link interference graph. For such a network, we design routing-scheduling policies that maximize the end-to-end…

This paper investigates the sum-rate gains brought by power allocation strategies in multicell massive multipleinput multiple-output systems, assuming time-division duplex transmission. For both uplink and downlink, we derive tractable…

The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing and adaptive transmission (MS-AT) is proposed. Under the framework of…

We study a simple question: when are dynamic relaying strategies essential in optimizing the diversity-multiplexing tradeoff (DMT) in half-duplex wireless relay networks? This is motivated by apparently two contrasting results even for a…

Caching at the base stations (BSs) has been widely adopted to reduce the delivery delay and alleviate the backhaul traffic between BSs and the core network. In this paper, we consider a collaborative content caching scheme among BSs in…

We study a problem of scheduling real-time traffic with hard delay constraints in an unreliable wireless channel. Packets arrive at a constant rate to the network and have to be delivered within a fixed number of slots in a fading wireless…

Previous work on relay networks has concentrated primarily on the diversity benefits of such techniques. This paper explores the possibility of also obtaining multiplexing gain in a relay network, while retaining diversity gain.…

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…

It is well known that opportunistic scheduling algorithms are throughput optimal under dynamic channel and network conditions. However, these algorithms achieve a hypothetical rate region which does not take into account the overhead…

We consider the pull-based broadcast scheduling model. In this model, there are n unit-sized pages of information available at the server. Requests arrive over time at the server asking for a specific page. When the server transmits a page,…

We consider the problem of distributed scheduling in wireless networks where heterogeneously delayed information about queue lengths and channel states of all links are available at all the transmitters. In an earlier work (by Reddy et al.…