Mobility

A Hop Count Based Greedy Face Greedy Routing Protocol on Localized Geometric Spanners

Free registration required

Executive Summary

The authors describe a Fast Delivery Guaranteed Face Routing (FDGF) in ad hoc wireless networks. Since it is expensive for wireless nodes to get the whole network topology information, geometric routing decisions should be made locally by nodes using location information of neighboring nodes which are at most k hops away. In this paper, they first define k-local algorithm and obtain two local geometric graphs, i.e., k-Local Delauany Triangulation Graph (k-LDTG) and k-Local Minimum Weight Spanning Tree (k-LMWST), which are more efficient than existing definitions. They present problems with existing face routing protocols and propose FDGF to counter possible long delivery delay with high probability.

  • Format: PDF
  • Size: 134.7 KB