Login | Register

Routing in sensing-covered ad hoc networks


Routing in sensing-covered ad hoc networks

El Salti, Tarek (2007) Routing in sensing-covered ad hoc networks. Masters thesis, Concordia University.

[thumbnail of MR34435.pdf]
Text (application/pdf)
MR34435.pdf - Accepted Version


We introduce a new approach in ad hoc networks for obtaining a sensing-covered network in the 2-D environment. This approach is based on a grid technique and the unit disk graph ( UDG ). This technique makes sure that a region is fully covered by a small number of sensor nodes. To experiment with variations of the generated graph, we introduce a new subgraph of the UDG. This graph is a generalization of the Yao graph in 2-D environment where the cones used are adaptively centered on a set of nearest neighbors for each node, thus creating a directed or undirected spanning subgraph. We also permit the apex of the cones to be positioned anywhere along the line segment between the node and its nearest neighbor, leading to a class of Yao -type subgraphs. We give an extension of the DAAY (both directed and undirected) from the 2-D environment to the 3-D environment. For routing on such a 2-D sensing-covered sensor network topology, we propose new routing protocols. Some of these new routing algorithms include hybrid routing algorithms which are based on the BVGF routing protocol of Xing et al. (2006) and our own protocols. The reason for these combinations is that we show that the BVGF routing protocol does not guarantee delivery all the time on general sensing covered networks. Our hybrid algorithms do guarantee delivery on such networks. We demonstrate through simulations that our proposed routing protocols perform much faster compared to some existing routing protocols. We also compare the routing protocols based on the path lengths (hops or Euclidean distances). Our routing protocols show good performance in terms of these metrics.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:El Salti, Tarek
Pagination:xii, 112 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science and Software Engineering
Thesis Supervisor(s):Fevens, Thomas
Identification Number:LE 3 C66C67M 2007 E47
ID Code:975368
Deposited By: Concordia University Library
Deposited On:22 Jan 2013 16:06
Last Modified:13 Jul 2020 20:07
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

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top