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.
Preview |
Text (application/pdf)
3MBMR10300.pdf - Accepted Version |
Abstract
This thesis proposes a new method of using face routing [2] 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 > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering |
---|---|
Item Type: | Thesis (Masters) |
Authors: | Zhang, Chunhua |
Pagination: | x, 74 leaves ; 29 cm. |
Institution: | Concordia University |
Degree Name: | M. Comp. Sc. |
Program: | Computer Science and Software Engineering |
Date: | 2005 |
Thesis Supervisor(s): | Opatrny, Jaroslav |
Identification Number: | LE 3 C66C67M 2005 Z43 |
ID Code: | 8708 |
Deposited By: | Concordia University Library |
Deposited On: | 18 Aug 2011 18:33 |
Last Modified: | 13 Jul 2020 20:05 |
Related URLs: |
Repository Staff Only: item control page