Duplicate-aware opportunistic routing for multi-hop wireless networks

Abstract

Recently, opportunistic routing has been proposed to take good advantage of broadcast nature and spatial diversity to achieve high throughput, despite highly unpredictable and lossy wireless links in multi-hop wireless networks. Most previous works provide heuristic solutions to select as many candidates, and don't take inter-candidate delivery probability into account, which might suffer acknowledgement loss and lead to duplicate forwarding, ultimately degrades network throughput. In this paper, a discrete-time Markov model is firstly presented to analyze duplicate forwarding probability at the candidates, and then simple candidates optimization algorithm and acknowledgement enhancement mechanism are proposed to eliminate the effect of duplicate forwarding. Simulations are conducted to verify our algorithm, and results show that there is a 20% gain in throughput when compared with traditional opportunistic routing protocol.