Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorFayed, Marwanen_UK
dc.contributor.authorCairns, Daviden_UK
dc.contributor.authorMouftah, Hussein Ten_UK
dc.description.abstractIn this report we investigate the limits of routing according to left- or right-hand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits next in counter-clockwise order in the network graph. When used to recover from greedy routing failures, LHR guarantees success if implemented over planar graphs. This is often referred to as face or geographic routing. In the current body of knowledge it is known that if planarity is violated then LHR is guaranteed only to eventually return to the point of origin. Our work seeks to understand why a non-planar environment stops LHR from making delivery guarantees. Our investigation begins with an analysis to enumerate all node con gurations that cause intersections. A trace over each con guration reveals that LHR is able to recover from all but a single case, the `umbrella' con guration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PDLP) that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the `bad' links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of protocols such as CLDP and GDSTR.en_UK
dc.publisherDepartment of Computing Science and Mathematics, University of Stirlingen_UK
dc.relationFayed M, Cairns D & Mouftah HT (2010) An Analysis of Planarity in Face-Routing. Technical Report, CSM-184. Department of Computing Science and Mathematics, University of Stirling.en_UK
dc.relation.ispartofseriesTechnical Report, CSM-184en_UK
dc.subjectSensor networksen_UK
dc.titleAn Analysis of Planarity in Face-Routingen_UK
dc.typeTechnical Reporten_UK
dc.type.statusVoR - Version of Recorden_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.contributor.affiliationUniversity of Ottawaen_UK
rioxxterms.typeTechnical Reporten_UK
local.rioxx.authorFayed, Marwan|0000-0002-0970-7972en_UK
local.rioxx.authorCairns, David|0000-0002-0246-3821en_UK
local.rioxx.authorMouftah, Hussein T|en_UK
local.rioxx.projectInternal Project|University of Stirling|
local.rioxx.filenameAn Analysis of Planarity in Face-Routing.pdfen_UK
Appears in Collections:Computing Science and Mathematics Technical Reports

Files in This Item:
File Description SizeFormat 
An Analysis of Planarity in Face-Routing.pdfFulltext - Published Version781.49 kBAdobe PDFView/Open

This item is protected by original copyright

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved

If you believe that any material held in STORRE infringes copyright, please contact providing details and we will remove the Work from public display in STORRE and investigate your claim.