2013
DOI: 10.1002/ett.2650
|View full text |Cite
|
Sign up to set email alerts
|

Label switching over IEEE802.15.4e networks

Abstract: An open issue still to be addressed in low‐power lossy networks (LLNs) is how the application requirements, the available transport services, the network layer routes, and the data link‐layer resources are mapped efficiently. This can be explained by the fact that, in most LLNs, link‐layer resources cannot be easily managed; this results in a best effort IP layer, and traffic engineering performed solely through flow control at the transport layer. The new IEEE802.15.4e standard defines a link‐layer mechanism … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 54 publications
(29 citation statements)
references
References 28 publications
0
29
0
Order By: Relevance
“…The schedule allows for a fine-grained trade-off between latency, bandwidth, redundancy and power consumption. Several scheduling approaches have been proposed, both centralized [15] and distributed [16], [17], and are currently being standardized [18]. The energy consumption of a mote is the sum of the energy consumed in each slot.…”
Section: Energy Modelmentioning
confidence: 99%
“…The schedule allows for a fine-grained trade-off between latency, bandwidth, redundancy and power consumption. Several scheduling approaches have been proposed, both centralized [15] and distributed [16], [17], and are currently being standardized [18]. The energy consumption of a mote is the sum of the energy consumed in each slot.…”
Section: Energy Modelmentioning
confidence: 99%
“…The function F includes a lookup-table mapping between real frequency value (in GHz) and physical channel number in the range [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26]. ASN presents the total number of slots since the start of TSCH networks, and it is calculated as follows: ASN = (n Á L slotframe + slotOffset), where n defines the slotframe cycle and L slotframe is the slotframe length.…”
Section: Tsch Mode In Ieee 802154ementioning
confidence: 99%
“…IV. For the sake of completeness, we also mention here the work of Morell et al [19], which defined a form of neighbor-toneighbor signaling exchanges by exploiting the concept of label switching in TSCH networks and proposing the use of reservation to establish and manage tracks between nodes in the network. In that proposal, the TSCH schedule is built by collecting information along the track and installing it during the downstream reservation message, in a RSVP-like fashion [17].…”
Section: Introductionmentioning
confidence: 99%