ExOR - Extremely Opportunistic Routing: Difference between revisions
Jump to navigation
Jump to search
| Line 13: | Line 13: | ||
|- |
|- |
||
|} |
|} |
||
| ⚫ | |||
{| style="float:center; background:transparent; padding:0px; margin:0px;" |
{| style="float:center; background:transparent; padding:0px; margin:0px;" |
||
|[[Image:distribution.jpg|thumb|center|300px|Number of used nodes in correlation with distance]] |
|[[Image:distribution.jpg|thumb|center|300px|Number of used nodes in correlation with distance]] |
||
|- |
|- |
||
} |
} |
||
| ⚫ | |||
= Problems = |
= Problems = |
||
Revision as of 12:21, 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 greatest benefit out of ExOR is its ability to skip intermediate hops.
The first graphic shows how ExOR reduces the number of Transmissions in a network.
}Problems
See also
External Links
Multi-Channel-Opportunistic Routing
