Computer Science – Operating Systems
Scientific paper
2008-03-25
The 2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2005), Washington, DC, November, 2005
Computer Science
Operating Systems
Scientific paper
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only. To efficiently construct a planar graph, they require a unit-disk graph. To make the topology unit-disk, the maximum link length in the network has to be selected conservatively. In practical setting this leads to the designs where the node density is rather high. Moreover, the network diameter of a planar subgraph is greater than the original graph, which leads to longer routes. To remedy this problem, we propose a void traversal algorithm that works on arbitrary geometric graphs. We describe how to use this algorithm for geometric routing with guaranteed delivery and compare its performance with GFG.
Nesterenko Mikhail
Vora Adnan
No associations
LandOfFree
Void Traversal for Guaranteed Delivery in Geometric Routing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Void Traversal for Guaranteed Delivery in Geometric Routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Void Traversal for Guaranteed Delivery in Geometric Routing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-49322