TY - GEN
T1 - A distributed TDMA scheduling algorithm for latency minimization in internet of things
AU - Batta, Mohamed Sofiane
AU - Harous, Saad
AU - Louail, Lemia
AU - Aliouat, Zibouda
N1 - Funding Information:
if Dx > α then if Statex = IDLE ∧ SLOTx = ∅ then Broadcast(Requestx,Px,Deg(x)) Statex = REQUEST Upon receiving Requesty from y: Add Requesty to Request listx if End of round then if Statex ∕ REQUEST ∨ GRANT then Priority node = Find priority node( Request listx) Send Grant to Priority node Send Reject to node in Request listx / Priority node Statex = GRANT if Statex = REQUEST ∨ GRANT then Send Reject to node in Request listx if Statex = RELEASE then Statex = IDLE Upon receiving Grant message: Count neigbors grant++ if Count neigbors grant = Deg(x) then Slotx = Find minimaum slot( One hop slotsx,T wo hop slotsx) Broadcast(Releasex,SLOTx) Statex = RELEASE Upon receiving Releasey from y: Update(One hop slotsx,SLOTy) Broadcast(Two hop releasey,SLOTy) Statex = RELEASE Upon receiving Two hop releasey from y: if x ∕ y then Update(Two hop slotsx,SLOTy) Statex = RELEASE Upon receiving Reject message: Broadcast(Fail) Statex = IDLE Upon receiving Fail message: Statex = IDLE
Funding Information:
This research work is supported in part by PHC-Tassili Grant Number 18MDU114, and in part by UAEU/UPAR Grant 31T102-UPAR -1- 2017.
Publisher Copyright:
© 2019 IEEE.
PY - 2019/5
Y1 - 2019/5
N2 - The emergence of Wireless Sensor Networks (WSNs) attracts attention of the research communities since they cover several domains of Internet of things (IoT). The resourceconstrained sensors and the limited number of communication channels create challenges especially in collision and access conflicts. In order to bring appropriate solutions to these problems, different centralized and distributed approaches have been proposed in the literature. The major problem of centralized techniques is the central point of failure. To this end, this paper proposes a distributed TDMA scheduling algorithm. The proposed solution considers routing information to reduce the messages complexity, minimize communication latency and the schedule length. The experiment results show better performance, in comparison to referenced distributed channel allocation approaches. The latency is improved by 8%, the schedule length and the messages complexity are reduced by 24% and 22% respectively.
AB - The emergence of Wireless Sensor Networks (WSNs) attracts attention of the research communities since they cover several domains of Internet of things (IoT). The resourceconstrained sensors and the limited number of communication channels create challenges especially in collision and access conflicts. In order to bring appropriate solutions to these problems, different centralized and distributed approaches have been proposed in the literature. The major problem of centralized techniques is the central point of failure. To this end, this paper proposes a distributed TDMA scheduling algorithm. The proposed solution considers routing information to reduce the messages complexity, minimize communication latency and the schedule length. The experiment results show better performance, in comparison to referenced distributed channel allocation approaches. The latency is improved by 8%, the schedule length and the messages complexity are reduced by 24% and 22% respectively.
KW - Distributed slot allocation
KW - IoT
KW - Latency
KW - TDMA scheduling
KW - WSN
UR - http://www.scopus.com/inward/record.url?scp=85072827225&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85072827225&partnerID=8YFLogxK
U2 - 10.1109/EIT.2019.8833679
DO - 10.1109/EIT.2019.8833679
M3 - Conference contribution
AN - SCOPUS:85072827225
T3 - IEEE International Conference on Electro Information Technology
SP - 108
EP - 113
BT - 2019 IEEE International Conference on Electro Information Technology, EIT 2019
PB - IEEE Computer Society
T2 - 2019 IEEE International Conference on Electro Information Technology, EIT 2019
Y2 - 20 May 2019 through 22 May 2019
ER -