<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T19:03:07Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/864" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/864</identifier><datestamp>2017-03-21T19:28:13Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9908</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="8e83612b-3edd-4ec8-a75c-7249fb51dd19" confidence="600">Ramakrishnan, Karthik</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T13:51:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T13:51:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/864</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">An ad-hoc network is a packet radio network in which individual mobile nodes perform routing functions.   Typically, an ad-hoc networking concept allows users wanting to communicate with each other while forming a temporary network, without any form of centralized administration.   Each node participating in the network performs both the host and router function, and willing to forward packets for other nodes.   For this purpose a routing protocol is needed.     A novel approach utilizes the uniqueness of such a network i.  e.   distance, location and speed of the nodes, introducing a Distance Routing Effect Algorithm for Mobility (DREAM).   The protocol uses the &amp;lt;i&amp;gt;distance effect&amp;lt;/i&amp;gt; and the &amp;lt;i&amp;gt;mobility rate&amp;lt;/i&amp;gt; as a means to assure routing accuracy.   When data needs to be exchanged between two nodes, the directional algorithm sends messages in the recorded direction of the destination node, guaranteeing the delivery by following the direction.   The improved algorithm suggested within this thesis project includes an additional parameter, direction of travel, as a means of determining the location of a destination node.   When data needs to be exchanged between two nodes, the directional algorithm sends messages in the recorded direction of the destination node, guaranteeing the delivery by following the direction.   The end result is an enhancement to the delivery ratio, of the sent to the received packet.   This also allows the reduction in the number of control packets that need to be distributed, reducing the overall control overhead of the Improved Dream protocol.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">879789 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2005, 
  Ramakrishnan, Karthik. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Electrical &amp;amp; Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">DREAM</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Ad-Hoc Networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Routing Protocols</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">An Improved Model for the Dynamic Routing Effect Algorithm for Mobility Protocol</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Applied Science</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>