Optimal Constrained Candidate Selection for Opportunistic Routing

In this paper we address the issue of the optimal candidate-set selection in the opportunistic routing paradigm. More specifically, although several algorithms for selecting the optimal candidate set have been proposed, to the best of our knowledge none of them has never considered the problem of selecting the optimal constrained candidate set, namely the optimal candidate set with a fixed maximum set size. In this paper we contribute to this problem by providing an analytical framework to model both the optimal constrained and unconstrained candidate-set selection. Moreover, we propose two algorithms for optimal candidate-set selection for distance vector routing, one for the constrained and one for the unconstrained case. Simulations based on experimental data validate our proposal.