Related papers: Scheduling in Time-correlated Wireless Networks wi…
This paper considers peer-to-peer scheduling for a network with multiple wireless devices. A subset of the devices are mobile users that desire specific files. Each user may already have certain popular files in its cache. The remaining…
This paper considers a time-varying optimization problem associated with a network of systems, with each of the systems shared by (and affecting) a number of individuals. The objective is to minimize cost functions associated with the…
We investigate the network stability problem when two users are scheduled simultaneously. The key idea is to simultaneously transmit to more than one users experiencing different channel conditions by employing hierarchical modulation. For…
In this paper, we examine the fundamental trade-off between radiated power and achieved throughput in wireless multi-carrier, multiple-input and multiple-output (MIMO) systems that vary with time in an unpredictable fashion (e.g. due to…
In this work, we investigate the optimal dynamic packet scheduling policy in a wireless relay network (WRN). We model this network by two sets of parallel queues, that represent the subscriber stations (SS) and the relay stations (RS), with…
This paper proposes efficient multiple-access schemes for large wireless networks based on the transmitters' buffer state information and their transceivers' duplex transmission capability. First, we investigate the case of half-duplex…
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…
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…
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,…
In federated learning (FL), devices contribute to the global training by uploading their local model updates via wireless channels. Due to limited computation and communication resources, device scheduling is crucial to the convergence rate…
In large-scale resource-constrained wireless networks, such as those prevalent in the Internet of Things (IoT), efficient communication scheduling remains a critical challenge. Among the various approaches, Time Division Multiple Access…
In this paper, we propose a distributed throughput-optimal ad hoc wireless network scheduling algorithm, which is motivated by the celebrated simplex algorithm for solving linear programming (LP) problems. The scheduler stores a sparse set…
A trade-off between two QoS requirements of wireless sensor networks: query waiting time and validity (age) of the data feeding the queries, is investigated. We propose a Continuous Time Markov Decision Process with a drift that trades-off…
Radio resource sharing mechanisms are key to ensuring good performance in wireless networks. In their seminal paper \cite{tassiulas1}, Tassiulas and Ephremides introduced the Maximum Weighted Scheduling algorithm, and proved its…
We design a dynamic rate scheduling policy of Markov type via the solution (a social optimal Nash equilibrium point) to a utility-maximization problem over a randomly evolving capacity set for a class of generalized processor-sharing queues…
We consider a cognitive radio network with multiple primary users (PUs) and one secondary user (SU), where a spectrum server is utilized for spectrum sensing and scheduling the SU to transmit over one of the PU channels opportunistically.…
In cell-free massive multiple-input multiple-output (MIMO) networks, robust resource allocation is critical to ensure reliable system performance in the presence of channel uncertainties resulting from imperfect channel state information…
This paper considers a wireless powered communication network (WPCN), where multiple users harvest energy from a dedicated power station and then communicate with an information receiving station. Our goal is to investigate the maximum…
The performance of systems where multiple users communicate over wireless fading links benefits from channel-adaptive allocation of the available resources. Different from most existing approaches that allocate resources based on perfect…
In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in…