The performance of routing protocols in wireless ad-hoc networks is determined by a number of factors, among which the path durations are of much importance. Path durations affect the reliability of the network service provided to the applications and the routing overhead incurred…

1 Introduction
1.1 Challenges for routing in MANETs
1.2 Path selection in MANETs
1.3 Distribution of path duration
1.4 Summary of results
1.4.1 Distributional convergence of path duration
1.4.2 A new path selection scheme – MED
1.5 Outline of the dissertation
2 Review of routing protocols for MANETs
2.1 Table-driven routing protocol
2.1.1 Destination Sequenced Distance Vector protocol
2.1.2 Wireless Routing Protocol
2.1.3 Cluster-head Switch Gateway Routing
2.2 On-demand routing protocol
2.2.1 Dynamic Source Routing
2.2.2 Ad-hoc On-demand Distance Vector routing
2.2.3 Temporally Ordered Routing Algorithm
2.2.4 Associativity-Based Routing
2.3 Hybrid routing protocol
2.4 Review of existing path selection criteria
3 Model and assumptions
3.1 A basic framework
3.1.1 Reachability processes
3.1.2 Path duration
3.2 The set-up and modelling assumptions
3.2.1 Scaling
3.2.2 Stationarity
3.2.3 Deterministic sequence of path hop count
4 Distributional convergence of path duration – Independent case
4.1 Independence assumption
4.2 Distributional convergence of path duration
4.3 Comments on the independence assumption
4.3.1 Correlation coefficient between link durations
5 Distributional convergence of path duration – Dependent case
5.1 Finite dependence with homogeneous link durations
5.2 General dependence with heterogeneous link duration
5.2.1 Mixing conditions
5.2.2 Distributional convergence
5.2.3 Simulation results
6 New path selection scheme – MED
6.1 Outline of MED
6.1.1 Estimation of expected link durations
6.1.2 Estimation of expected path duration
6.2 Efficient local recovery scheme
6.2.1 Updating the threshold °
6.3 Implementation of the MED scheme in the AODV protocol
6.3.1 Routing table structure
6.3.2 Handling path request messages
6.3.3 Handling path reply messages
6.3.4 Handling path failures
6.3.5 Loop avoidance
7 Simulation results
7.1 Validation of assumptions
7.1.1 Validation of condition (5.2)
7.1.2 Validation of condition D0(un)
7.2 Performance evaluation of MED
7.2.1 Improvement in primary path durations
7.2.2 Quantitative comparison
7.3 Impact of parameters K and Kr on path selection
8 Conclusions
8.1 Analytical results
8.2 Simulation results
8.3 Future work direction and comments
A Mobility models used for research in MANETs
A.1 Random Walk mobility model
A.2 Random Waypoint mobility model
A.3 Reference Point Group mobility model
A.4 Manhattan Model and Freeway Model
B Proofs
B.1 Proof of Theorem 5.1
B.2 Proof of Theorem 5.2
B.3 Proofs of Lemma B.1
B.4 Proof of Lemma 5.1
B.5 Proof of threshold updating

Author: Han, Yijie

Source: University of Maryland

Download URL 2: Visit Now

Leave a Comment