scholarly journals Distributed link scheduling in wireless networks

2020 ◽  
Vol 12 (05) ◽  
pp. 2050058
Author(s):  
Jean-Claude Bermond ◽  
Dorian Mazauric ◽  
Vishal Misra ◽  
Philippe Nain
Keyword(s):  
Wireless Networks ◽  
San Diego ◽  
Scheduling Algorithm ◽  
Sufficient Conditions ◽  
Link Scheduling ◽  
Local Algorithm ◽  
Global Knowledge ◽  
Control Phase ◽  
Binary Model ◽  
Active Link

This work investigates distributed transmission scheduling in wireless networks. Due to interference constraints, “neighboring links” cannot be simultaneously activated, otherwise transmissions will fail. Here, we consider any binary model of interference. We use the model described by Bui et al. in [L. X. Bui, S. Sanghavi and R. Srikant, Distributed link scheduling with constant overhead, IEEE/ACM Trans. Netw. 17(5) (2009) 1467–1480; S. Sanghavi, L. Bui and R. Srikant, Distributed link scheduling with constant overhead, in Proc. ACM Sigmetrics (San Diego, CA, USA, 2007), pp. 313–324.]. We assume that time is slotted and during each slot there are two phases: one control phase in which a link scheduling algorithm determines a set of non-interfering links to be activated, and a data phase in which data is sent through these links. We assume random arrivals on each link during each slot, so that a queue is associated to each link. Since nodes do not have a global knowledge of the queues sizes, our aim (like in [L. X. Bui, S. Sanghavi and R. Srikant, Distributed link scheduling with constant overhead, IEEE/ACM Trans. Netw. 17(5) (2009) 1467–1480; S. Sanghavi, L. Bui and R. Srikant, Distributed link scheduling with constant overhead, in Proc. ACM Sigmetrics (San Diego, CA, USA, 2007), pp. 313–324.]) is to design a distributed link scheduling algorithm. To be efficient, the control phase should be as short as possible; this is done by exchanging control messages during a constant number of mini-slots (constant overhead). In this paper, we design the first fully distributed local algorithm with the following properties: it works for any arbitrary binary interference model; it has a constant overhead (independent of the size of the network and the values of the queues), and it does not require any knowledge of the queue-lengths. We prove that this algorithm gives a maximal set of active links, where for any non-active link there exists at least one active link in its interference set. We also establish sufficient conditions for stability under general Markovian assumptions. Finally, the performance of our algorithm (throughput, stability) is investigated and compared via simulations to that of previously proposed schemes.

scholarly journals Shortest Link Scheduling in Wireless Networks Under The Rayleigh Fading Model

2021 ◽  
Author(s):  
Baogui Huang ◽  
Jiguo Yu ◽  
Chunmei Ma ◽  
Fengyin Li ◽  
Guangshun Li
Keyword(s):  
Wireless Networks ◽  
Rayleigh Fading ◽  
Scheduling Algorithm ◽  
Random Variable ◽  
Rayleigh Distribution ◽  
Interference Model ◽  
Link Scheduling ◽  
Signal Power ◽  
Schedule Delay ◽  
Radio Signals

Abstract Many shortest link scheduling algorithms adopt non-fading SINR interference model, which assumes that the received signal power will always remain determinate as long as the transmission power of the corresponding sender is fixed. In fact, because environment always influences the propagation of radio signals, the received signal power is by no means a certain value. Rayleigh fading is a statistical model for radio signals propagation. It assumes that the strength of a signal on a receiver is a random variable, varying with the Rayleigh distribution. This paper proposes a shortest link scheduling algorithm under the Rayleigh fading model (SLSRF). The SLSRF partitions the wireless network area into hexagons and colors the hexagons with 3 different colors such that two neighboring hexagons have different colors. The senders of the links scheduled simultaneously are arranged in hexagons with the same color. The correctness of the SLSRF is proved through theoretical analysis, and the efficiency is illustrated by elaborate simulations. Our simulation results demonstrate that the schedule delay of SLSRF is less than that of some results under the non-fading SINR interference model. Furthermore, we extend the SLSRF to a distributed version, which is suitable for large wireless networks.

