Paper Info
Title
Distributed In-Network Processing of k-MaxRS in Wireless Sensor Networks.
Abstract
We address the problem of in-network processing of k-Maximizing Range Sum (k-MaxRS) queries in Wireless Sensor Networks (WSN). The traditional, Computational Geometry version of the MaxRS problem considers the setting in which, given a set of (possibly weighted) 2D points, the goal is to determine the optimal location for a given (axes-parallel) rectangle R to be placed so that the sum of the weights (or, a simple count) of the input points in R's interior is maximized. In WSN, this corresponds to finding the location of region R such that the sum of the sensors' readings inside R is maximized. The k-MaxRS problem deals with maximizing the overall sum over k such rectangular regions. Since centralized processing -i.e., transmitting the raw readings and subsequently determining the k-MaxRS in a dedicated sink - incur communication overheads, we devised an efficient distributed algorithm for in-network computation of k-MaxRS. Our experimental observations show that the novel algorithm provides significant energy/communication savings when compared to the centralized approach.
Year
DOI
Venue
2017
10.5220/0006210701080117
SENSORNETS: PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON SENSOR NETWORKS
Keywords
Field
DocType
k-MaxRS,Maximizing Range Sum,Distributed Query Processing,Wireless Sensor Networks
Sensor node,Fixed wireless,Wireless network,Key distribution in wireless sensor networks,Computer science,Visual sensor network,Computer network,Mobile wireless sensor network,Wi-Fi array,Wireless sensor network
Conference
Citations 
PageRank 
References 
1
0.36
0
Authors
5
Name
Order
Citations
PageRank
Panitan Wongse-ammat130.74
Muhammed Mas-ud Hussain2123.43
Goce Trajcevski31732141.26
Besim Avci4315.46
Ashfaq A. Khokhar51008108.60