Institute of Electrical & Electronic Engineers
Cooperative routing has been shown to be an effective technique to improve the throughput/delay performance of multi-hop wireless ad hoc networks. In addition, suitable cooperation selection policies also allow for a reduction of the overall energy expenditure. In a previous study, the authors proposed a centralized algorithm to obtain optimal cooperation selection policies in multi-hop networks with the aim of minimizing a linear combination of energy and delay costs. In this paper, they look at this problem from a different angle, devising three online and fully distributed algorithms which only exploit local interactions for the selection of the cooperators. The first technique selects at each hop a fixed number of nodes having the minimum distance with respect to the destination.