A Cover-Up Scheme for Data-Centric Storage in Wireless Sensor Networks

doi:10.1109/ISCC.2007.4381606

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/45523

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45523

题名:	A Cover-Up Scheme for Data-Centric Storage in Wireless Sensor Networks
作者:	Liao, Wen-Hwa;Shih, Kuei-Ping;Wu, Wan-Chi
贡献者:	淡江大學資訊工程學系
关键词:	Wireless sensor networks;Sensor phenomena and characterization;Event detection;Load management;Energy consumption;Memory;Floods;Energy storage;Routing;Discrete event simulation
日期:	2009-09
上传时间:	2010-03-26 19:28:05 (UTC+8)
出版者:	臺北市：中央研究院資訊科學研究所
摘要:	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.
關聯:	Journal of Information Science and Engineering 25(5), pp.1525-1537
DOI:	10.1109/ISCC.2007.4381606
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
	0Kb	Unknown	444	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章

数据加载中.....