中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/106540
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81584431      Online Users : 2855
RC Version 7.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


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/106540


    Title: Correlated data gathering with double trees in wireless sensor networks
    Authors: 吳曉光;Weng, Hsien-Cheng;Chen, Yu-Hsun;Wu, Eric Hsiao-Kuang;Chen, Gen-Huey
    Contributors: 資訊電機學院資訊工程學系
    Keywords: Approximation algorithm;Computer science;correlated data gathering;Correlation;double-tree routing scheme;Encoding;NP-hardness;Routing;Temperature measurement;Wireless communication;wireless sensor network;Wireless sensor networks
    Date: 2012-04-26
    Issue Date: 2026-04-23 13:28:05 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers Inc.;IEEE
    Abstract: 摘要: The problem of correlated data gathering in wireless sensor networks is studied in this paper. For the sake of efficiency, tree transmission structures are often used for data gathering. Previously, the problem of minimizing the total communication cost with a single-tree transmission structure was shown to be NP-hard. However, when the explicit communication approach is used, the total communication cost can be further reduced, provided a double-tree transmission structure is used and inverse links are allowed. This motivates us to devise a double-tree routing scheme in which two trees are used for data transmission, one carrying raw data and the other carrying encoded data. We show that with the double-tree routing scheme, the problem of minimizing the total communication cost remains NP-hard. A distributed algorithm for solving it is suggested. We show that under the simple correlation model, the algorithm has an approximation ratio of two. Extensive simulations are conducted to verify the effectiveness of the double-tree routing scheme.
    其他題名: JSEN
    出版者: IEEE
    出版日期: 2012-05-01
    出處: IEEE sensors journal, 2012-05, Vol.12 (5), p.1147-1156
    資源來源: IEEE Electronic Library (IEL)
    識別號: ISSN: 1530-437X
    識別號: EISSN: 1558-1748
    識別號: DOI: 10.1109/JSEN.2011.2162092
    識別號: CODEN: ISJEAZ
    Appears in Collections:[Department of Computer Science and information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML13View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明