English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56562/90363 (63%)
Visitors : 11849447      Online Users : 97
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/45523

    Title: A Cover-Up Scheme for Data-Centric Storage in Wireless Sensor Networks
    Authors: Liao, Wen-Hwa;Shih, Kuei-Ping;Wu, Wan-Chi
    Contributors: 淡江大學資訊工程學系
    Keywords: Wireless sensor networks;Sensor phenomena and characterization;Event detection;Load management;Energy consumption;Memory;Floods;Energy storage;Routing;Discrete event simulation
    Date: 2009-09
    Issue Date: 2010-03-26 19:28:05 (UTC+8)
    Publisher: 臺北市:中央研究院資訊科學研究所
    Abstract: One critical problem in wireless sensor networks is how to make the effective use of the vast amount of data by providing sensor and sink nodes with efficient data storing and retrieving, respectively. Several data-centric storage techniques had been proposed to exploit data storing and retrieving, but all of them failed to effectively deal with hotspot storage due to irregular sensor deployments or data distribution. In this paper, we propose a cover-up scheme for data-centric storage in wireless sensor networks. In our scheme, the storage node generates a virtual coordinate to feign that it is far away from the hash location. A geographic routing protocol forwarding an event data to a storage node will ignore the original storage node and find a new storage node whose coordinate is the closest to the hash location. Our cover-up mechanism can adjust to another storage node dynamically when a storage node is full. Simulations have shown that our cover-up scheme can reduce the energy consumption and achieve better quality of data.
    Relation: Journal of Information Science and Engineering 25(5), pp.1525-1537
    DOI: 10.1109/ISCC.2007.4381606
    Appears in Collections:[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback