Related papers: On High Spatial Reuse Link Scheduling in STDMA Wir…
In Wireless Ad-hoc Networks, nodes are free to move randomly and organize themselves arbitrarily, thus topology may change quickly and capriciously. In Mobile Ad-hoc NETworks, specially Wireless Multi-hop Networks provide users with…
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…
It is shown that the performance of the maximal scheduling algorithm in wireless ad hoc networks under the hypergraph interference model can be further away from optimal than previously known. The exact worst-case performance of this…
Recently several CSMA algorithms based on the Glauber dynamics model have been proposed for multihop wireless scheduling, as viable solutions to achieve the throughput optimality, yet are simple to implement. However, their delay…
In this paper, we consider the problem of scheduling real-time traffic in wireless networks under a conflict-graph interference model and single-hop traffic. The objective is to guarantee that at least a certain fraction of packets of each…
4G wireless access systems require high spectral efficiency to support the ever increasing number of users and data rates for real time applications. Multi-antenna OFDM-SDMA systems can provide the required high spectral efficiency and…
We present an algorithm for multi-hop routing and scheduling of requests in wireless networks in the \sinr\ model. The goal of our algorithm is to maximize the throughput or maximize the minimum ratio between the flow and the demand. Our…
Despite the rich literature on scheduling algorithms for wireless networks, algorithms that can provide deadline guarantees on packet delivery for general traffic and interference models are very limited. In this paper, we study the problem…
We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…
The rules governing the availability and quality of connections in a wireless network are described by physical models such as the signal-to-interference & noise ratio (SINR) model. For a collection of simultaneously transmitting stations…
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…
Wireless ad hoc networks are power constrained since nodes operate with limited battery energy. Thus, energy consumption is crucial in the design of new ad hoc routing protocols. In order to maximize the lifetime of ad hoc networks, traffic…
In this paper an innovative Radio Resource Management (RRM) algorithm is proposed with the purpose of increasing High Speed Packet Access (HSPA) performances, in terms of system capacity and service quality, when the Multimedia Broadcast…
We consider the problem of optimal link scheduling in large-scale wireless ad hoc networks. We specifically aim for the maximum long-term average performance, subject to a minimum transmission requirement for each link to ensure fairness.…
In order to meet the ever-increasing demand for high throughput in WiFi networks, the IEEE 802.11ax (11ax) standard introduces orthogonal frequency division multiple access (OFDMA). In this letter, we address the station-resource unit…
In this paper, we study how to determine concurrent transmissions and the transmission power level of each link to maximize spectrum efficiency and minimize energy consumption in a wireless ad hoc network. The optimal joint transmission…
Future wireless networks will utilize extremely large-scale antenna arrays (ELAAs) over high-frequency bands, which, however, produce near-field spherical wavefronts and spatial wideband effects. To exploit and mitigate these, this paper…
The interference management technique that treats interference as noise (TIN) is optimal when the interference is sufficiently low. Scheduling algorithms based on the TIN optimality condition have recently been proposed, e.g., for…
In this work, we design and analyze novel distributed scheduling algorithms for multi-user MIMO systems. In particular, we consider algorithms which do not require sending channel state information to a central processing unit, nor do they…
In this paper, we study resource allocation for downlink orthogonal frequency division multiple access (OFDMA) systems with the objective to enable ultra-reliable low latency communication (URLLC). To meet the stringent delay requirements…