A Fairness-Aware Scheduling Algorithm for Industrial Wireless Sensor Networks with Multiple Access Points

Abstract

Abstract-Real-timeliness and reliability are two basic requirements for industrial wireless sensor networks (IWSNs). In this paper, periodic heterogeneous traffics with delay constraints are concerned in an IWSN with multiple access points (thus forming a redundant star topology). In order to improve the reliability while meeting the real-timeliness and fairness, we propose a fairness-aware scheduling (FAS) algorithm, in which three heuristic rules are first designed based on a novel penalty mechanism. Then, in each slot field devices are classified into six priorities according to the above three rules. Finally, the current slot is allocated to field devices in accordance with their priorities and communication ranges in a space division multiplexing way. A performance study is carried out by simulation, and the results show that the proposed FAS algorithm performs much better than existing works in terms of reliability and fairness.

Throughput Maximizing and Fair Scheduling Algorithms in Industrial Internet of Things Networks

“…In the scheduling algorithms described above [10][11][12][13][14][15][16][17], the notion of fairness fails to exist. Several works in the literature have addressed fairness in the wireless networks domain [20][21][22]. In [20], the authors introduced various distributed algorithms that allows each node to calculate its max-min link share in a wireless ad-hoc network.…”

“…In [21], the authors proposed a distributed MAC algorithm to share network resources in a fairly way in 802.11-based networks. Shi et al [22] provided a fairness-aware scheduling algorithm to address the penalty mechanism in balancing reliability and fairness. However, none of these works takes into account the unique features of TSCH concept, therefore, they are unsuitable for implementation in IIoT-TSCH networks.…”

“…This paper addresses time and frequency resource pair to be shared fairly among the nodes in the IIoT-TSCH networks. Unlike most works [20][21][22], our emphasis in this article is on IIoT-TSCH networks. We present a fair scheduling model that takes into account the joint provision of throughput and temporal fairness by considering the throughput values in the past and the use of this information in the current scheduling decision.…”

A Real-Time Transmission Scheduling Algorithm for Industrial Wireless Sensor Networks with Multiple Radio Interfaces

“…However, the periods of traffics are assumed to be homogeneous, i.e., packets generated by different FDs share the same update period and deadline [12]. TDMA scheduling schemes for periodic heterogeneous traffics (i.e., packets with different update periods or deadlines) are proposed in [13]- [16]. In IWSNs with mesh topologies, transmissions suffer from radio confliction problem and cochannel interference problem.…”