GPSR Greedy Perimeter Stateless Routing for Wireless GPSR的贪婪的周边无线无状态路由.pptVIP

GPSR: Greedy Perimeter Stateless Routing for Wireless Networks About GPSR GPSR allows nodes to figure out who its closest neighbors are (using beacons) that are also close to the final destination the information is supposed to travel to To calculate a path, GPSR uses a greedy forwarding algorithm that will send the information to the final destination using the most efficient path possible. If the greedy forwarding fails, perimeter forwarding will be used which routes around the perimeter of the region. About the Greedy Forwarding Algorithm Assuming the wireless routers [nodes] know their