adhoc路由协议介绍.pptVIP

AODV (Example) B S E C G F A H D Y I K P L J T Z AODV (Example) B S E C G F A H D Y I K P L J T Z Conclusion Protocol overhead depends on topology changes Proactive vs. reactive – Message latency – Number of messages – Involved nodes Link reversal vs. distance vector – Involved nodes – Alternative paths – Effect of disappearing links Geographic Routing Principle Each device has to know its position Position information has to be announced to devices in vicinity – 1-hop, 2-hop; exception: beaconless routing Opposed to classical routing, destination address is a position stored in message On receipt of a message forward to “best” neighbor(s) regarding own, destination, neighbor(s) position, and metric being optimized Position of receiver device has to be acquired in advance – Message update in each routing possible for proactive location service New communication pattern: Geocast * * * * * * * * * * * 内容比较多，感兴趣的话可以下次单独讲一次关于geographic routing的 * Ad hoc路由介绍 Infonet 2008-6-12 Protocol classification Topology-Based Routing Overview DSDV Destination-Sequenced Distance-Vector Routing 序列目的节点距离矢量路由协议 DSDV以路由信息协议为基础，仅适用于双向链路。每个节点保存有一个记录所有目的节点和到目的节点跳数的路由表。每一个条目都有一个序列号。标有更大序列号的路由信息总是被接收，相同时，选择metric（跳数）最小的，使路由最优。 路由表更新分组在全网内周期性的广播而使路由表保持连贯性。 DSDV (Tables) C Dest. Next Metric Seq A A 1 A-550 B B 0 B-100 C C 2 C-588 Dest. Next Metric Seq A A 0 A-550 B B 1 B-100 C B 3 C-586 Dest. Next Metric Seq. A B 1 A-550 B B 2 B-100 C C 0 C-588 B A 1 2 (A, 1, A-500) (B, 0, B-102) (C, 1, C-588) (A, 1, A-500) (B, 0, B-102) (C, 1, C-588) DSDV (Route Advertisement) C B A B increases Seq.Nr from 100 - 102 B broadcasts routing information to Neighbors A, C including destination sequence numbers Dest. Next Metric Seq A A 0 A-550 B B 1 B-102 C B 2 C-588 Dest. Next Metric Seq A A 1 A-550 B B 0 B-102 C C 1 C-588 Dest. Next Metric Seq. A B 2 A-550 B B 1 B-102 C C 0 C-588 1 1 DSDV (Respond to Topology Changes) Immediate advertisemen