scholarly journals Distributed Link Scheduling Algorithm Based on Successive Interference Cancellation in MIMO Wireless Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-12 ◽  
Author(s):  
Junhua Wu ◽  
Dandan Lin ◽  
Guangshun Li ◽  
Yuncui Liu ◽  
Yanmin Yin
Keyword(s):  
Wireless Networks ◽  
Interference Cancellation ◽  
Scheduling Algorithm ◽  
Multiple Input Multiple Output ◽  
Successive Interference Cancellation ◽  
Sensor Nodes ◽  
Link Scheduling ◽  
Mathematical Framework ◽  
Routing And Scheduling ◽  
Input Multiple Output

The performance of multiple input multiple output (MIMO) wireless networks is limited mainly by concurrent interference among sensor nodes. Effective link scheduling algorithms with the technology of successive interference cancellation (SIC) can maximize throughput in MIMO wireless networks. Most previous works on link scheduling in MIMO wireless networks did not consider SIC. In this paper, we propose a MIMO-SIC (MSIC) algorithm under the SINR model. First, a mathematical framework is established for the cross-layer optimization of routing and scheduling, with constraints of traffic balance and link capacity. Second, the interference regions are divided to characterize the level of interference between links. Finally, we propose a distributed link scheduling algorithm based on MSIC to eliminate the interference between competing links in the MIMO network. Experimental results show that the MSIC algorithm can increase the end-to-end throughput per unit by approximately 73% on average compared with non-SIC algorithms.

scholarly journals Shortest link scheduling in wireless networks under the Rayleigh fading model

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Baogui Huang ◽  
Jiguo Yu ◽  
Chunmei Ma ◽  
Fengyin Li ◽  
Guangshun Li
Keyword(s):  
Wireless Networks ◽  
Rayleigh Fading ◽  
Scheduling Algorithm ◽  
Random Variable ◽  
Rayleigh Distribution ◽  
Interference Model ◽  
Link Scheduling ◽  
Signal Power ◽  
Schedule Delay ◽  
Radio Signals

AbstractMany shortest link scheduling algorithms adopt non-fading SINR interference model, which assumes that the received signal power will always remain determinate as long as the transmission power of the corresponding sender is fixed. In fact, because environment always influences the propagation of radio signals, the received signal power is by no means a certain value. Rayleigh fading is a statistical model for radio signals propagation. It assumes that the strength of a signal on a receiver is a random variable, varying with the Rayleigh distribution. This paper proposes a shortest link scheduling algorithm under the Rayleigh fading model (SLSRF). The SLSRF partitions the wireless network area into hexagons and colors the hexagons with three different colors such that two neighboring hexagons have different colors. The senders of the links scheduled simultaneously are arranged in hexagons with the same color. The correctness of the SLSRF is proved through theoretical analysis, and the efficiency is illustrated by elaborate simulations. Our simulation results demonstrate that the schedule delay of SLSRF is less than that of some results under the non-fading SINR interference model. Furthermore, we extend the SLSRF to a distributed version, which is suitable for large wireless networks.

scholarly journals Link scheduling algorithm for industrial wireless networks applied to factory automation

2020 ◽  
Vol 53 (2) ◽  
pp. 8231-8236
Author(s):  
Gustavo P. Cainelli ◽  
Max Feldman ◽  
Gustavo Künzel ◽  
Ivan Müller ◽  
Carlos E. Pereira ◽  
...  
Keyword(s):  
Wireless Networks ◽  
Scheduling Algorithm ◽  
Link Scheduling ◽  
Factory Automation ◽  
Industrial Wireless Networks
Sign in / Sign up

Export Citation Format

Share Document