In this thesis we directly consider an object tracking problem for wireless sensor networks (WSNs), called track persistence. Track persistence temporally extends the problem of object tracking by seeking to store and retrieve the entire history of an object. To provide an initial solution to track persistence, we develop two distinct algorithms. The first algorithm, update to sink, translates track persistence into a centralized problem. The second algorithm, a linked list-like algorithm, builds a dynamic data structure as the object traverses the network, and rebuilds the object history distributively upon demand. We conduct worst case analysis upon both of these algorithms. Finally, we implement a simulation environment and run a number of tests upon both algorithms. Track persistence is a very challenging problem, and this thesis contributes a pair of solutions which stand as a basis for future research. / Thesis (Master, Computing) -- Queen's University, 2010-09-09 12:56:50.921
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:OKQ.1974/6033 |
| Date | 09 September 2010 |
| Creators | Bentley, Ian |
| Contributors | Queen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.)) |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English, English |
| Detected Language | English |
| Type | Thesis |
| Rights | This publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner. |
| Relation | Canadian theses |
Page generated in 0.0019 seconds