|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
Mouftah, Hussein T
|Title:||Revisiting Planarity in Position-Based Routing for Wireless Networks|
|Citation:||Cairns D, Fayed M & Mouftah HT (2013) Revisiting Planarity in Position-Based Routing for Wireless Networks In: Zheng J, Mitton N, Li J & Lorenz P (eds.) Ad Hoc Networks: 4th International ICST Conference, ADHOCNETS 2012, Paris, France, October 16-17, 2012, Revised Selected Papers. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 111. 4th International ICST Conference, ADHOCNETS 2012, Berlin Heidelberg, 16.10.2012-17.10.2012. Berlin Heidelberg: Springer, pp. 87-102. http://link.springer.com/chapter/10.1007/978-3-642-36958-2_7#; https://doi.org/10.1007/978-3-642-36958-2_7.|
|Series/Report no.:||Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 111|
|Conference Name:||4th International ICST Conference, ADHOCNETS 2012|
|Conference Dates:||2012-10-16 - 2012-10-17|
|Conference Location:||Paris, France|
|Abstract:||In this paper 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-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 begins with an analysis to enumerate all node configurations that cause intersections. A trace over each configuration reveals that left-hand rule is able to recover from all but a single case, the ‘umbrella' configuration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PLDP) 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 CLDP and GDSTR.|
|Status:||VoR - Version of Record|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|Revisiting Planarity in Position-Based Routing for Wireless Networks.pdf||Fulltext - Published Version||337.88 kB||Adobe PDF||Under Embargo until 2999-12-01 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
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 https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.