On the efficacy of opportunistic routing

Z Zhong, S Nelakuditi - … Conference on Sensor, Mesh and Ad …, 2007 - ieeexplore.ieee.org
… expected number of any-path transmissions needed to successfully deliver a packet between
two nodes under opportunistic routing. Based on EAX, we develop a candidate selection …

On the number of candidates in opportunistic routing for multi-hop wireless networks

A Darehshoorzadeh, M Almulla, A Boukerche… - Proceedings of the 11th …, 2013 - dl.acm.org
… In this paper, we investigated the effect of different number of candidates in each node in
Opportunistic Routing (OR). Although, having more number of candidates causes less number

Candidate selection algorithms in opportunistic routing

A Darehshoorzadeh, L Cerda-Alabern - … of the 5th ACM workshop on …, 2010 - dl.acm.org
… Since we first find the optimal candidate sets in the case of infinite number of candidates, …
for the candidate selection in OR: Extremely Opportunistic Routing (ExOR); Opportunistic Any-…

Modeling and comparison of candidate selection algorithms in opportunistic routing

A Darehshoorzadeh, L Cerda-Alabern, V Pla - Computer Networks, 2011 - Elsevier
… that may be achieved using opportunistic routing. This model is … the distances of the candidates
in opportunistic routing (OR) … We have also observed that the variance of the number of …

A survey on opportunistic routing in wireless communication networks

N Chakchouk - IEEE Communications Surveys & Tutorials, 2015 - ieeexplore.ieee.org
… , opportunistic routing can significantly reduce the number of … Thus, robustness is provided
by opportunistic routing at a … used in opportunistic routing for candidate relays prioritization. …

Least-cost opportunistic routing

H Dubois-Ferriere, M Grossglauser, M Vetterli - 2007 - infoscience.epfl.ch
… prioritize candidate next-hops so as to minimize routing costs… routing and extends it by
revisiting the question of candidate … an opportunistic route is to consider the number of candidate

Opportunistic routing in multi-hop wireless networks

S Biswas, R Morris - ACM SIGCOMM Computer Communication Review, 2004 - dl.acm.org
opportunistic routes using a candidate set size of 8. Figure 5 compares the average number
of transmissions required to route 100 … The results indicate opportunistic routing generally …

Optimal constrained candidate selection for opportunistic routing

AS Cacciapuoti, M Caleffi… - 2010 IEEE Global …, 2010 - ieeexplore.ieee.org
… In the following, we adopt as routing metric f(·) the average number of opportunistic data-link
transmissions (EOTX) [4], [10], but we underline that the proposed analytical model can be …

Candidate selection algorithms in opportunistic routing based on distance progress

A Darehshoorzadeh… - … Journal of Ad Hoc …, 2015 - inderscienceonline.com
… call distance progress based opportunistic routing, DPOR, which … number of candidates
are shown in Figures 5 and 6, respectively. As we can see, increasing the number of candidates

Opportunistic routing in wireless networks: Models, algorithms, and classifications

A Boukerche, A Darehshoorzadeh - ACM Computing Surveys (CSUR), 2014 - dl.acm.org
… main issues in OR: routing metrics, candidate coordination, and candidate selection algorithms;
these are … ncand shows the maximum number of candidates that each node can select. …