English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 89713/119533 (75%)
Visitors : 23937337      Online Users : 179
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 資訊科學系 > 期刊論文 >  Item 140.119/62304
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/62304


    Title: Energy Efficient Schemes for Accuracy-Guaranteed Sensor Data Aggregation Using Scalable Counting
    Authors: 陳良弼
    Chen, Arbee L.P.
    Fan, Yao-Chung
    Contributors: 資科系
    Keywords: Wireless sensor networks;query processing;distributed data structures;reliability and robustness
    Date: 2012.08
    Issue Date: 2013-12-09 13:37:43 (UTC+8)
    Abstract: Sensor networks have received considerable attention in recent years, and are employed in many applications. In these applications, statistical aggregates such as Sum over the readings of a group of sensor nodes are often needed. One challenge for computing sensor data aggregates comes from the communication failures, which are common in sensor networks. To enhance the robustness of the aggregate computation, multipath-based aggregation is often used. However, the multipath-based aggregation suffers from the problem of overcounting sensor readings. The approaches using the multipath-based aggregation therefore need to incorporate techniques that avoid overcounting sensor readings. In this paper, we present a novel technique named scalable counting for efficiently avoiding the overcounting problem. We focus on having an (\varepsilon, \delta) accuracy guarantee for computing an aggregate, which ensures that the error in computing the aggregate is within a factor of \varepsilon with probability (1 - \delta). Our schemes using the scalable counting technique efficiently compute the aggregates under a given accuracy guarantee. We provide theoretical analyses that show the advantages of the scalable counting technique over previously proposed techniques. Furthermore, extensive experiments are made to validate the theoretical results and manifest the advantages of using the scalable counting technique for sensor data aggregation.
    Relation: IEEE Transactions on Knowledge and Data Engineering, 24(8), 1463-1477
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1109/TKDE.2011.76
    DOI: 10.1109/TKDE.2011.76
    Appears in Collections:[資訊科學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    14631477.pdf1469KbAdobe PDF766View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告
    1.本網站之數位內容為國立政治大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。
    2.本網站之製作,已盡力防止侵害著作權人之權益,如仍發現本網站之數位內容有侵害著作權人權益情事者,請權利人通知本網站維護人員(nccur@nccu.edu.tw),維護人員將立即採取移除該數位著作等補救措施。
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback