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

doi:10.1016/j.datak.2011.03.008

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Journal Article > Item 987654321/106220

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/106220

Title:	Optimizing in-network aggregate queries in wireless sensor networks for energy saving
Authors:	Hung, Chih-Chieh;Peng, Wen-Chih
Keywords:	In-network aggregate query;Sensor data management;Wireless sensor networks
Date:	2011-07-01
Issue Date:	2016-04-22 13:42:12 (UTC+8)
Publisher:	Elsevier BV * North-Holland
Abstract:	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.
Relation:	DATA & KNOWLEDGE ENGINEERING 70(7), pp.617-641
DOI:	10.1016/j.datak.2011.03.008
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	201	View/Open
Optimizing in-network aggregate queries in wireless sensor networks for energy saving.pdf		2450Kb	Adobe PDF	1	View/Open

Loading...