<?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-22T17:22:56Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1152" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1152</identifier><datestamp>2017-03-21T19:47:05Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</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="89345075-c0ae-4110-b915-687e0b5374eb" confidence="600">Iu, Ming-Yee</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:25:10Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:25:10Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2002</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2002</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1152</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">An ad hoc network is a collection of mobile wireless devices that cooperate with each other to route packets amongst themselves.   The main difficulty in designing routing algorithms for such a network is the large number of topology changes that the network undergoes due to device movement.       
Selective flooding is a routing technique that is more resilient to topology changes than traditional algorithms but is more bandwidth efficient than pure flooding.   An on-demand selective flooding algorithm has been  designed and tested on the ns-2 simulator.   In scenarios involving a large number of topology changes, selective flooding outperforms other ad hoc network routing techniques.   Unfortunately, selective flooding is much  more bandwidth hungry and is unable to scale to handle reasonable traffic loads.       
Interestingly, the analysis of selective flooding reveals major problems with traditional ad hoc networking techniques.   Many current algorithms demonstrate shortcomings when dealing with bursty traffic, and current wireless hardware cannot handle ad hoc networking traffic in an efficient manner.   These issues need to be addressed before ad hoc networking technology can become feasible for widespread use.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">691768 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: 2002, 
  Iu, Ming-Yee. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">ad hoc networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">wireless networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">packet routing</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">selective flooding</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Selective Flooding in Ad Hoc Networks</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">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</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>