Show simple item record

dc.contributor.advisorKeil, J. Marken_US
dc.creatorWatson, Mark Duncanen_US
dc.date.accessioned2006-01-03T12:37:37Zen_US
dc.date.accessioned2013-01-04T04:23:04Z
dc.date.available2006-01-03T08:00:00Zen_US
dc.date.available2013-01-04T04:23:04Z
dc.date.created2005-12en_US
dc.date.issued2005-12-13en_US
dc.date.submittedDecember 2005en_US
dc.identifier.urihttp://hdl.handle.net/10388/etd-01032006-123737en_US
dc.description.abstractAd-Hoc Wireless routing has become an important area of research in the last few years due to the massive increase in wireless devices. Computational Geometry is relevant in attempts to build stable, low power routing schemes. It is only recently, however, that models have been expanded to consider devices with a non-uniform broadcast range, and few properties are known. In particular, we find, via both theoretical and experimental methods, extremal properties for the Localized Delaunay Triangulation over the Mutual Inclusion Graph. We also provide a distributed, sub-quadratic algorithm for the generation of the structure.en_US
dc.language.isoen_USen_US
dc.subjectAlgorithmsen_US
dc.subjectGeometryen_US
dc.subjectDelaunay Triangulationen_US
dc.subjectComputational Geometryen_US
dc.subjectWireless Networksen_US
dc.subjectAd-Hoc Routingen_US
dc.titleThe localized Delaunay triangulation and ad-hoc routing in heterogeneous environmentsen_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.committeeMemberSoteros, Chrisen_US
dc.contributor.committeeMemberHorsch, Michael C.en_US
dc.contributor.committeeMemberEager, Derek L.en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record