1Increasing the One-Hop Progress of Nearest Neighbor Forwarding

Abstract—Nearest neighbor forwarding (NNF) intends to max-imize throughput in wireless networks. However, NNF suffers from low one-hop progress and may therefore significantly increase end-to-end delay. The spatial efficiency (SE), i.e., the expectation of the ratio of progress to interference area associated with one hop, is introduced in order to quantify this trade-off. The problem of low progress is addressed by maximizing the one-hop SE, subject to the central angle γ, determining the forwarding area. By this, the optimal balance between minimizing the interference area and maximizing progress is found. Then, this analysis is extended by considering a Poisson point process, driven by some traffic intensity, on the interference area. Furthermore, the traffic aware γ∗-NNF strategy is proposed which adapts γ to the traffic intensity in order to maximize SE. Simulation results show a significant reduction of the end-to-end delay if γ∗-NNF is used. Index Terms—Wireless networks, greedy geographic routing, Poisson point process. I