doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 1 Implementation and Evaluation of AODV with Proactive Route Announcements Notice: This document has been prepared to assist IEEE It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein. Release: The contributor grants a free, irrevocable license to the IEEE to incorporate material contained in this contribution, and any modifications thereof, in the creation of an IEEE Standards publication; to copyright in the IEEE’s name any IEEE Standards publication even though it may include portions of this contribution; and at the IEEE’s sole discretion to permit others to reproduce in whole or in part the resulting IEEE Standards publication. The contributor also acknowledges and accepts that this contribution may be made public by IEEE Patent Policy and Procedures: The contributor is familiar with the IEEE 802 Patent Policy and Procedures, including the statement "IEEE standards may include the known use of patent(s), including patent applications, provided the IEEE receives assurance from the patent holder or applicant with respect to patents essential for compliance with both mandatory and optional portions of the standard." Early disclosure to the Working Group of patent information that might be relevant to the standard is essential to reduce the possibility for delays in the development process and increase the likelihood that the draft publication will be approved for publication. Please notify the Chair as early as possible, in written or electronic form, if patented technology (or technology under patent application) might be incorporated into a draft standard being developed within the IEEE Working Group. If you have questions, contact the IEEE Patent Committee Administrator at. Date: Authors:

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 2 Outline Overview of AODV with proactive route announcements Implementation Evaluation methodology Simulation results Summary

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 3 AODV with Proactive Route Announcements Goal: reduce route discovery latency in on-demand routing protocols Proposal: a mesh portal proactively announces itself [1] –Broadcast Route Announcement (RANN) messages periodically –Allow mesh points (MP) to establish routes to the mesh portal –Allow a mesh portal to learn routes to mesh points by setting a bi- directional communication (registration) flag in a RANN message A mesh point will send a gratuitous route reply to the mesh portal

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 4 Implementation Send a route announcement message as a special route request message –Add a flag in RREQ to indicate that it is a RANN message –Set route lifetime to indicate how long a MP should keep the route learned from a RANN message Each MP maintains a cache of message IDs for recently received RANN messages to avoid duplicate broadcasts –The timeout for an entry is set to 6 s A MP receiving a RANN message stores the route to the mesh portal and rebroadcasts the message –The bi-directional communication (registration) flag is set to false in the simulations

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 5 Evaluation Methodology Use ns-2 network simulator (ns-2.28) –Radio propagation model: two-ray ground model –Network interface queue: Priority drop-tail queue –IEEE : data rate is 11 Mbps and transmission range is 250 m Traffic model: Pareto traffic –Traffic is generated according to a Pareto on/off distribution Packets are sent at a fixed rate during on periods, and no packets are sent during off periods Both on and off periods are taken from a Pareto distribution with constant size packets –Aggregate traffic exhibits long range dependency (Web traffic) –Packet size: 512 bytes; mean burst time: 20 s; mean idle time: 60 s; data rate: 20k; Pareto shape parameter: 1.5 –Traffic sources send data only to mesh portals

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 6 Evaluation Methodology Network topology –Random topology: generated using random waypoint mobility model without node mobility Field configuration: 1500 m * 800 m with 32 nodes including 2 portals –Grid topology Field configuration: 1500 m * 800 m with 32 nodes 4 * 8 grid: horizontal distance between nodes is 150 m and vertical distance between nodes is 180 m For the one data flow case, source node and a portal are at the ends of a diagonal line; for other cases, the positions of two portals are (250,100) and (700,460) respectively –Line topology Field configuration: 1000 m * 600 m with 5 nodes including 1 portal (source node and the portal are at the ends of the line)

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 7 Evaluation Methodology Metrics –Route discovery latency: the average latency required for route discovery –Packet delivery latency: the average latency between originating a data packet till the packet is received by the destination –Total control packets: total control packets sent and forwarded –Normalized routing overhead: the ratio of total control packets to total data packets received Simulation parameters –AODV-Proactive: Announcement interval: 10 s and 60 s Route lifetime in a RANN message: 30 s and 180 s for the 10 s and the 60 s intervals respectively –AODV: active route timeout is 10 s –Simulations run for 900 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 8 Simulation Results (Random Topology) Announcement interval: 10 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 9 Simulation Results (Random Topology) Announcement interval: 60 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 10 Simulation Results (Random Topology) Announcement interval: 10 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 11 Simulation Results (Random Topology) Announcement interval: 60 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 12 Simulation Results (Random Topology) Announcement interval: 10 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 13 Simulation Results (Random Topology) Announcement interval: 60 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 14 Simulation Results (Random Topology) Announcement interval: 10 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 15 Simulation Results (Random Topology) Announcement interval: 60 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 16 Simulation Results (Grid Topology) Announcement interval: 10 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 17 Simulation Results (Grid Topology) Announcement interval: 60 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 18 Simulation Results (Grid Topology) Announcement interval: 10 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 19 Simulation Results (Grid Topology) Announcement interval: 60 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 20 Simulation Results (Grid Topology) Announcement interval: 10 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 21 Simulation Results (Grid Topology) Announcement interval: 60 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 22 Simulation Results (Grid Topology) Announcement interval: 10 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 23 Simulation Results (Grid Topology) Announcement interval: 60 s

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 24 Simulation Results (Line Topology)

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 25 Simulation Results (Line Topology)

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 26 Simulation Results (Line Topology)

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 27 Simulation Results (Line Topology)

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 28 Summary Proactive route announcements reduce route discovery latency, and reduce delivery latency in some scenarios Proactive route announcements reduce flooding of route requests by each source although they incur overhead –When the number of flows is large, routing overhead of AODV with proactive route announcements is lower than that of AODV –When the number of flows is small, routing overhead of AODV with proactive route announcements is higher than that of AODV Selection of protocol parameters (route announcement interval) is important –Routing overhead reduced with increasing announcement interval

doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 29 References [1] W-Mesh Alliance, “Wi-Mesh Alliance Proposal for TGs”, IEEE /573r3, July 2005 [2] C. Perkins, E. Royer, S. Das, “Ad-hoc On-Demand Distance Vector (AODV) Routing”, IETF Internet draft, draft-ietf-manet-aodv-13.txt, Feb