Generating Contour Maps for Dynamic Fields Monitored by Sensor Networks

LIBRARY RIGHTS STATEMENT In presenting this thesis in partial fulfillment of the requirements for an advanced degree at the University of Maine, I agree that the library shall make it freely available for inspection. I further agree that permission for " fair use " copying of this thesis for scholarly purposes may be granted by the Librarian. It is understood that any copying or publication of this thesis for financial gain shall not be allowed without my written permission. Wireless sensor networks provide a new tool that enables researchers and scientists to efficiently monitor dynamic fields. In order to extend the lifetime of the network, it is important for us to minimize network data transmission as much as possible. Previous work proposed many useful aggregation techniques to answer max, min and average questions, and some of them have been employed in real applications. But we cannot get spatial information from these aggregation techniques. This thesis presents an efficient aggregation technique for continuous generation of contour maps for a dynamic field monitored by a wireless sensor network. A contour map is a useful data representation schema that provides an efficient way to visualize an approximation to the monitored field. In this thesis, we discuss an energy-efficient technique, which we call Isovector Aggregation, for generating such contours using an in-network approach. Our technique achieves energy efficiency in two principal ways. Firstly, only a selection of nodes close to contours are chosen to report, and each reported message contains information about a part or all of the contours, rather than any single node's ID and value pair. Secondly, contours are progressively merged and simplified along the data routing tree, which eliminates many unnecessary contour points from contour vectors before they are transmitted back to the base station. Using Isovector Aggregation, the base station receives a complete representation of the contours that requires no further processing. Analysis shows that for region-related monitoring, Isovector Aggregation is the only technique that has) (n O traffic generation and that considers in-network traffic reduction at the same time. These two factors make Isovector Aggregation highly scalable. Experimental results using simulations also show that Isovector Aggregation involves considerably less data transmission compared to other approaches, such as the no-aggregation approach and the Isolines Aggregation technique, without compromising the accuracy of representations of the baseline maps. iii ACKNOWLEDGEMENTS I would like to thank my advisor, Dr. Michael F. Worboys for …

[1]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[2]  Guohong Cao,et al.  DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks , 2004, IEEE Transactions on Wireless Communications.

[3]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[4]  Deborah Estrin,et al.  Embedded Networked Sensing for Environmental Monitoring , 2005 .

[5]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.

[6]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[7]  Katia Obraczka,et al.  The impact of timing in data aggregation for sensor networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[8]  Yunhao Liu,et al.  Contour map matching for event detection in sensor networks , 2006, SIGMOD Conference.

[9]  Anantha Chandrakasan,et al.  Dynamic Power Management in Wireless Sensor Networks , 2001, IEEE Des. Test Comput..

[10]  Leonidas J. Guibas,et al.  A dual-space approach to tracking and sensor management in wireless sensor networks , 2002, WSNA '02.

[11]  Katia Obraczka,et al.  FLIP: A Flexible Interconnection Protocol for Heterogeneous Internetworking , 2004, Mob. Networks Appl..

[12]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[13]  Songwu Lu,et al.  Event Contour: An Efficient and Robust Mechanism for Tasks in Sensor Networks , 2004 .

[14]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[15]  Deborah Estrin,et al.  Habitat monitoring: application driver for wireless communications technology , 2001, CCRV.

[16]  Yunhao Liu,et al.  Iso-Map: Energy-Efficient Contour Mapping in Wireless Sensor Networks , 2010, IEEE Trans. Knowl. Data Eng..

[17]  Xiuzhen Cheng,et al.  TPS: a time-based positioning scheme for outdoor wireless sensor networks , 2004, IEEE INFOCOM 2004.

[18]  Johannes Gehrke,et al.  Query Processing in Sensor Networks , 2003, CIDR.

[19]  Sanjeev Khanna,et al.  Power-conserving computation of order-statistics over sensor networks , 2004, PODS.

[20]  N. Xu A Survey of Sensor Network Applications , 2002 .

[21]  Ying Zhang,et al.  Localization from mere connectivity , 2003, MobiHoc '03.

[22]  Cheng Zhong,et al.  Continuous Contour Mapping in Sensor Networks , 2008, 2008 5th IEEE Consumer Communications and Networking Conference.

[23]  Katia Obraczka,et al.  Isolines: energy-efficient mapping in sensor networks , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[24]  E. R. White Assessment of Line-Generalization Algorithms Using Characteristic Points , 1985 .

[25]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[26]  Jun Yang,et al.  Constraint chaining: on energy-efficient continuous monitoring in sensor networks , 2006, SIGMOD Conference.

[27]  Ramesh Govindan,et al.  Localized edge detection in sensor fields , 2003, Ad Hoc Networks.

[28]  Katia Obraczka,et al.  Efficient continuous mapping in sensor networks using isolines , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[29]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[30]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[31]  Katia Obraczka,et al.  Efficient protocols for power-constrained heterogeneous wireless ad-hoc networks , 2005 .

[32]  Xiuzhen Cheng,et al.  Localized fault-tolerant event boundary detection in sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[33]  Matt Welsh,et al.  Simulating the power consumption of large-scale sensor network applications , 2004, SenSys '04.

[34]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

[35]  Daniel J. Abadi,et al.  REED: Robust, Efficient Filtering and Event Detection in Sensor Networks , 2005, VLDB.

[36]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[37]  Michael F. Worboys,et al.  Monitoring dynamic spatial fields using responsive geosensor networks , 2005, GIS '05.

[38]  Wei Hong,et al.  The design of an acquisitional query processor for sensor networks , 2003, SIGMOD '03.

[39]  Divyakant Agrawal,et al.  Medians and beyond: new aggregation techniques for sensor networks , 2004, SenSys '04.

[40]  S. Suri,et al.  Approximate Isocontours and Spatial Summaries for Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[41]  Deborah Estrin,et al.  Residual Energy Scans for Monitoring Wireless Sensor Networks , 2002 .

[42]  Wei Hong,et al.  Beyond Average: Toward Sophisticated Sensing with Queries , 2003, IPSN.

[43]  Michael F. Worboys,et al.  Detecting Topological Change Using a Wireless Sensor Network , 2008, GIScience.