2011 IEEE International Symposium on Industrial Electronics 2011
DOI: 10.1109/isie.2011.5984334
|View full text |Cite
|
Sign up to set email alerts
|

Prolonging wireless HART network lifetime using packet aggregation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
14
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 19 publications
(14 citation statements)
references
References 6 publications
0
14
0
Order By: Relevance
“…The data packets used in IWSNs are relatively small and thus it is possible to apply packet aggregation, i.e., concatenate two or more source packets into one larger packet, with only one single header. More specifically, we use the data aggregation scheme proposed in [17] for WirelessHART. This scheme suggests to aggregate the packets directed to the same destination.…”
Section: System Modelmentioning
confidence: 99%
See 3 more Smart Citations
“…The data packets used in IWSNs are relatively small and thus it is possible to apply packet aggregation, i.e., concatenate two or more source packets into one larger packet, with only one single header. More specifically, we use the data aggregation scheme proposed in [17] for WirelessHART. This scheme suggests to aggregate the packets directed to the same destination.…”
Section: System Modelmentioning
confidence: 99%
“…Every source node is assigned a time slot to transmit in. In its assigned time slot each node uses the packet aggregation mechanism from [17] to transmit its own data packet plus the data from one of the packets it has overheard from sources with earlier time slots. The term packet aggregation [17] stands for concatenation of payloads from more than one data packet into a larger one sharing the same header.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…Previous work evolving data gathering transmission for sensor networks can be classified into two types. The first one is a "randomly waiting gathering" which typically uses a gathering mechanism in the buffer of each node without any scheduling [3][4] [5]. This method cannot guarantee the gathering performance because the outbound link is not always transmitted after the inbound link.…”
Section: Introductionmentioning
confidence: 99%