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

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 a...

Full description

Bibliographic Details
Main Authors: Thanh-Tung Nguyen, Taejoon Kim, Taehong Kim
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9160946/
_version_ 1818734359610392576
author Thanh-Tung Nguyen
Taejoon Kim
Taehong Kim
author_facet Thanh-Tung Nguyen
Taejoon Kim
Taehong Kim
author_sort Thanh-Tung Nguyen
collection DOAJ
description 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.
first_indexed 2024-12-18T00:04:07Z
format Article
id doaj.art-b16b2654ef4a493a9671b6bb08bcb921
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-12-18T00:04:07Z
publishDate 2020-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-b16b2654ef4a493a9671b6bb08bcb9212022-12-21T21:27:53ZengIEEEIEEE Access2169-35362020-01-01814531614533110.1109/ACCESS.2020.30148029160946A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor NetworksThanh-Tung Nguyen0https://orcid.org/0000-0002-8186-2600Taejoon Kim1https://orcid.org/0000-0001-6326-2559Taehong Kim2https://orcid.org/0000-0001-6246-6218School of Information and Communication Engineering, Chungbuk National University, Cheongju, South KoreaSchool of Information and Communication Engineering, Chungbuk National University, Cheongju, South KoreaSchool of Information and Communication Engineering, Chungbuk National University, Cheongju, South KoreaIn 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.https://ieeexplore.ieee.org/document/9160946/DistributedDSTOscheduling algorithmTDMAtopological orderingwireless sensor networks
spellingShingle Thanh-Tung Nguyen
Taejoon Kim
Taehong Kim
A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks
IEEE Access
Distributed
DSTO
scheduling algorithm
TDMA
topological ordering
wireless sensor networks
title A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks
title_full A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks
title_fullStr A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks
title_full_unstemmed A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks
title_short A Distributed TDMA Scheduling Algorithm Using Topological Ordering for Wireless Sensor Networks
title_sort distributed tdma scheduling algorithm using topological ordering for wireless sensor networks
topic Distributed
DSTO
scheduling algorithm
TDMA
topological ordering
wireless sensor networks
url https://ieeexplore.ieee.org/document/9160946/
work_keys_str_mv AT thanhtungnguyen adistributedtdmaschedulingalgorithmusingtopologicalorderingforwirelesssensornetworks
AT taejoonkim adistributedtdmaschedulingalgorithmusingtopologicalorderingforwirelesssensornetworks
AT taehongkim adistributedtdmaschedulingalgorithmusingtopologicalorderingforwirelesssensornetworks
AT thanhtungnguyen distributedtdmaschedulingalgorithmusingtopologicalorderingforwirelesssensornetworks
AT taejoonkim distributedtdmaschedulingalgorithmusingtopologicalorderingforwirelesssensornetworks
AT taehongkim distributedtdmaschedulingalgorithmusingtopologicalorderingforwirelesssensornetworks