A Distributed TDMA Scheduling Algorithm for Latency Minimization in Internet of Things

Batta, Mohamed Sofiane; Harous, Saad; Louail, Lemia; Aliouat, Zibouda

doi:10.1109/eit.2019.8833679

Cited by 11 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [35], Batta et al proposed an improved version of DRAND, called I-DRAND, which aims to provide a TDMA schedule for tree-based distributed networks. This algorithm follows almost exactly DRAND's four-state model.…”

Section: Related Workmentioning

confidence: 99%

A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks

Nguyen

Kim

2020

IEEE Access

View full text Add to dashboard Cite

In distributed wireless sensor networks (WSNs), TDMA protocols are a widely applied solution when a reliable data-transferring mechanism is in demand. However, to produce a TDMA schedule is not an easy task. During the scheduling, there can be a large number of conflicts due to the nature of radio access, which leads to a waste of operating time and energy. In this paper, we first present and discuss the concept of Topological Ordering, which is based mainly on the local neighborhood size. It is aimed to create an order of scheduling that helps reduce the competition and conflicts. Next, we propose a fast and effective distributed scheduling algorithm using Topological Ordering, called DSTO, to create a collision-free TDMA schedule. This algorithm is promising in terms of reducing running time and message collisions during the scheduling phase, which in turn reduces overall message overhead. At the same time, efficient time slot allocation, which translates to a shorter frame, is guaranteed. We implement DSTO together with two other distributed scheduling algorithms on OPNET Network Modeler and thoroughly analyze the comparative results to prove its validity and effectiveness.INDEX TERMS Distributed, DSTO, scheduling algorithm, TDMA, topological ordering, wireless sensor networks.

show abstract

Section: Related Workmentioning

confidence: 99%

A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks

Nguyen

Kim

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Sob este modelo foram propostos diversos trabalhos nos quais são apresentadas estratégias de comunicac ¸ão que utilizam algoritmos de escalonamento para obter maior eficiência na comunicac ¸ão. [Moscibroda and Wattenhofer 2006], [Goussevskaia et al 2010, Batta et al 2019.…”

Section: Introduc ¸ãOunclassified

Uma Estratégia Bioinspirada para Escalonamento em Redes Sem Fio sob o Modelo SINR

Camargo

Fülber-Garcia²,

Duarte³

2022

Anais Do XXVII Workshop De Gerência E Operação De Redes E Serviços (WGRS 2022)

View full text Add to dashboard Cite

A comunicação sem fio é hoje utilizada em larga escala. Novos avanços da tecnologia, como redes celulares 6G e Internet das coisas tendem a trazer ainda maior destaque e novos desafios, como densidades cada vez maiores. Um canal de comunicação sem fio é um meio compartilhado, que tem como um dos maiores desafios a interferência causada por transmissões simultâneas. Selecionar quais transmissões devem ocorrer simultaneamente, ou não, de maneira eficiente é conhecido como “problema do escalonamento”, um problema NP-Completo. Este trabalho apresenta uma heurística genética como solução para o problema do escalonamento em redes sem fio sob o modelo SINR. A heurística é especificada, avaliada por meio de experimentos, incluindo um teste de convergência e simulação para avaliar a sua capacidade em obter um escalonamento eficiente. Os resultados mostram que a solução proposta é capaz de produzir uma boa solução em tempo polinomial.

show abstract

“…The clustering is used as a functional solution for managing the multi-channel communications [ 10 ]. Many channel management mechanisms were proposed to improve the radio capacity of the network [ 11 , 12 ]. However, in a flat and dense network, the base station may not satisfy the simultaneous connection resulting in a waste of wireless communication resources and energy.…”

Section: Introductionmentioning

confidence: 99%

A Distributed Multi-Hop Intra-Clustering Approach Based on Neighbors Two-Hop Connectivity for IoT Networks

Batta

Mabed

Aliouat

et al. 2021

Sensors

Self Cite

View full text Add to dashboard Cite

Under a dense and large IoT network, a star topology where each device is directly connected to the Internet gateway may cause serious waste of energy and congestion issues. Grouping network devices into clusters provides a suitable architecture to reduce the energy consumption and allows an effective management of communication channels. Although several clustering approaches were proposed in the literature, most of them use the single-hop intra-clustering model. In a large network, the number of clusters increases and the energy draining remains almost the same as in un-clustered architecture. To solve the problem, several approaches use the k-hop intra-clustering to generate a reduced number of large clusters. However, k-hop proposed schemes are, generally, centralized and only assume the node direct neighbors information which lack of robustness. In this regard, the present work proposes a distributed approach for the k-hop intra-clustering called Distributed Clustering based 2-Hop Connectivity (DC2HC). The algorithm uses the two-hop neighbors connectivity to elect the appropriate set of cluster heads and strengthen the clusters connectivity. The objective is to optimize the set of representative cluster heads to minimize the number of long range communication channels and expand the network lifetime. The paper provides the convergence proof of the proposed solution. Simulation results show that our proposed protocol outperforms similar approaches available in the literature by reducing the number of generated cluster heads and achieving longer network lifetime.

show abstract

A Distributed TDMA Scheduling Algorithm for Latency Minimization in Internet of Things

Cited by 11 publications

References 12 publications

A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks

A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks

Uma Estratégia Bioinspirada para Escalonamento em Redes Sem Fio sob o Modelo SINR

A Distributed Multi-Hop Intra-Clustering Approach Based on Neighbors Two-Hop Connectivity for IoT Networks

Contact Info

Product

Resources

About