Show simple item record

dc.contributor.advisorStanley, Kevinen_US
dc.contributor.advisorEager, Dereken_US
dc.creatorPulimi, Venkaten_US
dc.date.accessioned2010-05-04T14:27:54Zen_US
dc.date.accessioned2013-01-04T04:30:26Z
dc.date.available2011-05-05T08:00:00Zen_US
dc.date.available2013-01-04T04:30:26Z
dc.date.created2010-05en_US
dc.date.issued2010-05en_US
dc.date.submittedMay 2010en_US
dc.identifier.urihttp://hdl.handle.net/10388/etd-05042010-142754en_US
dc.description.abstractWireless sensor networks offer the advantages of low cost, flexible measurement of phenomenon in a wide variety of applications, and easy deployment. Since sensor nodes are typically battery powered, energy efficiency is an important objective in designing sensor network algorithms. These algorithms are often application-specific, owing to the need to carefully optimize energy usage, and since deployments usually support a single or very few applications. This thesis concerns applications in which the sensors monitor a continuous scalar field, such as temperature, and addresses the problem of determining the location of a contour line in this scalar field, in response to a query, and communicating this information to a designated sink node. An energy-efficient solution to this problem is proposed and evaluated. This solution includes new contour detection and query propagation algorithms, in-network-processing algorithms, and routing algorithms. Only a small fraction of network nodes may be adjacent to the desired contour line, and the contour detection and query propagation algorithms attempt to minimize processing and communication by the other network nodes. The in-network processing algorithms reduce communication volume through suppression, compression and aggregation techniques. Finally, the routing algorithms attempt to route the contour information to the sink as efficiently as possible, while meshing with the other algorithms. Simulation results show that the proposed algorithms yield significant improvements in data and message volumes compared to baseline models, while maintaining the integrity of the contour representation.en_US
dc.language.isoen_USen_US
dc.subjectContouren_US
dc.subjectWireless sensor networksen_US
dc.subjectAdhoc networksen_US
dc.subjectAggregationen_US
dc.subjectRoutingen_US
dc.subjectQuery propagationen_US
dc.subjectSensor networksen_US
dc.subjectIsolinesen_US
dc.subjectContour dataen_US
dc.titleCDAR : contour detection aggregation and routing in sensor networksen_US
thesis.degree.departmentComputer Scienceen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.grantorUniversity of Saskatchewanen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Science (M.Sc.)en_US
dc.type.materialtexten_US
dc.type.genreThesisen_US
dc.contributor.committeeMemberKeil, Marken_US
dc.contributor.committeeMembersalt, Ericen_US
dc.contributor.committeeMemberMakaroff, Dwighten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record