TY - GEN
T1 - A Distributed Weight-Based TDMA Scheduling Algorithm for Latency Improvement in IoT
AU - Batta, Mohamed Sofiane
AU - Aliouat, Zibouda
AU - Harous, Saad
N1 - Funding Information:
This research work is supported by UAEU/UPAR Grant 31T102-UPAR -1-2017.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/10
Y1 - 2019/10
N2 - The Internet of Things (IoT) and the Wireless Sensor Networks (WSNs) attract attention of the research communities due to their rapid and promising development. These paradigms have been predicted to play a leading role in our daily life in the near future. The limited resources and the restricted number of communication channels in these networks create new challenges especially in collision and access conflicts. To bring appropriate solutions for these problems, several works, in the literature, focus on centralized and distributed approaches. Traditional distributed protocols assume that the MAC and Routing layers act independently. Moreover, the dynamic topology and the central point of failure restrict the development of centralized techniques. In this paper, we present a distributed weight-based TDMA-MAC scheduling algorithm (WB-DTSA). The proposed solution takes advantage of routing information to improve the communication latency and the schedule length. Simulation results show better performance, in comparison to similar distributed channel assignment approaches. The latency is improved by 47% and the schedule length is reduced by 23%.
AB - The Internet of Things (IoT) and the Wireless Sensor Networks (WSNs) attract attention of the research communities due to their rapid and promising development. These paradigms have been predicted to play a leading role in our daily life in the near future. The limited resources and the restricted number of communication channels in these networks create new challenges especially in collision and access conflicts. To bring appropriate solutions for these problems, several works, in the literature, focus on centralized and distributed approaches. Traditional distributed protocols assume that the MAC and Routing layers act independently. Moreover, the dynamic topology and the central point of failure restrict the development of centralized techniques. In this paper, we present a distributed weight-based TDMA-MAC scheduling algorithm (WB-DTSA). The proposed solution takes advantage of routing information to improve the communication latency and the schedule length. Simulation results show better performance, in comparison to similar distributed channel assignment approaches. The latency is improved by 47% and the schedule length is reduced by 23%.
KW - Distributed Slots Assignment
KW - IoT
KW - Latency
KW - TDMA Scheduling
KW - WSN
UR - http://www.scopus.com/inward/record.url?scp=85081092510&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85081092510&partnerID=8YFLogxK
U2 - 10.1109/UEMCON47517.2019.8993097
DO - 10.1109/UEMCON47517.2019.8993097
M3 - Conference contribution
AN - SCOPUS:85081092510
T3 - 2019 IEEE 10th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference, UEMCON 2019
SP - 768
EP - 774
BT - 2019 IEEE 10th Annual Ubiquitous Computing, Electronics and Mobile Communication Conference, UEMCON 2019
A2 - Chakrabarti, Satyajit
A2 - Saha, Himadri Nath
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th IEEE Annual Ubiquitous Computing, Electronics and Mobile Communication Conference, UEMCON 2019
Y2 - 10 October 2019 through 12 October 2019
ER -