相关论文: Once and for All: Scheduling Multiple Users Using …

We investigate the performance of First-In, First-Out (FIFO) queues over wireless networks. We characterize the stability region of a general scenario where an arbitrary number of FIFO queues, which are served by a wireless medium, are…

The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC contentions and dynamics. Moreover, asymmetric channel conditions…

The optimal scheduling of interfering links in a dense wireless network with full frequency reuse is a challenging task. The traditional method involves first estimating all the interfering channel strengths then optimizing the scheduling…

The surge in wireless devices and data traffic volume necessitates more efficient transmission methods. Multicasting has garnered consistent attention as a means to fulfill the increasing demand for more efficient data transmission methods.…

Reconfigurable intelligent surfaces (RIS) can be crucial in next-generation communication systems. However, designing the {RIS} phases according to the instantaneous channel state information (CSI) can be challenging in practice due to the…

Extra-large scale MIMO (XL-MIMO) is a key technology for meeting sixth-generation (6G) requirements for high-rate connectivity and uniform quality of service (QoS); however, its deployment is challenged by the prohibitive complexity of…

This paper considers the unavailability of complete channel state information (CSI) in ultra-dense cloud radio access networks (C-RANs). The user-centric cluster is adopted to reduce the computational complexity, while the incomplete CSI is…

Supporting immense throughput and ubiquitous connectivity holds paramount importance for future wireless networks. To this end, this letter focuses on how the spatial beams configured for legacy near-field (NF) users can be leveraged to…

We examine the stability of wireless networks whose users are distributed over a compact space. A subset of users is called {\it admissible} when their simultaneous activity obeys the prevailing interference constraints and, in each time…

In TSCH, which is a MAC mechanism set of the IEEE 802.15.4e amendment, calculation, construction, and maintenance of the packet transmission schedules are not defined. Moreover, to ensure optimal throughput, most of the existing scheduling…

To coexist with Wi-Fi friendly, a standalone long-term evolution network over unlicensed spectrum (LTE-U) under listen-before-talk (LBT) mechanism can only access channel in a random and intermittent way, which results in random and…

Most existing caching solutions for wireless networks rest on an unrealistic assumption that the file popularity distribution is perfectly known. In this paper, we consider optimal caching designs for perfect, imperfect and unknown file…

This paper proposes a dynamic primal-dual type algorithm to solve the optimal scheduling problem in wireless networks subject to uncertain parameters, which are generated by stochastic network processes such as random packet arrivals,…

This paper considers a wireless powered multiuser mobile edge computing (MEC) system, in which a multi-antenna hybrid access point (AP) wirelessly charges multiple users, and each user relies on the harvested energy to execute computation…

We propose a novel framework for wireless network scheduling with fairness using determinantal (point) processes. Our approach incorporates the repulsive nature of determinantal processes, generalizing traditional Aloha protocols that…

The rising popularity of Internet of things (IoT) has spurred technological advancements in mobile internet and interconnected systems. While offering flexible connectivity and intelligent applications across various domains, IoT service…

IEEE 802.11ax introduces orthogonal frequency division multiple access (OFDMA) to WiFi to support concurrent transmissions to a larger number of users. As bandwidth continues to grow, WiFi channels exhibit increased frequency selectivity,…

Coded caching (CC) schemes exploit the cumulative cache memory of the users and simple linear coding to turn unicast traffic (individual file requests) into a multicast transmission. For the originally proposed $K$-user single-server/single…

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…

The highly directional beams applied in millimeter wave (mmWave) cellular networks make it possible to achieve near interference-free (NIF) transmission under judiciously designed space-time user scheduling, where the power of…