Download Now Free registration required
Greedy forwarding combined with planar graph routing exploits minimal local position information to achieve reliable packet delivery in wireless networks. However, it is at the expense of path hop counts and traffic loads converging on links dictated by a chosen planar graph traversal scheme to bypass network holes. To mitigate these negative factors for delay-sensitive traffic service, the authors forwarding scheme further utilizes a simple hypothesis test based on local information to partition the set of candidate neighborhood nodes for packet relay into two subsets. One is a preferable subset containing nodes more likely located in a dense area of nodes and less likely to be a local minimum for greedy forwarding while the other contains the rest.
- Format: PDF
- Size: 406.53 KB