CDAR : contour detection aggregation and routing in sensor networks
| dc.contributor.advisor | Stanley, Kevin | en_US |
| dc.contributor.advisor | Eager, Derek | en_US |
| dc.contributor.committeeMember | Keil, Mark | en_US |
| dc.contributor.committeeMember | salt, Eric | en_US |
| dc.contributor.committeeMember | Makaroff, Dwight | en_US |
| dc.creator | Pulimi, Venkat | en_US |
| dc.date.accessioned | 2010-05-04T14:27:54Z | en_US |
| dc.date.accessioned | 2013-01-04T04:30:26Z | |
| dc.date.available | 2011-05-05T08:00:00Z | en_US |
| dc.date.available | 2013-01-04T04:30:26Z | |
| dc.date.created | 2010-05 | en_US |
| dc.date.issued | 2010-05 | en_US |
| dc.date.submitted | May 2010 | en_US |
| dc.description.abstract | Wireless 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.identifier.uri | http://hdl.handle.net/10388/etd-05042010-142754 | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | Contour | en_US |
| dc.subject | Wireless sensor networks | en_US |
| dc.subject | Adhoc networks | en_US |
| dc.subject | Aggregation | en_US |
| dc.subject | Routing | en_US |
| dc.subject | Query propagation | en_US |
| dc.subject | Sensor networks | en_US |
| dc.subject | Isolines | en_US |
| dc.subject | Contour data | en_US |
| dc.title | CDAR : contour detection aggregation and routing in sensor networks | en_US |
| dc.type.genre | Thesis | en_US |
| dc.type.material | text | en_US |
| thesis.degree.department | Computer Science | en_US |
| thesis.degree.discipline | Computer Science | en_US |
| thesis.degree.grantor | University of Saskatchewan | en_US |
| thesis.degree.level | Masters | en_US |
| thesis.degree.name | Master of Science (M.Sc.) | en_US |