Masters Thesis
Nicholas Pilon. Refining an Ant-Based Routing Protocol for Mobile Ad-Hoc Networks. Masters Thesis, Dalhousie University, December 2007 - [PDF]
Abstract: In this thesis, two new proactive routing protocols for use on wireless Mobile Ad-Hoc Networks are developed and tested using a discrete event-based network simulator. These protocols explore routing based on an ant based social insect metaphor. The use of snooping on wireless packet transmissions to augment routing protocol operation is also investigated. Prior work relied on global information to control the population of ants. The protocols presented in this thesis replace this global information with a completely local ant population control algorithm.
To test the performance of these protocols, a basic discrete event network simulator is implemented. Using this simulator, the proposed protocols are compared to AODV using several metrics in a variety of scenarios. The results indicate that the ant-based protocol is an overall improvement, with better performance and lower overhead.
Honors Thesis
Nicholas Pilon. Implementation of a Poly-log Dynamic Connectivity Algorithm. Honors thesis, Dalhousie University, September 2004 - [PDF]
Abstract: In this thesis, we implement and test a fully-dynamic connectivity algorithm for bigraphs proposed by Holm, de Lichtenberg, and Thorup. For a graph with n nodes, the algorithm achieves poly-log time complexity by maintaining a spanning tree over each component of the graph. The spanning trees are stored by placing an Euler tour over the tree in a splay tree. The implementation was written in C++. Analysis of the implementation’s performance in randomized trials indicates that it meets this theoretical bound.