The Community for Technology Leaders
RSS Icon
Subscribe
Clearwater Beach, FL, USA USA
Oct. 22, 2012 to Oct. 25, 2012
ISBN: 978-1-4673-1565-4
pp: 462-469
Venkat Pulimi , Dept. of Computer Science, University of Saskatchewan, Saskatoon, Canada
Tuhin Paul , Dept. of Computer Science, University of Saskatchewan, Saskatoon, Canada
Kevin G. Stanley , Dept. of Computer Science, University of Saskatchewan, Saskatoon, Canada
Derek Eager , Dept. of Computer Science, University of Saskatchewan, Saskatoon, Canada
ABSTRACT
Wireless sensor networks are often deployed to monitor scalar fields. Commonly, these networks employ a query-based architecture, where specific data are requested by the sink node, and the network responds. Contours or isolines are compact representations of the state of a scalar field, and are useful abstractions of scalar field behavior. Previously researchers have examined algorithms and policies for detecting contours in query-based sensor networks, but have only addressed individual components of the process. In this paper we present a set of algorithms for contour detection in WSNs, and associated oracle functions to provide an unbiased optimality comparison. We show that our algorithms, and in particular our response and aggregation policy provide near-optimal performance in simulated networks measuring physically realistic scalar fields.
INDEX TERMS
Routing, Algorithm design and analysis, Clustering algorithms, Wireless sensor networks, Network topology, Equations, Topology, wireless sensor networks, Contour detection, contour aggregation
CITATION
Venkat Pulimi, Tuhin Paul, Kevin G. Stanley, Derek Eager, "Near-optimal routing for contour detection in wireless sensor networks", LCN, 2012, 38th Annual IEEE Conference on Local Computer Networks, 38th Annual IEEE Conference on Local Computer Networks 2012, pp. 462-469, doi:10.1109/LCN.2012.6423662
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool