2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM) 2013
DOI: 10.1109/wowmom.2013.6583485
|View full text |Cite
|
Sign up to set email alerts
|
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
98
0
3

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 101 publications
(101 citation statements)
references
References 4 publications
0
98
0
3
Order By: Relevance
“…The standard just defines mechanisms to execute a link schedule. A number of link scheduling algorithms have been proposed in the literature [18] [19].…”
Section: A Tsch Access Modementioning
confidence: 99%
See 1 more Smart Citation
“…The standard just defines mechanisms to execute a link schedule. A number of link scheduling algorithms have been proposed in the literature [18] [19].…”
Section: A Tsch Access Modementioning
confidence: 99%
“…A number of link scheduling algorithms have been proposed in the literature, that take either a centralized [18] or distributed approach [19]. Interactions between TSCH and protocols defined for the Internet of Things have been also addressed [20].…”
Section: Introductionmentioning
confidence: 99%
“…Recently, the Decentralized Traffic Aware Scheduling (DeTAS) technique [18] was proposed to address the scheduling needs of deterministic networks and was conceived to comply with the following guidelines: 1) ensure the smallest end-to-end latency between data generation and its reception at the application sink (i.e., the root node in a RPL-organized network); 2) keep the queue utilization as small as possible, through a strict alternation of transmitting and receiving cells into the TSCH slotframe structure; 3) use neighbor-to-neighbor signaling for gathering minimal information about the network and traffic features and for distributing minimal information to compute a collision-free schedule, thus bounding the signaling overhead; 4) compute deterministic time schedules in a decentralized fashion to manage networks rooted to multiple coordinated sinks, while leaving the channel offset computation based on the RPL rank of each node in the network.…”
Section: Introductionmentioning
confidence: 99%
“…In [18], it has been shown that the guideline of 2) allows nodes' queues to be almost empty, as a natural consequence of a better schedule organization w.r.t. to that of TASA.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation