Forwarding mechanism using prioritized forwarders for opportunistic routing

Abstract

In ad hoc networks, backoff-based OR (opportunistic routing) protocols, which autonomously selects a forwarder among the potential forwarders based on a random backoff time, have been proposed. However, each potential forwarder must wait for the backoff time to avoid packet collisions among receivers. In addition, the terminal density strongly affects the performance since the backoff-based OR protocols improve the performance by using multiple terminals. In this paper, we propose a novel OR protocol called PRIOR (prioritized forwarding for opportunistic routing). In PRIOR, a terminal called prioritized forwarder, which forwards packets without using a backoff time, is selected among neighbours. In addition, we propose a hop-by-hop retransmission control that performs the retransmission terminal selection on the basis of a neighbour relation with the PFs. Moreover, we introduce an explicit acknowledgement mechanism on the basis of the difference of hop counts to alleviate the bad effect of the retransmission control in dense environments. Finally, we evaluate PRIOR in comparison with conventional backoff-based OR protocols in computer simulation.