Breadcrumb

 
 

A generalization of the face routing algorithm to some non-planar networks

Title:

A generalization of the face routing algorithm to some non-planar networks

Ansari, Sabeel (2005) A generalization of the face routing algorithm to some non-planar networks. Masters thesis, Concordia University.

[img]
Preview
PDF - Accepted Version
2179Kb

Abstract

Since ad hoc networks run on limited resources, traditional routing algorithms designed for wired networks are not suitable for them. Routing algorithms which use the geographical location information of nodes are called position-based routing algorithms. In such algorithms, the ad hoc network is modeled as a geometric graph known as the unit disk graph. The FACE ROUTING algorithm is one such position-based routing algorithm which guarantees delivery without flooding control packets throughout the network. In this work, we propose an extension to the F ACE ROUTING algorithm for a particular set of non-planar graphs, called Face Routing On Networks with Crossings ( FRONC ). FRONC guarantees delivery on a network that can be obtained from a planar graph by the addition of disjoint crossing edges.

Divisions:Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Ansari, Sabeel
Pagination:ix, 52 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science and Software Engineering
Date:2005
Thesis Supervisor(s):Narayanan, Lata and Opatrny, Jaroslav
ID Code:8252
Deposited By:Concordia University Libraries
Deposited On:18 Aug 2011 14:19
Last Modified:18 Aug 2011 15:40
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Document Downloads

More statistics for this item...

Concordia University - Footer