Name
Abstract | ||
|---|---|---|
AbstractIn-network data aggregation is a widely used method for collecting data efficiently in wireless sensor networks (WSNs). The authors focus on how to achieve high aggregation efficiency and prolonging networks' lifetime. Firstly, this paper proposes an adaptive spanning tree algorithm (AST), which can adaptively build and adjust an aggregation spanning tree. Owing to the strategies of random waiting and alternative father nodes, AST can achieve a relatively balanced spanning tree and flexible tree adjustment. Then a redundant aggregation scheme (RAG) is illustrated. In RAG, interior nodes help to forward data for their sibling nodes and thus provide reliable data transmission for WSN. Finally, the simulations demonstrate that (1) AST can prolong the lifetime and (2) RAG makes a better trade-off between storage and aggregation ratio, comparing to other aggregation schemes. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1155/2015/637387 | Periodicals |
Field | DocType | Volume |
Data collection,Data transmission,Computer science,Computer network,Spanning tree,Wireless sensor network,Data aggregator,Spanning Tree Protocol,Distributed computing | Journal | 2015 |
Issue | ISSN | Citations |
1 | 1550-1329 | 2 |
PageRank | References | Authors |
0.50 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Zhang | 1 | 247 | 34.88 |
| Juhua Pu | 2 | 50 | 11.90 |
| Xingwu Liu | 3 | 19 | 12.77 |
| zun chen | 4 | 2 | 0.50 |