1. NCCU Academic Hub
  2. 學術產出
  3. 資訊學院
  4. 期刊論文
  5. Item

學術產出-期刊論文

文章檢視/開啟

書目匯出

Google ScholarTM

政大圖書館

引文資訊

TAIR相關學術產出

題名 Efficient and Robust Schemes for Sensor Data Aggregation Based on Linear Counting
作者 陳良弼
Fan,Yao-Chung; Chen,Arbee L.P.
貢獻者 資科系
日期 2010-11
上傳時間 21-八月-2014 15:10:27 (UTC+8)
摘要 Sensor networks have received considerable attention in recent years, and are often employed in the applications where data are difficult or expensive to collect. In these applications, in addition to individual sensor readings, statistical aggregates such as Min and Count over the readings of a group of sensor nodes are often needed. To conserve resources for sensor nodes, in-network strategies are adopted to process the aggregates. One primitive in-network aggregation strategy is the tree-based aggregation, where the aggregates are computed from leaves to the root of a spanning tree over a sensor network. However, a shortcoming with the tree-based aggregation is that it is not robust against communication failures, which are common in sensor networks. One of the solutions to overcome this shortcoming is to enable multipath routing, by which each node broadcasts its reading or a partial aggregate to multiple neighbors. However, multipath routing-based aggregation typically suffers from the problem of overcounting sensor readings. In this study, we propose two schemes based on the linear counting technique to deal with the overcounting problem. These two schemes process aggregates by statically and dynamically, respectively, allocating space for the use of the linear counting technique. Both schemes provide the same accuracy guarantee but involve different communication costs. Through extensive experiments with real-world and synthetic data, we demonstrate the efficiency and effectiveness of using these two schemes as solutions for processing aggregates in a sensor network. The experiments also show that the scheme that dynamically allocates the space often outperforms the other one in terms of energy conservation since it requires less space to satisfy an accuracy constraint.
關聯 Parallel and Distributed Systems,21(11),1675-1691
資料類型 article
DOI http://dx.doi.org/10.1109/TPDS.2010.33
dc.contributor 資科系en_US
dc.creator (作者) 陳良弼zh_TW
dc.creator (作者) Fan,Yao-Chung; Chen,Arbee L.P.en_US
dc.date (日期) 2010-11en_US
dc.date.accessioned 21-八月-2014 15:10:27 (UTC+8)-
dc.date.available 21-八月-2014 15:10:27 (UTC+8)-
dc.date.issued (上傳時間) 21-八月-2014 15:10:27 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/69159-
dc.description.abstract (摘要) Sensor networks have received considerable attention in recent years, and are often employed in the applications where data are difficult or expensive to collect. In these applications, in addition to individual sensor readings, statistical aggregates such as Min and Count over the readings of a group of sensor nodes are often needed. To conserve resources for sensor nodes, in-network strategies are adopted to process the aggregates. One primitive in-network aggregation strategy is the tree-based aggregation, where the aggregates are computed from leaves to the root of a spanning tree over a sensor network. However, a shortcoming with the tree-based aggregation is that it is not robust against communication failures, which are common in sensor networks. One of the solutions to overcome this shortcoming is to enable multipath routing, by which each node broadcasts its reading or a partial aggregate to multiple neighbors. However, multipath routing-based aggregation typically suffers from the problem of overcounting sensor readings. In this study, we propose two schemes based on the linear counting technique to deal with the overcounting problem. These two schemes process aggregates by statically and dynamically, respectively, allocating space for the use of the linear counting technique. Both schemes provide the same accuracy guarantee but involve different communication costs. Through extensive experiments with real-world and synthetic data, we demonstrate the efficiency and effectiveness of using these two schemes as solutions for processing aggregates in a sensor network. The experiments also show that the scheme that dynamically allocates the space often outperforms the other one in terms of energy conservation since it requires less space to satisfy an accuracy constraint.en_US
dc.format.extent 162 bytes-
dc.format.mimetype text/html-
dc.language.iso en_US-
dc.relation (關聯) Parallel and Distributed Systems,21(11),1675-1691en_US
dc.title (題名) Efficient and Robust Schemes for Sensor Data Aggregation Based on Linear Countingen_US
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1109/TPDS.2010.33en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1109/TPDS.2010.33en_US