Abstract
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.
Highlights
Due to its random nature, DRAND may have a large number of collisions during the scheduling phase, which leads to long running time and generating a large amount of message overhead
We provide theoretical analysis on the complexity and running time of the algorithm, and implementation guidelines, so that readers can have a better understanding on the concept and re-implement DSTO
TOPOLOGICAL ORDERING AND SLOT-AWARENESS TABLE We describe how topological information (TI), which consists of the total number of neighbors |N (u)| and the random value val(u), can be used by each node to create a TO for its two-hop neighborhood in Subsection IV-A
Summary
Wireless sensor networks (WSNs) have received increasing interests from both the academic community and the industries as they have been proved to have many real-world applications including environmental monitoring [1]–[3], pollution monitoring [3], [4], disaster forecast, prevention and management [5]–[7], structural health monitoring [8]–[10], wildlife tracking [11], [12], cattle farm monitoring [13]–[15], and most recently the Internet of Things [16], [17]. Due to its random nature, DRAND may have a large number of collisions during the scheduling phase, which leads to long running time and generating a large amount of message overhead. UAV networks for monitoring farm cattle [13] have to deal with sudden topology changes due to node or communication failures For this type of networks, a TDMA scheduling algorithm with short running time and low message overhead is promising as it can quickly adapt to changes and efficiently reduce energy consumption. We improve the scheduling algorithm to handle diverse cases in practical WSNs by adding the checking condition for message reception status and slot awareness of nodes
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
