Abstract—The link scheduling in wireless multi-hop networks is addressed. Different from most of work that adopt the protocol interference model which merely take consideration of packet collisions, our proposed algorithms use the physical interference model to reflect the aggregated signal to interference and noise ratio (SINR), which is a more accurate abstraction of the real scenario. We first propose a centralized scheduling method based on the Integer Linear Programming (ILP) and resolve it by an approximate solution based on the randomized rounding method. The probability bound of getting a guaranteed approximate factor is given. We then extend the centralized algorithm to a distributed solution, which is favorable in wireless network...
Given n arbitrarily distributed single-hop wireless links, using the physical interference model, th...
The problem of developing distributed scheduling algorithms for high throughput in multihop wireless...
AbstractIn the interference scheduling problem, one is given a set of n communication requests descr...
Abstract—We study distributed link scheduling for throughput maximization in wireless networks. The ...
Abstract—We study throughput-optimum localized link scheduling in wireless networks. The majority of...
Latency minimization and capacity maximization are fundamental combinatorial optimization problems i...
Abstract—This paper proposes a new class of simple, dis-tributed algorithms for scheduling in multi-...
In this paper, we consider the classical problem of link scheduling in wireless networks under an ac...
We study efficient link scheduling for a multihop wireless network to maximize its throughput. Effic...
Abstract—The problem of scheduling transmission in single hop and multi-hop wireless networks with a...
Most distributed wireless scheduling schemes that are provably efficient have been developed under t...
Abstract—We study efficient interference-aware joint routing and TDMA link scheduling for a multihop...
Link scheduling under the physical interference model has been an ongoing research problem in multih...
The problem of transmission scheduling in single hop and multi-hop wireless networks has been extens...
In this letter we investigate link scheduling algorithms for throughput maximization in multicast wi...
Given n arbitrarily distributed single-hop wireless links, using the physical interference model, th...
The problem of developing distributed scheduling algorithms for high throughput in multihop wireless...
AbstractIn the interference scheduling problem, one is given a set of n communication requests descr...
Abstract—We study distributed link scheduling for throughput maximization in wireless networks. The ...
Abstract—We study throughput-optimum localized link scheduling in wireless networks. The majority of...
Latency minimization and capacity maximization are fundamental combinatorial optimization problems i...
Abstract—This paper proposes a new class of simple, dis-tributed algorithms for scheduling in multi-...
In this paper, we consider the classical problem of link scheduling in wireless networks under an ac...
We study efficient link scheduling for a multihop wireless network to maximize its throughput. Effic...
Abstract—The problem of scheduling transmission in single hop and multi-hop wireless networks with a...
Most distributed wireless scheduling schemes that are provably efficient have been developed under t...
Abstract—We study efficient interference-aware joint routing and TDMA link scheduling for a multihop...
Link scheduling under the physical interference model has been an ongoing research problem in multih...
The problem of transmission scheduling in single hop and multi-hop wireless networks has been extens...
In this letter we investigate link scheduling algorithms for throughput maximization in multicast wi...
Given n arbitrarily distributed single-hop wireless links, using the physical interference model, th...
The problem of developing distributed scheduling algorithms for high throughput in multihop wireless...
AbstractIn the interference scheduling problem, one is given a set of n communication requests descr...