1 / 14

Routing Optimization Techniques for Wireless Ad Hoc Networks

Routing Optimization Techniques for Wireless Ad Hoc Networks. Maher Kaddoura, Ranga Ramanujan, and Steven Schneider Architecture Technology Corporation Eden Prairie, MN, USA. Contribution. Routing optimization techniques that greatly enhance network performance. Weighted Reservation (WR)

roana
Download Presentation

Routing Optimization Techniques for Wireless Ad Hoc Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Routing Optimization Techniques for Wireless Ad Hoc Networks Maher Kaddoura, Ranga Ramanujan, and Steven Schneider Architecture Technology Corporation Eden Prairie, MN, USA

  2. Contribution • Routing optimization techniques that greatly enhance network performance. • Weighted Reservation (WR) • Reduce the number of nodes that reserve network resources. • Search Range Control • Reduce flooding. • Local Self-healing • Reduce route disconnection times.

  3. Weighted Reservation • Route-Request Packet includes a counter that is incremented by each intermediate node. • Destination sets Route-Update Packet’s TTL to the distance between itself and Source plus a small value. • Intermediate node decrements the Route-Update Packet’s TTL as follows: • If the distance that separates the node from the Source is equal to or smaller than the distance that separate the Destination from Source, then decrement the packet’s TTL by 1. • If the distance that separates the node from Source is greater than the distance that separate Destinationfrom Source, then decrement the packet’s TTL by the difference between the two distances.

  4. Search Range Control • Source starts with small TTL value for Route-Request Packets and keep increasing it until it finds the desired route.

  5. Local Self-healing • Phase I: Employed during route establishment. • Phase II: Used after the route has been established. • Phase III: Used if Phase I and II fail to repair the Route.

  6. Phase I • Route-Update Packet includes a route log field, which contains an ordered sequence of route records, one for each node traversed by the Route-Update Packet. • A route record includes the address of the node and a log sequence number (log_seq). • A node’s log_seq is incremented each time the node is appended to a route log.

  7. Phase I Route Repair • The node broadcasts a Local Self-healing Packet (LSP), which includes the route log that it received from Route-Update Packet. • An intermediate node processes LSP as follows: If the node can satisfy the route QoS parameters, it rebroadcasts the packet; Otherwise the node drops the packet. • A node along the route processes LSP as follows: • If the node is downstream from the node that issued the LSP, it replies with Local Self-healing Reply Packet (LSRP). • If the node is upstream from the node that issued the packet, it drops the packet.

  8. Phase II • Periodically, each node sends an advertisement packet that includes its address and an advertisement sequence number along the path towards D. • A node advertisement sequence number is incremented each time a message is sent.

  9. Phase II Route Repair • The node broadcasts a LSP, which includes the last advertisement sequence number it used. • Processing of the local self-healing messages is similar to Phase I. • A node determines if it is downstream for the node that initiated the repair: • If a node has received an advertisement packet from the node that initiated the route repair with an advertisement sequence number that matches the one inthe LSP, it knows that it is downstream from the node that initiated route repair.

  10. Phase III Route Repair • The node sends the route’s packets to Destination using best-effort route. • The node sends an error message to Source. • When Source receives an error message it re-establish a new route to Destination.

  11. Simulation Environment • 64 identical nodes arranged in eight rows of eight nodes each. • 16 of the 64 nodes were designated as traffic sources. • 3 nodes were designated as destinations for the traffic sources. • Two sets of simulations • Several nodes in motion (Local Repair enabled/Disabled ). • Several nodes fail (Local Repair enabled/Disabled ).

  12. Performance (1 of 2) Nodes motion Nodes failure The local self-healing optimization technique reduced the number of lost packets by up to 59%.

  13. Performance (2 of 2) The time its takes to reconnect a disconnected route with and without local-self healing.

  14. Conclusion By employing three new route optimization techniques, the new QoS-aware routing algorithm has the potential to significantly improve ad hoc network performance and QoS provisioning over that obtainable using presently existing techniques.

More Related