제주대학교 Repository

An Efficient On-Demand Multipath Routing in Wireless Ad Hoc Network

Metadata Downloads
Abstract
An ad hoc network consists of a collection of wireless nodes that are capable to communicate with each other without any fixed based-station infrastructure and centralized management. All nodes can be mobile and the topology changes frequently. Each mobile node can operate as a host and as a router, indicating that all of them take equal roles.
In ad hoc networks, the responsibility of routing protocol includes exchanging the route information; finding a feasible path to a destination based on criteria such as hop length, minimum power required, and lifetime of the wireless link; gathering information about the path breaks; repairing the broken paths expending minimum processing power and bandwidth. Minimal control overhead, minimal processing overhead, quick route reconfiguration, and loop prevention are the major requirements of a routing protocol in ad hoc wireless networks.
This thesis proposes an on-demand Directional Node-Disjoint Multipath Routing (DNDMR) protocol for the wireless ad hoc network. Multipath routing inherently allows the establishment of multipath or multiple routes between a single source and single destination. The important components of the protocol, such as path accumulation with a novel directional method, reducing routing overhead by controlled propagation, and ensuring the node-disjoint paths automatically, are explained. DNDMR improves the reliability of data communication (i.e., fault tolerance) over the wireless ad hoc network. Because DNDMR significantly reduces the total number of Route Request (RREQ) Packets, this results in lower control traffic overhead, smaller end-to-end delays, and better throughput. We evaluate the performance of the proposed scheme with ns-2 simulator and compare its performance with existing unipath routing protocols (DSDV, DSR, and AODV), and multipath routing protocol (AOMDV). Control traffic overhead, end-to-end delay, and throughput metrics are considered for the evaluation. In case of control traffic overhead, the cumulative packets for all mentioned protocols at the end of simulation time are: DSDV (6000 packets), DSR (5000 packets), AODV (2600 packets), AOMDV (2700), and DNDMR (2300 packets), whereas DNDMR is comparatively less than the other protocols. In case of end-to-end delay, DNDMR is faster than DSDV (3.25 times), DSR (3 times), AODV (3.5 times), and AOMDV (2 times). Also, analysis shows that DNDMR throughput is better than the other mentioned protocols. The experimental results reveal that DNDMR has better performance and more reliable than the contemporary unipath and multipath routing protocols.
Author(s)
Abhijit Saha
Issued Date
2008
Awarded Date
2008. 2
Type
Dissertation
URI
http://dcoll.jejunu.ac.kr/jsp/common/DcLoOrgPer.jsp?sItemId=000000004323
Affiliation
제주대학교 대학원
Department
대학원 전산통계학과
Advisor
박경인
Table Of Contents
1 Introduction = 1
1.1 Motivation = 1
1.2 Contributions = 2
1.3 Thesis Organization = 2
2 Wireless Ad Hoc Networks = 4
2.1 Background = 4
2.1.1 Cellular and Wireless Ad Hoc Networks = 4
2.1.2 Applications of Wireless Ad Hoc Networks = 8
2.1.3 Issues in Wireless Ad Hoc Networks = 11
3 Routing in Wireless Ad Hoc Networks = 13
3.1 Related Works = 13
3.1.1 Routing Protocols Classification = 13
3.1.1.1 Proactive versus Reactive Approaches = 14
3.1.2 Review of Proactive Routing Protocols = 15
3.1.2.1 Dynamic Destination-Sequenced Distance-Vector Routing = 15
3.1.2.2 Wireless Routing Protocol = 17
3.1.3 Review of Reactive Routing Protocols = 18
3.1.3.1 Dynamic Source Routing = 19
3.1.3.2 Ad Hoc On-Demand Distance Vector Routing = 21
3.1.4 Multipath Routing = 25
3.1.5 Multipath Routing Protocols = 26
3.1.5.1 Split Multipath Routing = 6
3.1.5.2 Multipath Source Routing = 27
3.1.5.3 Ad hoc On-Demand Multipath Distance Vector = 28
3.1.5.4 Ad hoc On-Demand Distance Vector Multipath = 29
3.1.6 Problem with Current Multipath Routing Protocols = 31
4 Directional Node-Disjoint Multipath Routing = 33
4.1 Introduction = 33
4.2 Directional Node-Disjoint Multipath Routing = 35
4.2.1 Route Discovery = 35
4.2.2 Route Request Propagation = 35
4.2.3 Node-Disjoint Path Selection = 39
4.2.4 Route Maintenance = 39
4.2.5 Pseudo Code = 40
4.3 Performance Evaluation = 41
5 Conclusions = 49
5.1 Conclusions = 49
5.2 Future Work = 49
References = 52
Degree
Master
Publisher
제주대학교 대학원
Citation
Abhijit Saha. (2008). An Efficient On-Demand Multipath Routing in Wireless Ad Hoc Network
Appears in Collections:
General Graduate School > Computer Science and Statistics
Authorize & License
  • AuthorizeOpen
Files in This Item:

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.