2011
DOI: 10.1016/j.comnet.2010.09.017
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic timeout for data aggregation in wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
24
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 17 publications
(24 citation statements)
references
References 26 publications
0
24
0
Order By: Relevance
“…Data aggregation methods try to find and remove packets of the same event to reduce network energy consumption as well as improving the network end-to-end delay [10,11]. Generally, data aggregation methods improve their Degree of Aggregation (DOA) by imposing a predefined delay on incoming packets [13].…”
Section: Backgroundsmentioning
confidence: 99%
See 4 more Smart Citations
“…Data aggregation methods try to find and remove packets of the same event to reduce network energy consumption as well as improving the network end-to-end delay [10,11]. Generally, data aggregation methods improve their Degree of Aggregation (DOA) by imposing a predefined delay on incoming packets [13].…”
Section: Backgroundsmentioning
confidence: 99%
“…A Peony-tree-based Data Aggregation method, PDA, has been presented in [14] which has a delay bound of 15R þ D À 15 where R is the network radius and D is the maximum node degree. In most of adaptive data aggregation methods [12][13][14][15], a complicated computation should be done to determine the amount of imposed delay on incoming packets. Since this computation should be repeated throughout the whole lifetime of network, energy savings of adaptive data aggregation methods are not very remarkable.…”
Section: Backgroundsmentioning
confidence: 99%
See 3 more Smart Citations