Shortest link scheduling algorithms in wireless networks under the SINR model
This paper considers the shortest link scheduling problem in wireless networks under the
signal-to-interferenceplus-noise ratio (SINR) model. We propose an O (log (l max/l min)) …
signal-to-interferenceplus-noise ratio (SINR) model. We propose an O (log (l max/l min)) …
Efficient link scheduling in wireless networks under Rayleigh-fading and multiuser interference
Link scheduling plays a key role in the network capacity and the transmission delay. In this
paper, we study the problem of maximum link scheduling (MLS), aiming to characterize the …
paper, we study the problem of maximum link scheduling (MLS), aiming to characterize the …
The controller placement problem for wireless SDN
The software defined networking paradigm decouples the network's control logic (the control
plane) from the underlying routers and switches (the data plane), promoting centralization of …
plane) from the underlying routers and switches (the data plane), promoting centralization of …
Efficient link scheduling solutions for the internet of things under rayleigh fading
Link scheduling is an appealing solution for ensuring the reliability and latency requirements
of Internet of Things (IoT). Most existing results on the link scheduling problem were based …
of Internet of Things (IoT). Most existing results on the link scheduling problem were based …
Connectivity maintenance for next-generation decentralized vehicle platoon networks
Always keeping a certain distance between vehicles in a platoon system is important for
collision avoidance. Centralized platoon systems let the leader vehicle determine and notify …
collision avoidance. Centralized platoon systems let the leader vehicle determine and notify …
How well can graphs represent wireless interference?
MM Halldórsson, T Tonoyan - Proceedings of the forty-seventh annual …, 2015 - dl.acm.org
Efficient use of a wireless network requires that transmissions be grouped into feasible sets,
where feasibility means that each transmission can be successfully decoded in spite of the …
where feasibility means that each transmission can be successfully decoded in spite of the …
Localized and distributed link scheduling algorithms in IoT under Rayleigh fading
Abstract The Internet of Things (IoT) is rapidly gaining ground in future wireless
communications. Transmission reliability and latency are two significant measurements for …
communications. Transmission reliability and latency are two significant measurements for …
A reassessment on applying protocol interference model under rayleigh fading: From perspective of link scheduling
Link scheduling plays a pivotal role in accommodating stringent reliability and latency
requirements. In this paper, we focus on the availability and effectiveness of applying …
requirements. In this paper, we focus on the availability and effectiveness of applying …
Dynamic packet scheduling in wireless networks
T Kesselheim - Proceedings of the 2012 ACM symposium on …, 2012 - dl.acm.org
We consider protocols that serve communication requests arising over time in a wireless
network that is subject to interference. Unlike previous approaches, we take the geometry of …
network that is subject to interference. Unlike previous approaches, we take the geometry of …
Implementing the abstract MAC layer via inductive coloring under the Rayleigh-fading model
In this paper, we study distributed algorithms to realize efficient communications under the
Rayleigh-fading model. This model extends the popular deterministic SINR model using …
Rayleigh-fading model. This model extends the popular deterministic SINR model using …