Zhang, Chunhua (2005) A distributed algorithm for a back-bone planar subnetwork selection in a MANET to improve the efficiency of face routing algorithm. Masters thesis, Concordia University.
MR10300.pdf - Accepted Version
This thesis proposes a new method of using face routing  in an ad hoc, position-based, network that aims to lower the hop count of routes. In our method, we first establish a back-bone subnetwork of a given mobile ad hoc network (MANET). This back-bone subnetwork includes only some nodes of the MANET, but any node of the MANET is at most one hop away from a node in the subnetwork. Furthermore, the backbone subnetwork is connected whenever the original MANET forms a connected network. The algorithm for the back-bone subnetwork extraction is fully distributed. In our proposal, the routing in a MANET is done by first sending the message to a neighboring node of the back-bone subnetwork, then the routing continues in the back-bone subnetwork using the face routing on the Gabriel Graph of the back-bone subnetwork until a neighbor of the destination need is reached. An empirical evaluation of the new approach is done.
|Divisions:||Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering|
|Item Type:||Thesis (Masters)|
|Pagination:||x, 74 leaves ; 29 cm.|
|Degree Name:||M. Comp. Sc.|
|Program:||Computer Science and Software Engineering|
|Thesis Supervisor(s):||Opatrny, Jaroslav|
|Deposited By:||Concordia University Libraries|
|Deposited On:||18 Aug 2011 18:33|
|Last Modified:||05 Nov 2016 00:51|
Repository Staff Only: item control page