ExOR - Extremely Opportunistic Routing: Difference between revisions
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
= Implementation = |
= Implementation = |
||
= Performance = |
= 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. |
|||
= Problems = |
= Problems = |
||
= See also = |
= See also = |
||
Revision as of 11:13, 23 July 2007
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.