A dynamic slot scheduling for wireless sensors networks

Al-Ghamdi, Bandar; Ayaida, Marwane; Fouchal, Hacène

doi:10.1109/glocom.2014.7036834

Cited by 5 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They are usually repeated periodically. They present an algorithm that is able to provide a dynamic scheduling procedure for all tasks [9]. The above algorithms are all applicable in the case of a single channel; however, a lot of research indicates that a multiplexing multi-channel can be used to greatly improve the throughput of the network.…”

Section: Related Workmentioning

confidence: 99%

Study on Gibbs Optimization-Based Resource Scheduling Algorithm in Data Aggregation Networks

Ding

Xia

et al. 2022

Electronics

View full text Add to dashboard Cite

In data aggregation networks (WSNs, ad hoc, mesh, etc., it is key to schedule the network resources, such as channels and TDMA time slots, to minimize the communication conflict and optimize the network data-gathering performance. In this paper, the resources scheduling problem is formulated as a vertex coloring problem in graph theory. Then, a multi-channel TDMA scheduling algorithm based on the Gibbs optimization is proposed. By defining the Gibbs energy expression according to the objective function of the problem, the joint probability of channel and time slot can be computed for the optimized selection of channels and time slots. This algorithm is low-complexity and its convergence performance can be proven. Experiments with different network parameters demonstrate that the proposed algorithm can reduce the communication conflict, improve the network throughput, and effectively reduce the network transmission delay and scheduling length for the data aggregation networks.

show abstract

Section: Related Workmentioning

confidence: 99%

Study on Gibbs Optimization-Based Resource Scheduling Algorithm in Data Aggregation Networks

Ding

Xia

et al. 2022

Electronics

View full text Add to dashboard Cite

show abstract

“…An energy-balanced routing protocol for WSNs is proposed by Li and Donghui 21 with this algorithm, where the network is divided into several clusters using K-means++ algorithm. A dynamic slot scheduling in WSN is proposed by Al-Ghamdi et al, 22 which has different time constraints and is able to provide a dynamic scheduling procedure for all tasks. Huo and Wang 23 present an improved probabilistic routing algorithm based on the received signal strength indication (RSSI), which lowered the switching packages but it is assumed that the coverage of the sink node is able to access all nodes in WSN.…”

Section: Related Workmentioning

confidence: 99%

A wireless paging network with load-balancing equal opportunity routing in high-rise building construction

Yang

Liang

2018

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The energy consumption of nodes is strictly limited in wireless sensor networks. The traditional direct delivery routing protocol is employed in the paging network of high-rise building construction elevators, which results in the high energy consumption and low successful delivery rate. A load-balancing equal opportunity routing protocol for wireless paging network is proposed in this work. The load-balancing equal opportunity routing protocol is a data transfer technique which maintains the network survivability by selecting the optimal path with both the lower energy consumption and the balanced network load. A load-balancing scheme gives equal opportunities for package transmission. A pager node delivers the packages by selecting a neighbor node with higher energy. The neighbor nodes in the coverage of the source node have an equal opportunity for routing. The sink node in the paging network broadcasts routing messages when moving along the track during the path selecting. The proposed load-balancing equal opportunity routing protocol is implemented and evaluated in a high-rise building construction elevator. The experimental results show that the average energy consumption of nodes is lowered with a balanced network load. It is estimated that successful delivery rate is increased by 55% but with a higher latency, and the network lifetime is prolonged.

show abstract

“…This is why efficient scheduling algorithms are needed to overcome the stated drawbacks . The goal of this study is to propose two different scheduling approaches that will overcome the drawbacks of the static scheduling approach.…”

Section: Introductionmentioning

confidence: 99%

“…Many other studies have proposed various schemes to reduce energy consumption based on efficient medium access control (MAC) slot scheduling, smart clustering, random sleep period management, and so on. This is why efficient scheduling algorithms are needed to overcome the stated drawbacks [2,3]. The goal of this study is to propose two different scheduling approaches that will overcome the drawbacks of the static scheduling approach.…”

Section: Introductionmentioning

confidence: 99%

Scheduling approaches in beacon‐enabled mode for wireless sensor networks

Al-Ghamdi

Ayaida

Fouchal

2017

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Summary Efficient energy consumption is the most important challenge in wireless sensors networks. Many solutions have been proposed since many years as efficient medium access control protocols, smart sensing applications, appropriate task scheduling, and so on. Task scheduling allows could participate to optimise energy consumption, it aims to propose planning over repetitive time periods where sensors need to sleep, to collect data and to communicate. In this paper, we propose two scheduling procedures (semi‐dynamic and dynamic) which are executed over the ZigBee network in beacon‐enabled mode. Each of these algorithms has its own features and advantages. The Zigbee super‐frame is used as a means to inform each node on its duties (when to sleep or when to communicate). In order to evaluate our proposals, we have implemented them over TelosB motes running on operating system TinyOS. These algorithms have been implemented on the Z‐Monitor tool . We have compared our scheduling approaches to the usual static scheduling method provided by Zigbee. These evaluations show that our proposals enhance network lifetime and ensure better packet data rate and lower latency. Copyright © 2017 John Wiley & Sons, Ltd.

show abstract

A dynamic slot scheduling for wireless sensors networks

Cited by 5 publications

References 15 publications

Study on Gibbs Optimization-Based Resource Scheduling Algorithm in Data Aggregation Networks

Study on Gibbs Optimization-Based Resource Scheduling Algorithm in Data Aggregation Networks

A wireless paging network with load-balancing equal opportunity routing in high-rise building construction

Scheduling approaches in beacon‐enabled mode for wireless sensor networks

Contact Info

Product

Resources

About