ExOR - Extremely Opportunistic Routing: Difference between revisions

From
Jump to navigation Jump to search
Line 11: Line 11:
{| style="float:center; background:transparent; padding:0px; margin:0px;"
{| style="float:center; background:transparent; padding:0px; margin:0px;"
|[[Image:transmissions.jpg|thumb|center|300px|Number of Transmissions per node pair]]
|[[Image:transmissions.jpg|thumb|center|300px|Number of Transmissions per node pair]]
|[[Image:distribution.jpg|thumb|center|300px|Number of used nodes in correlation with distance]]
|-
|-
|-
|}
|}
{| style="float:center; background:transparent; padding:0px; margin:0px;"

|[[Image:distribution.jpg|thumb|center|300px|Number of used nodes in correlation with distance]]

|-
}


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

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.

Number of Transmissions per node pair
} The first graphic shows how ExOR reduces the number of Transmissions in a network.

Problems

See also

External Links

hotnets-exor

Multi-Channel-Opportunistic Routing

SAR HU ExOR Solutions

Number of used nodes in correlation with distance