Cooperative rotational sweep schemes for geographic routing

Geographic routing operates with minimum local state information but requires a recovery method to bypass network voids. Under unit disk assumption (UDA) for connection between wireless nodes, recovery approaches based on rotational sweep algorithms with sweep curves can be employed to achieve packet delivery guarantee as well as low routing path hop counts. However, they are questionably applicable under more practical non UDA, let alone support the guarantee. For practical use, we propose a cooperative rotational sweep method operated in conjunction with the original one. Under a relaxed UDA by which connection between a pair of nodes within unit distance depends on path loss and Raleigh fading power, simulation results show that proposed schemes are able to achieve an extremely high routing success probability at the cost of the size of packet overhead carrying a recent history of visited nodes, essentially demonstrating a feasible tradeoff of memory length for routing success rates.