No abstract

No abstract

The author has granted a non exclusive license allowing Library and Archives Canada to reproduce, publish, archive, preserve, conserve, communicate to the public by telecommunication or on the Internet, loan, distribute and sell theses worldwide, for commercial or non commercial purposes, in microform, paper, electronic and/or any other formats. AVIS: L'auteur a accorde une licence non exclusive permettant a la Bibliotheque et Archives Canada de reproduire, publier, archiver, sauvegarder, conserver, transmettre au public par telecommunication ou par I'lnternet, preter, distribuer et vendre des theses partout dans le monde, a des fins commerciales ou autres, sur support microforme, papier, electronique et/ou autres formats. i * i Canada Reproduced with permission of the copyright owner. Further reproduction prohibited without permission. My sincere gratitude goes to my supervisor Professor Nejib Zaguia, who both encouraged and funded my research. I would also like to thank Professor Ivan Stojmenovic deeply for his invaluable advice, encouragement, and guidance throughout my research activities. This thesis could not have been successful without their help. Furthermore, I would like to acknowledge the University of Ottawa for providing me with the opportunity to undertake my Master's degree with financial assistance. Finally, I would like to thank my parents for financing me and encouraging me to pursue higher studies at the University of Ottawa.

No abstract

No abstract

No abstract

we study in this paper the impact of the modifications introduced in version 1.2 of the Bluetooth specifications on Bluetooth Scatternet Formation (BSF) algorithms. Up to now, the effect of these modifications on BSF algorithms had not been analyzed. We show that: 1) Bluetooth ver1.2 and upward have a major positive effect on static BSF algorithms (i.e. those which require an external device discovery phase). We conducted some experiments on a common device discovery technique for static BSF algorithms and compared its performance using Ver1.2 and Ver1.1 (the latter is used in most BSF studies). We found that this technique, using ver1.2, generates a connected topology about 3.5 times faster than it does using ver1.1. It also discovers about 20% more edges. 2) Dynamic algorithms, on the other hand, are not affected by these modifications. This will be proven using some experiments and some analytical arguments. These results give more applicability to static BSF algorithms and call for more research on dynamic BSF algorithms.

No abstract