Optimizing in-network aggregate queries in wireless sensor networks for energy saving

doi:10.1016/j.datak.2011.03.008

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

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

题名:	Optimizing in-network aggregate queries in wireless sensor networks for energy saving
作者:	Hung, Chih-Chieh;Peng, Wen-Chih
关键词:	In-network aggregate query;Sensor data management;Wireless sensor networks
日期:	2011-07-01
上传时间:	2016-04-22 13:42:12 (UTC+8)
出版者:	Elsevier BV * North-Holland
摘要:	This study proposes a method of in-network aggregate query processing to reduce the number of messages incurred in a wireless sensor network. When aggregate queries are issued to the resource-constrained wireless sensor network, it is important to efficiently perform these queries. Given a set of multiple aggregate queries, the proposed approach shares intermediate results among queries to reduce the number of messages. When the sink receives multiple queries, it should be propagated these queries to a wireless sensor network via existing routing protocols. The sink could obtain the corresponding topology of queries and views each query as a query tree. With a set of query trees collected at the sink, it is necessary to determine a set of backbones that share intermediate results with other query trees (called non-backbones). First, it is necessary to formulate the objective cost function for backbones and non-backbones. Using this objective cost function, it is possible to derive a reduction graph that reveals possible cases of sharing intermediate results among query trees. Using the reduction graph, this study first proposes a heuristic algorithm BM (standing for Backbone Mapping). This study also develops algorithm OOB (standing for Obtaining Optimal Backbones) that exploits a branch-and-bound strategy to obtain the optimal solution efficiently. This study tests the performance of these algorithms on both synthesis and real datasets. Experimental results show that by sharing the intermediate results, the BM and OOB algorithms significantly reduce the total number of messages incurred by multiple aggregate queries, thereby extending the lifetime of sensor networks.
關聯:	DATA & KNOWLEDGE ENGINEERING 70(7), pp.617-641
DOI:	10.1016/j.datak.2011.03.008
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	203	检视/开启
Optimizing in-network aggregate queries in wireless sensor networks for energy saving.pdf		2450Kb	Adobe PDF	1	检视/开启

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

TAIR相关文章

数据加载中.....