View source for ExOR - Extremely Opportunistic Routing

= Description =
Extremely Opportunistic Routing is a Routing algorithm that takes advantage of the characteristics of wireless networks.
Therefor ExOR determines the path as the packet moves through the network instead of choosing a single route ahead of time.

= Implementation = 
= Performance =
In comparison to many well-known Routing - algorithms like OSPF,DSR,AODV Opportunistic routing generally performs better than the
a margin of 55%. Depending on how large the network is there are improvements of up to 65%.
In generell the the greatest benefit out of ExOR is its ability to skip intermediate hops.

{| style="float:left; background:transparent; padding:0px; margin:0px;"
|- valign="top"
|[[Image:transmissions.jpg|thumb|left|300px|Number of Transmissions per node pair]]
|[[Image:distribution.jpg|thumb|right|300px|Number of used nodes in correlation with distance]]
|{subst:Absatz-L}}



The first graphic shows how ExOR reduces the number of Transmissions in a network.

= Problems =
= See also =
= External Links =
[https://pdos.csail.mit.edu/~rtm/papers/hotnets-exor.pdf hotnets-exor] 

[http://www.citeulike.org/user/zubow/article/1378866 Multi-Channel-Opportunistic Routing] 

[http://sar.informatik.hu-berlin.de/research/publications/SAR-PR-2006-11/SAR-PR-2006-11-abstract_.pdf SAR HU ExOR Solutions]