Deakin home > Deakin University Library > Deakin Research Online > Ripple effect : an improved geographic routing with local connectivity information
Openly accessible

Ripple effect : an improved geographic routing with local connectivity information

Li, Ming 2008, Ripple effect : an improved geographic routing with local connectivity information, in ATNAC 2008 : Proceedings of the 2008 Australasian Telecommunication Networks and Applications Conference, IEEE, Piscataway, N.J., pp. 252-257.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads
li-rippleeffect-2008.pdf Published version application/pdf 156.14KB 72

Title Ripple effect : an improved geographic routing with local connectivity information
Author(s) Li, Ming
Conference name Australasian Telecommunication Networks and Applications Conference (2008 : Adelaide, S. Aust.)
Conference location Adelaide, S. Aust.
Conference dates 7-10 December 2008
Title of proceedings ATNAC 2008 : Proceedings of the 2008 Australasian Telecommunication Networks and Applications Conference
Editor(s) [Unknown]
Publication date 2008
Conference series Australasian Telecommunication Networks and Applications Conference
Start page 252
End page 257
Publisher IEEE
Place of publication Piscataway, N.J.
Summary One of the key challenges in geographic routing is how to deal with dead-ends, where greedy routing fails to find a neighbor node which is closer to the destination. Most existing geographic routing algorithms just switch to the deterministic face routing or limits its face searching range. In this paper, we demonstrate that we can improve routing performance by considering local connectivity status at each node before making routing decision. We present a protocol, Density Ripple Exchange (DRE), that maintains local density information at each node, and a new geographic routing algorithm, Geographic Ripple Routing (GRR), that achieves better routing performance in both hop stretch and transmission stretch than existing geographic routing algorithms by exploiting available connectivity information. Our simulations demonstrate that we increased the performance for GRR over Greedy Perimeter Stateless Routing (GPSR) by about 15%. The cost of this improved performance is a small amount of additional local connectivity information required for our algorithm.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 9781424426034
Language eng
Field of Research 080503 Networking and Communications
HERDC Research category E1 Full written paper - refereed
Persistent URL http://hdl.handle.net/10536/DRO/DU:30018148

Document type: Conference Paper
Collections: School of Engineering and Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Access Statistics: 345 Abstract Views, 72 File Downloads  -  Detailed Statistics
Created: Fri, 14 Aug 2009, 14:05:22 EST