Bidirectional data aggregation scheme for wireless sensor networks
- Authors
- Cho, Sungrae
- Issue Date
- Sep-2006
- Publisher
- SPRINGER-VERLAG BERLIN
- Citation
- UBIQUITOUS INTELLIGENCE AND COMPUTING, PROCEEDINGS, v.4159, pp 595 - 604
- Pages
- 10
- Journal Title
- UBIQUITOUS INTELLIGENCE AND COMPUTING, PROCEEDINGS
- Volume
- 4159
- Start Page
- 595
- End Page
- 604
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/43860
- DOI
- 10.1007/11833529_61
- ISSN
- 0302-9743
1611-3349
- Abstract
- In this paper, bidirectional data aggregation (BDA) scheme is proposed for wireless sensor networks. Traditionally, data aggregation bas been performed in backward direction (from source to sink) where each node in the network combines data from its child nodes. BDA algorithm, however, aggregates sensory data in both directions (sink to sources and sources to sink) when the sink is interested in gathering singular aggregates such as MAX and MIN. In forward aggregation (sink to sources), each node tags its sensor reading to the ongoing query only if its local reading is not redundant. Node receiving the tagged query suppresses its response if its local reading is redundant. By doing so, we can limit a number of redundant and unnecessary responses from the sensor nodes, saving energy. Performance evaluation shows that BDA algorithm significantly improves energy-efficiency as well as provides an accurate response for a given singular query in the presence of time-varying sensor readings.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/43860)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.