Face Routing with Guaranteed Message Delivery in Wireless Ad-hoc Networks

Face routing is a simple method for routing in wireless ad-hoc networks. It only uses location information about nodes to do routing and it provably guarantees message delivery in static connected plane graphs. However, a static connected plane graph is often difficult to obtain in a real wireless n...

Full description

Bibliographic Details
Main Author: Guan, Xiaoyang
Other Authors: Ellen, Faith
Language:en_ca
Published: 2009
Subjects:
Online Access:http://hdl.handle.net/1807/19190
id ndltd-TORONTO-oai-tspace.library.utoronto.ca-1807-19190
record_format oai_dc
spelling ndltd-TORONTO-oai-tspace.library.utoronto.ca-1807-191902013-04-19T19:53:30ZFace Routing with Guaranteed Message Delivery in Wireless Ad-hoc NetworksGuan, XiaoyangWireless Ad-hoc NetworksRouting0984Face routing is a simple method for routing in wireless ad-hoc networks. It only uses location information about nodes to do routing and it provably guarantees message delivery in static connected plane graphs. However, a static connected plane graph is often difficult to obtain in a real wireless network. This thesis extends face routing to more realistic models of wireless ad-hoc networks. We present a new version of face routing that generalizes and simplifies previous face routing protocols and develop techniques to apply face routing directly on general, non-planar network graphs. We also develop techniques for face routing to deal with changes to the graph that occur during routing. Using these techniques, we create a collection of face routing protocols for a series of increasingly more general graph models and prove the correctness of these protocols.Ellen, FaithMarbach, Peter2009-112010-03-01T20:53:27ZNO_RESTRICTION2010-03-01T20:53:27Z2010-03-01T20:53:27ZThesishttp://hdl.handle.net/1807/19190en_ca
collection NDLTD
language en_ca
sources NDLTD
topic Wireless Ad-hoc Networks
Routing
0984
spellingShingle Wireless Ad-hoc Networks
Routing
0984
Guan, Xiaoyang
Face Routing with Guaranteed Message Delivery in Wireless Ad-hoc Networks
description Face routing is a simple method for routing in wireless ad-hoc networks. It only uses location information about nodes to do routing and it provably guarantees message delivery in static connected plane graphs. However, a static connected plane graph is often difficult to obtain in a real wireless network. This thesis extends face routing to more realistic models of wireless ad-hoc networks. We present a new version of face routing that generalizes and simplifies previous face routing protocols and develop techniques to apply face routing directly on general, non-planar network graphs. We also develop techniques for face routing to deal with changes to the graph that occur during routing. Using these techniques, we create a collection of face routing protocols for a series of increasingly more general graph models and prove the correctness of these protocols.
author2 Ellen, Faith
author_facet Ellen, Faith
Guan, Xiaoyang
author Guan, Xiaoyang
author_sort Guan, Xiaoyang
title Face Routing with Guaranteed Message Delivery in Wireless Ad-hoc Networks
title_short Face Routing with Guaranteed Message Delivery in Wireless Ad-hoc Networks
title_full Face Routing with Guaranteed Message Delivery in Wireless Ad-hoc Networks
title_fullStr Face Routing with Guaranteed Message Delivery in Wireless Ad-hoc Networks
title_full_unstemmed Face Routing with Guaranteed Message Delivery in Wireless Ad-hoc Networks
title_sort face routing with guaranteed message delivery in wireless ad-hoc networks
publishDate 2009
url http://hdl.handle.net/1807/19190
work_keys_str_mv AT guanxiaoyang faceroutingwithguaranteedmessagedeliveryinwirelessadhocnetworks
_version_ 1716581653559640064