Abstract
Real-time flows using time division multiple access (TDMA) scheduling in cluster-based wireless sensor networks try to schedule more flows per time frame to minimize the schedule length to meet the deadline. The problem with the previously used cluster-based scheduling algorithm is that intra-cluster scheduling does not consider that the clusters may have internal or outgoing flows. Thus, intra-cluster scheduling algorithms do not utilize their empty time-slots and thus increase schedule length. In this paper, we propose a new intra-cluster scheduling algorithm by considering that clusters may have having internal or outgoing flows. Thus, intra-cluster scheduling algorithms do not differentiate the intra-cluster time slots and utilize their empty time slots. The objective is to schedule more flows per time frame, to reduce schedule length and improve the acceptance rate of flows. Simulation results show that the acceptance rate of the proposed scheme has a higher performance than the previous scheme.
Highlights
WirelessHART standards for sensor-actuator networks have attracted interest for real-time communication [1]
time division multiple access (TDMA) scheduling under cluster architecture is proposed in wireless sensor networks (WSNs) [5,6,7,8,9]
[26], three cluster-based scheduling real-time communication scheme characterized interference by using graph theory, while graph algorithms are proposed for real-time flows
Summary
WirelessHART standards for sensor-actuator networks have attracted interest for real-time communication [1]. Cluster-based real-time communication scheme [12] represented interference by using graph theory, while graph coloring is used to avoid the collision. TDMA scheduling real-time communication scheme characterized interference by using graph theory, while graph algorithms are proposed for real-time flows. In [26], three cluster-based TDMA scheduling schedule real-time data; some schemes have centralized approach and are not algorithms are proposed for real-time flows. Cluster-based coloring schemes for real-time flow increase the schedule length and different time slots, IntraSend, and IntraRecv to avoid interference [27]. Several scheduling algorithms have been proposed to transmit data from source to in the intra-cluster scheduling some flows cannot utilize the available empty time slots.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have