1 / 14

On-demand Node-Disjoint Multipath Routing in Wireless Ad hoc Networks

On-demand Node-Disjoint Multipath Routing in Wireless Ad hoc Networks. Xuefei Li and Laurie Cuthbert. Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN’04). Abstract. two novel aspects it reduces routing overhead

shirin
Download Presentation

On-demand Node-Disjoint Multipath Routing in 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. On-demand Node-Disjoint Multipath Routing in Wireless Ad hoc Networks Xuefei Li and Laurie Cuthbert Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN’04)

  2. Abstract • two novel aspects • it reduces routing overhead • achieves multiple node-disjoint routing paths • Simulation results • lower data delay and control overhead • higher packet delivery ratio

  3. 1. Introduction • The Node-Disjoint Multipath Routing Protocol (NDMR) • extends AODV to enable path accumulation feature of DSR in route request/reply packets • discover multiple node-disjoint routing paths

  4. 2. Node-Disjoint Multipath Routing (NDMR) 2.1 Path Accumulation • each node appends its own address to the routing request packets(RREQ). • the destination judges node-disjoint path.

  5. 2.1 Path Accumulation

  6. 2.2 Decreasing Routing Overhead • a node receives a RREQ packet for the first time • checks the path accumulation from the packet and calculates the number of hops from the source to itself • records the number as the shortest number of hops in its reverse route table entry • Larger • drop • less • broadcast

  7. 2.2 Decreasing Routing Overhead • S-c-f-D, S-a-d-g-D, S-b-e-h-D, S-c-d-g-D, S-c-e-h-D, S-c-f-g-D, S-c-f-h-D

  8. 2.3 Select Node-Disjoint Paths • the destination selects and records multiple node-disjoint route paths. • the destination receives the first RREQ packet • records node IDs in its reverse route table • sends a RREP that includes the route path • destination receives a duplicate RREQ • satisfies node-disjointness and is recorded in the reverse route table

  9. 2.3 Select Node-Disjoint Paths • shortest route path: S-c-f-D • node-disjoint route paths: S-a-d-g-D, S-b-e-h-D • Discarded route paths: S-c-d-g-D, S-c-e-h-D, S-c-f-g-D, S-c-f-h-D

  10. 3. Simulation Results

  11. 3. Simulation Results

  12. 3. Simulation Results

  13. 3. Simulation Results • There are three reasons for this result: (1) NDMR finds multiple node-disjoint route paths in a route discovery process, so the protocol decreases route discovery process. (2) NDMR reduces control packets. (3) NDMR has higher packet delivery ratio

  14. 4. Conclusions • NDMR has two novel aspects • reduces routing overhead • achieves multiple node-disjoint routing paths. • NDMR outperforms both AODV and DSR because multiple node-disjoint routing paths provide robustness to mobility

More Related