2004
DOI: 10.1007/978-3-540-28634-9_20
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Data Collection Trees in Sensor Networks with Redundancy Removal

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2005
2005
2010
2010

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…The route(s) for a sensor node to reply with data can be selected based on various criteria, for example, using a small hopcount in [ 21 – 23 ], minimum energy cost of data delivery in [ 17 ], adopting reliable routes from multiple candidates to avoid route failure in [ 3 ], or using an alternative path obtained from neighbouring nodes to improve security [ 24 ]. The reverse-tree-based data collection is simple to construct and imposes little additional overhead, as it is built on the basis of query dissemination.…”
Section: Related Workmentioning
confidence: 99%
“…The route(s) for a sensor node to reply with data can be selected based on various criteria, for example, using a small hopcount in [ 21 – 23 ], minimum energy cost of data delivery in [ 17 ], adopting reliable routes from multiple candidates to avoid route failure in [ 3 ], or using an alternative path obtained from neighbouring nodes to improve security [ 24 ]. The reverse-tree-based data collection is simple to construct and imposes little additional overhead, as it is built on the basis of query dissemination.…”
Section: Related Workmentioning
confidence: 99%