A novel Routing-Algorithm for On-Demand information ... - About

w5.cs.uni.sb.de

A novel Routing-Algorithm for On-Demand information ... - About

LTDAR - Algorithm outline

• Beaconing data is stored in two different lists:

• Neighbour list

• Street lookup list

• Five consecutive steps when routing a packet:

Donnerstag, 22. Juli 2010

1. Update Lists according to beaconed data (delete old entries)

2. Check if destination node is in Neighbour list

3. Compute anchored path to the destination node

4. Estimate new position of the nodes in the Neighbour list

5. Choose the neighbour which is closest to one of the anchors as next-hop

20

More magazines by this user
Similar magazines