Related papers: Network Utility Maximization under Maximum Delay C…
One of the paramount advantages of multi-level cache-enabled (MLCE) networks is pushing contents proximity to the network edge and proactively caching them at multiple transmitters (i.e., small base-stations (SBSs), unmanned aerial vehicles…
Mobility-on-demand (MoD) ridesharing is a promising way to improve the occupancy rate of personal vehicles and reduce traffic congestion and emissions. Maximizing the number of passengers served and maximizing a profit target are major…
Recently, the pinching antenna systems (PASS) have attracted significant attention due to their ability to exploit dynamically reconfigurable pinching points along waveguides for flexible signal transmission. However, existing work largely…
Scheduling is a critical and challenging resource allocation mechanism for multihop wireless networks. It is well known that scheduling schemes that favor links with larger queue length can achieve high throughput performance. However,…
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…
Scheduling packets with end-to-end deadline constraints in multihop networks is an important problem that has been notoriously difficult to tackle. Recently, there has been progress on this problem in the worst-case traffic setting, with…
In this paper, we consider a wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point (HAP) in full-duplex mode. Each user has to transmit…
We studied power splitting-based simultaneous wireless information and power transfer (PS-SWIPT) in multiple access channels (MAC), considering the decoding cost and non-linear energy harvesting (EH) constraints at the receiving nodes to…
We are given a set of $n$ jobs that have to be executed on a set of $m$ speed-scalable machines that can vary their speeds dynamically using the energy model introduced in [Yao et al., FOCS'95]. Every job $j$ is characterized by its release…
We consider a multi-class single server queueing network as a model of a packet switching network. The rates packets are sent into this network are controlled by queues which act as congestion windows. By considering a sequence of…
Through legislation and technical advances users gain more control over how their data is processed, and they expect online services to respect their privacy choices and preferences. However, data may be processed for many different…
We build on a recently proposed method for stepwise explaining solutions of Constraint Satisfaction Problems (CSP) in a human-understandable way. An explanation here is a sequence of simple inference steps where simplicity is quantified…
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…
We investigate the problem of network utility maximization in multiple gateways wireless mesh networks by considering Signal to Interference plus Noise Ratio (SINR) as the interference model. The aim is a cross layer design that considers…
In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput "epsilon-close" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to…
In this paper, we investigate a novel minimum length scheduling problem to determine the optimal power control, and scheduling for constant and continuous rate models, while considering concurrent transmission of users, energy causality,…
The introduction of Dynamic Adaptive Streaming over HTTP (DASH) helped reduce the consumption of resource in video delivery, but its client-based rate adaptation is unable to optimally use the available end-to-end network bandwidth. We…
We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…
In this paper, we study the performance of greedy scheduling in multihop wireless networks, where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. The…
We study the optimal provision of information for two natural performance measures of queuing systems: throughput and makespan. A set of parallel links is equipped with deterministic capacities and stochastic travel times where the latter…