Network Working Group C. Perkins
Request for Comments: 3561 Nokia Research Center
Category: Experimental E. Belding-Royer
University of California, Santa Barbara
S. Das
University of Cincinnati
July 2003
Ad hoc On-Demand Distance Vector (AODV) Routing
Status of this Memo
This memo defines an Experimental Protocol for the Internet
community. It does not specify an Internet standard of any kind.
Discussion and suggestions for improvement are requested.
Distribution of this memo is unlimited.
Copyright Notice
Copyright (C) The Internet Society (2003). All Rights Reserved.
Abstract
The Ad hoc On-Demand Distance Vector (AODV) routing protocol is
intended for use by mobile nodes in an ad hoc network. It offers
quick adaptation to dynamic link conditions, low processing and
memory overhead, low network utilization, and determines unicast
routes to destinations within the ad hoc network. It uses
destination sequence numbers to ensure loop freedom at all times
(even in the face of anomalous delivery of routing control messages),
avoiding problems (such as "counting to infinity") associated with
classical distance vector protocols.
Table of Contents
1. Introduction ............................................... 2
2. Overview .................................................. 3
3. AODV Terminology ........................................... 4
4. Applicability Statement .................................... 6
5. Message Formats ............................................ 7
5.1. Route Request (RREQ) Message Format ................... 7
5.2. Route Reply (RREP) Message Format ..................... 8
5.3. Route Error (RERR) Message Format ..................... 10
5.4. Route Reply Acknowledgment (RREP-ACK) Message Format .. 11
6. AODV Operation ............................................. 11
6.1. Maintaining Sequence Numbers .......................... 11
6.2. Route Table Entries and Precursor Lists ............... 13
Perkins, et. al. Experimental [Page 1]
RFC 3561 AODV Routing July 2003
6.3. Generating Route Requests ............................. 14
6.4. Controlling Dissemination of Route Request Messages ... 15
6.5. Processing and Forwarding Route Requests .............. 16
6.6. Generating Route Replies .............................. 18
6.6.1. Route Reply Generation by the Destination ...... 18
6.6.2. Route Reply Generation by an Intermediate
Node ........................................... 19
6.6.3. Generating Gratuitous RREPs .................... 19
6.7. Receiving and Forwarding Route Replies ................ 20
6.8. Operation over Unidirectional Links ................... 21
6.9. Hello Messages ........................................ 22
6.10 Maintaining Local Connectivity ........................ 23
6.11 Route Error (RERR) Messages, Route Expiry and Route
Deletion .............................................. 24
6.12 Local Repair .......................................... 26
6.13 Actions After Reboot ................................. 27
6.14 Interfaces ............................................ 28
7. AODV and Aggregated Networks ............................... 28
8. Using AODV with Other Networks ............................. 29
9. Extensions ................................................. 30
9.1. Hello Interval Extension Format ....................... 30
10. Configuration Parameters ................................... 31
11. Security Considerations .................................... 33
12. IANA Considerations ........................................ 34
13. IPv6 Considerations ........................................ 34
14. Acknowledgments ............................................ 34
15. Normative References ....................................... 35
16. Informative References ..................................... 35
17. Authors' Addresses ......................................... 36
18. Full Copyright Statement ................................... 37
1. Introduction
The Ad hoc On-Demand Distance Vector (AODV) algorithm enables
dynamic, self-starting, multihop routing between participating mobile
nodes wishing to establish and maintain an ad hoc network. AODV
allows mobile nodes to obtain routes quickly for new destinations,
and does not require nodes to maintain routes to destinations that
are not in active communication. AODV allows mobile nodes to respond
to link breakages and changes in network topology in a timely manner.
The operation of AODV is loop-free, and by avoiding the Bellman-Ford
"counting to infinity" problem offers quick convergence when the ad
hoc network topology changes (typically, when a node moves in the
network). When links break, AODV causes the affected set of nodes to
be notified so that they are able to invalidate the routes using the
lost link.
Perkins, et. al. Experimental [Page 2]
RFC 3561 AODV Routing July 2003
One distinguishing feature of AODV is its use of a destination
sequence number for each route entry. The destination sequence
number is created by the destination to be included along with any
route information it sends to requesting nodes. Using destination
sequence numbers ensures loop freedom and is simple to program.
Given the choice between two routes to a destination, a requesting
node is required to select the one with the greatest sequence number.
2. Overview
Route Requests (RREQs), Route Replies (RREPs), and Route Errors
(RERRs) are the message types defined by AODV. These message types
are received via UDP, and normal IP header processing applies. So,
for instance, the requesting node is expected to use its IP address
as the Originator IP address for the messages. For broadcast
messages, the IP limited broadcast address (255.255.255.255) is used.
This means that such messages are not blindly forwarded. However,
AODV operation does require certain messages (e.g., RREQ) to be
disseminated widely, perhaps throughout the ad hoc network. The
range of dissemination of such RREQs is indicated by the TTL in the
IP header. Fragmentation is typically not required.
As long as the endpoints of a communication connection have valid
routes to each other, AODV does not play any role. When a route to a
new destination is needed, the node broadcasts a RREQ to find a route
to the destination. A route can be determined when the RREQ reaches
either the destination itself, or an intermediate node with a 'fresh
enough' route to the destination. A 'fresh enough' route is a valid
route entry for the destination whose associated sequence number is
at least as great as that contained in the RREQ. The route is made
available by unicasting a RREP back to the origination of the RREQ.
Each node receiving the request caches a route back to the originator
of the request, so that the RREP can be unicast from the destination
along a path to that originator, or likewise from any intermediate
node that is able to satisfy the request.
Nodes monitor the link status of next hops in active routes. When a
link break in an active route is detected, a RERR message is used to
notify ot
没有合适的资源?快使用搜索试试~ 我知道了~
aodv-uu-0.9.5(1).rar_NS2 aodv_aodv_aodv ns2_aodv协议仿真_patch aodv
共70个文件
h:26个
c:23个
patch:8个
1.该资源内容由用户上传,如若侵权请联系客服进行举报
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
2.虚拟产品一经售出概不退款(资源遇到问题,请及时私信上传者)
版权申诉
5星 · 超过95%的资源 1 下载量 23 浏览量
2022-09-24
14:00:52
上传
评论
收藏 252KB RAR 举报
温馨提示
基于NS2平台的aodv协议仿真实现源码
资源推荐
资源详情
资源评论
收起资源包目录
aodv-uu-0.9.5(1).rar (70个子文件)
www.pudn.com.txt 218B
aodv-uu-0.9.5
llf.h 1KB
lnx
kaodv-queue.c 7KB
kaodv-debug.h 2KB
kaodv-netlink.h 4KB
kaodv-ipenc.c 4KB
kaodv-netlink.c 8KB
kaodv-queue.h 1KB
kaodv-expl.h 2KB
kaodv-expl.c 8KB
kaodv-ipenc.h 2KB
TAGS 5KB
Makefile 3KB
kaodv-mod.h 2KB
kaodv-debug.c 1KB
kaodv-mod.c 10KB
locality.h 1KB
timer_queue.h 3KB
aodv_rerr.h 2KB
aodv_rreq.h 3KB
GPL 18KB
aodv_rrep.h 3KB
main.c 17KB
params.h 3KB
aodv_socket.h 2KB
aodv_timeout.c 7KB
seek_list.h 2KB
aodv_rreq.c 18KB
aodv_neighbor.c 6KB
README.ns 15KB
ns
packet_input.h 1KB
packet_queue.cc 5KB
packet_queue.h 2KB
packet_input.cc 6KB
aodv-uu.cc 17KB
aodv-uu.h 6KB
seek_list.c 3KB
patches
ns-2.27-aodv-uu-0.9.1.patch 21KB
ns-2.29-aodv-uu-0.9.1-dsr-uu-0.2-oolsr-0.99.15.patch 339KB
ns-2.26-aodv-uu-0.8.patch 21KB
ns-2.28-aodv-uu-0.9.1.patch 23KB
ns-2.27-aodv-uu-0.9.patch 21KB
ns-2.27-aodv-uu-0.8.patch 21KB
ns-2.32-aodv-uu.patch 17KB
ns-2.29.3-aodv-uu-0.9.2.patch 18KB
rfc3561.txt 88KB
aodv_rerr.c 6KB
aodv_hello.c 8KB
aodv_rrep.c 12KB
aodv_socket.c 15KB
README 11KB
list.c 2KB
timer_queue.c 5KB
nl.h 1KB
TAGS 13KB
list.h 2KB
llf.c 10KB
debug.h 2KB
aodv_hello.h 2KB
debug.c 11KB
Makefile 7KB
defs.h 6KB
routing_table.h 4KB
ChangeLog 9KB
locality.c 2KB
aodv_timeout.h 1KB
routing_table.c 15KB
endian.c 2KB
nl.c 14KB
aodv_neighbor.h 1KB
共 70 条
- 1
资源评论
- 2301_766824442024-03-15资源内容总结地很全面,值得借鉴,对我来说很有用,解决了我的燃眉之急。
小贝德罗
- 粉丝: 67
- 资源: 1万+
下载权益
C知道特权
VIP文章
课程特权
开通VIP
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功