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.

Optimal Constrained Candidate Selection for Opportunistic Routing

CACCIAPUOTI, ANGELA SARA;CALEFFI, MARCELLO;PAURA, LUIGI
2010

Abstract

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.
9781424456369
9781424456376
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11588/373976
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 24
  • ???jsp.display-item.citation.isi??? 1
social impact