We consider the problem of spectrum-based minimum-length scheduling of point-to-point links in a spatial TDMA (STDMA) wireless network where each node is equipped with a frequency agile radio capable of configuring the bandwidth on a per-slot basis. The problem formulation integrates the activation of multiple sets of links in the network, in a hybrid fashion (both time and frequency domain), while taking into account the Signal-to-Interference and Noise Ratio (SINR) at each receiver. We assume uniform (fixed) transmission power at all nodes and propose an algorithm based on a column generation approach, which allocates a common spectrum band for links that satisfy the SINR constraints at the receivers, and different spectrum bands for inte...
Abstract—This paper concerns the problem of finding the minimum-length TDMA frame of a power-control...
We study efficient link scheduling for a multihop wireless network to maximize its throughput. Effic...
Due to the inherent complexity of the power-controlled scheduling problem, finding optimal schedules...
We consider the problem of minimum-length scheduling of point-to-point links in a spatial TDMA (STDM...
Spatial reuse TDMA has been proposed as an access scheme for multi-hop radio networks where real-tim...
Abstract — In this paper, we revisit the problem of determining the minimum-length schedule that sat...
Abstract — We consider the problem of power controlled minimum frame length scheduling for TDMA wire...
The topic of the thesis is medium access which is one of the fundamental problems in wireless networ...
In wireless networks, the design of radio resource sharing mechanisms is complicated by the complex ...
Wireless MESH networks are a new networking paradigm that allow to extend the coverage of traditiona...
We propose a framework that produces robust schedules in collision-free medium access schemes. We de...
Abstract — Wireless MESH networks are a new networking paradigm that allow to extend the coverage of...
Abstract—Despite all the work being done so far in scheduling for wireless networks, the transmissio...
This article approaches the dynamic resource allocation problem for the downlink of a wireless mobil...
Abstract—In this paper, we address the minimum length scheduling problem in wireless networks, where...
Abstract—This paper concerns the problem of finding the minimum-length TDMA frame of a power-control...
We study efficient link scheduling for a multihop wireless network to maximize its throughput. Effic...
Due to the inherent complexity of the power-controlled scheduling problem, finding optimal schedules...
We consider the problem of minimum-length scheduling of point-to-point links in a spatial TDMA (STDM...
Spatial reuse TDMA has been proposed as an access scheme for multi-hop radio networks where real-tim...
Abstract — In this paper, we revisit the problem of determining the minimum-length schedule that sat...
Abstract — We consider the problem of power controlled minimum frame length scheduling for TDMA wire...
The topic of the thesis is medium access which is one of the fundamental problems in wireless networ...
In wireless networks, the design of radio resource sharing mechanisms is complicated by the complex ...
Wireless MESH networks are a new networking paradigm that allow to extend the coverage of traditiona...
We propose a framework that produces robust schedules in collision-free medium access schemes. We de...
Abstract — Wireless MESH networks are a new networking paradigm that allow to extend the coverage of...
Abstract—Despite all the work being done so far in scheduling for wireless networks, the transmissio...
This article approaches the dynamic resource allocation problem for the downlink of a wireless mobil...
Abstract—In this paper, we address the minimum length scheduling problem in wireless networks, where...
Abstract—This paper concerns the problem of finding the minimum-length TDMA frame of a power-control...
We study efficient link scheduling for a multihop wireless network to maximize its throughput. Effic...
Due to the inherent complexity of the power-controlled scheduling problem, finding optimal schedules...