2012
DOI: 10.1007/s11276-012-0524-2
|View full text |Cite
|
Sign up to set email alerts
|

SAS-TDMA: a source aware scheduling algorithm for real-time communication in industrial wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
21
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 40 publications
(21 citation statements)
references
References 18 publications
0
21
0
Order By: Relevance
“…Authors have also evaluated upper bounds for these schedules as a function of total packets generated in the network. In [13,14], authors further improved the results in [12] and showed how their work outperforms [12]. In [13], authors considered harsh dynamic environment but failed to offer guaranteed data reliability.…”
Section: Literature Reviewmentioning
confidence: 98%
See 1 more Smart Citation
“…Authors have also evaluated upper bounds for these schedules as a function of total packets generated in the network. In [13,14], authors further improved the results in [12] and showed how their work outperforms [12]. In [13], authors considered harsh dynamic environment but failed to offer guaranteed data reliability.…”
Section: Literature Reviewmentioning
confidence: 98%
“…In [13,14], authors further improved the results in [12] and showed how their work outperforms [12]. In [13], authors considered harsh dynamic environment but failed to offer guaranteed data reliability. In [14], authors improve reliability in harsh control environments and form hypergraph to increase scheduling flexibility.…”
Section: Literature Reviewmentioning
confidence: 98%
“…This time-based scheduling together with multiple frequencies guarantees the collision-free nature of I-EDF. Another scheduling algorithm, Source Aware Scheduling (SAS-TDMA) [30], was proposed to reduce overhead through information under cross-layered architecture. It includes the priority queuing model at the node based on average waiting time.…”
Section: Mac and Schedulingmentioning
confidence: 99%
“…Based on the current existing standards and papers, such as [13][14][15][16], the approaches for reliable and real-time communication in industrial wireless mesh networks are summarized with our comments as follows. (1) Three types of routing graphs are defined: broadcasting graph from gateway downward to all devices for common configuration and network control, uplink graph for data collection from all devices to gateway, and downlink graph from the gateway to each individual device for actuator control and other commands.…”
Section: Routing and Schedulingmentioning
confidence: 99%