Related papers: Asymptotically optimal pilot allocation over Marko…
We consider the scheduling problem in downlink wireless networks with heterogeneous, Markov-modulated, ON/OFF channels. It is well-known that the performance of scheduling over fading channels relies heavily on the accuracy of the available…
In this paper, we investigate a general delay-aware channel allocation problem where the number of channels is less than that of users. Due to the proliferation of delay sensitive applications, the objective of our problem is chosen to be…
In this paper, we consider a queueing system with multiple channels (or servers) and multiple classes of users. We aim at allocating the available channels among the users in such a way to minimize the expected total average queue length of…
Reconfigurable intelligent surface (RIS) is a promising technology that enables the customization of electromagnetic propagation environments in next-generation wireless networks. In this paper, we investigate the optimal pilot power…
We propose a location-aware pilot allocation algorithm for a massive multiple-input multiple-output (MIMO) network with high-mobility users, where the wireless channels are subject to Rician fading. Pilot allocation in massive MIMO is a…
In wireless networks, algorithms for user association, i.e., the task of choosing the base station (BS) that every arriving user should join, significantly impact the network performance. A wireless network with multiple BSs, operating on…
In this work, for the first time, we tackle channel estimation design with pilots in the context of covert wireless communication. Specifically, we consider Rayleigh fading for the communication channel from a transmitter to a receiver and…
In a wireless network, the efficiency of scheduling algorithms over time-varying channels depends heavily on the accuracy of the Channel State Information (CSI), which is usually quite ``costly'' in terms of consuming network resources.…
The optimization of the pilot overhead in single-user wireless fading channels is investigated, and the dependence of this overhead on various system parameters of interest (e.g., fading rate, signal-to-noise ratio) is quantified. The…
We address the problem of opportunistic multiuser scheduling in downlink networks with Markov-modeled outage channels. We consider the scenario in which the scheduler does not have full knowledge of the channel state information, but…
We consider a class of restless multi-armed bandit problems (RMBP) that arises in dynamic multichannel access, user/server scheduling, and optimal activation in multi-agent systems. For this class of RMBP, we establish the indexability and…
We investigate the downlink scheduling problem under Markovian ON/OFF fading channels, where the instantaneous channel state information is not directly accessible, but is revealed via ARQ-type feedback. The scheduler can exploit the…
We study the problem of planning restless multi-armed bandits (RMABs) with multiple actions. This is a popular model for multi-agent systems with applications like multi-channel communication, monitoring and machine maintenance tasks, and…
We study the problem of scheduling packet transmissions with the aim of minimizing the energy consumption and data transmission delay of users in a wireless network in which spatial reuse of spectrum is employed. We approach this problem…
The multi-armed restless bandit framework allows to model a wide variety of decision-making problems in areas as diverse as industrial engineering, computer communication, operations research, financial engineering, communication networks…
Intelligent reflecting surface (IRS) is a promising technology that enables the precise control of the electromagnetic environment in future wireless communication networks. To leverage the IRS effectively, the acquisition of channel state…
Massive multi-input multi-output (Massive MIMO) has been recognized as a key technology to meet the demand for higher data capacity and massive connectivity. Nevertheless, the number of active users is restricted due to training overhead…
In this paper, we consider the problem of joint user scheduling and dynamic pilot allocation in a Time-Division Duplex (TDD) based Massive MIMO network under varying traffic condition. One of the main problems with Massive MIMO systems is…
Random access is necessary in crowded scenarios due to the limitation of pilot sequences and the intermittent pattern of device activity. Nowadays, most of the related works are based on independent and identically distributed (i.i.d.)…
We consider the problem of scheduling packet transmissions in a wireless network of users while minimizing the energy consumed and the transmission delay. A challenge is that transmissions of users that are close to each other mutually…