LIST OF FIGURES Figure No. Caption Page No. Figure 1.1 A Cellular Network.. 2 Figure 1.2 A Mobile Ad hoc Network... 2 Figure 1.3 Classifications of Threats. 10 Figure 1.4 Classification of Different QoS Metrics... 11 Figure 1.5 Classifications of QoS Approaches.. 12 Figure 1.6 NS2 Simulation Flow/Run... 14 Figure 1.7 Main Window of NAM 15 Figure 1.8 Pictorial Representation of the Work Carried out in this Thesis.. 17 Figure 2.1 Classification of Routing Protocols.. 21 Figure 2.2 Route Establishment in AODV 23 Figure 2.3 Route Maintenance in AODV.. 24 Figure 2.4 Route Establishment in DSR 26 Figure 2.5 Route Maintenance in DSR.. 27 Figure 2.6 Direct Acyclic Graph in TORA... 28 Figure 2.7 Route Maintenance in TORA.. 29 Figure 2.8 Topology Graph of the Network.. 30 Figure 2.9 Topology Graph of the Network When Node 7 Moves... 31 Figure 2.10 Selection of MPRset in OLSR. 34 Figure 3.1 Trust Computing Classifications. 44 Figure 3.2 Neighbour Sensing Based Direct Trust Establishment 44 Figure 3.3 Recommendation Based Indirect Trust Establishment 45 Figure 3.4 Hybrid Method of Trust Establishment 45 Figure 3.5 TA Based Centralized Trust Computation 47 Figure 3.6 Cryptography Based Hard Security... 48 Figure 3.7 Trust Based Soft Security. 48 Figure 3.8 SRP Header for Route Request Packet 60 Figure 3.9 SAODV Protocol Header. 62 iv
Figure 3.10 Route Maintenance in the SAODV Protocol... 63 Figure 4.1 Initial Positioning of 25 Nodes. 68 Figure 4.2 Scenario of Packet Transferring (When Number of Nodes are 100) 68 Figure 4.3 Scenario of Packets Drop (When Number of Nodes are 75)... 68 Figure 4.4 Packets Received when Number of nodes=25, Packet size =500 69 Figure 4.5 Packets Received when Number of nodes=50, Packet size =500 69 Figure 4.6 Packets Received when Number of nodes=75, Packet size =500 69 Figure 4.7 Packets Received when Number of nodes=100, Packet size =500 69 Figure 4.8 Packets Received when Number of nodes=25, Packet size =500 70 Figure 4.9 Packets Received when Number of nodes=50, Packet size =500 70 Figure 4.10 Packets Received when Number of nodes=75, Packet size =500 70 Figure 4.11 Packets Received when Number of nodes=100, Packet size =500 70 Figure 4.12 Packets Received when Number of nodes=25, Packet size =1000 71 Figure 4.13 Packets Received when Number of nodes=50, Packet size =1000 71 Figure 4.14 Packets Received when Number of nodes=75, Packet size =1000 71 Figure 4.15 Packets Received when Number of nodes=100, Packet size =1000 71 Figure 4.16 Packets Received when Number of nodes=25, Packet size =1000 v
Figure 4.17 Packets Received when Number of nodes=50, Packet size =1000 Figure 4.18 Packets Received when Number of nodes=75, Packet size =1000 Figure 4.19 Packets Received when Number of nodes=100, Packet size =1000 Figure 4.20 Packets Received when Number of nodes=25, Packet size =500 Figure 4.21 Packets Received when Number of nodes=50, Packet size =500 Figure 4.22 Packets Received when Number of nodes=75, Packet size =500 Figure 4.23 Packets Received when Number of nodes=100, Packet size =500 Figure 4.24 Packets Received when Number of nodes=25, Packet size =500 Figure 4.25 Packets Received when Number of nodes=50, Packet size =500 Figure 4.26 Packets Received when Number of nodes=75, Packet size =500 Figure 4.27 Packets Received when Number of nodes=100, Packet size =500 Figure 4.28 Packets Received when Number of nodes=25, Packet size =1000 Figure 4.29 Packets Received when Number of nodes=50, Packet size =1000 Figure 4.30 Packets Received when Number of nodes=75, Packet size =1000 Figure 4.31 Packets Received when Number of nodes=100, Packet size =1000 74 74 74 74 75 75 75 75 vi
Figure 4.32 Packets Received when Number of nodes=25, Packet size =1000 Figure 4.33 Packets Received when Number of nodes=50, Packet size =1000 Figure 4.34 Packets Received when Number of nodes=75, Packet size =1000 Figure 4.35 Packets Received when Number of nodes=100, Packet size =1000 Figure 4.36 Impact of Varying the Number of Nodes, Mobility Rate on the Throughput (When Packet size=100 bytes, Packet Interval=0.15 sec) Figure 4.37 Impact of Varying the Number of Nodes, Mobility Rate on the Throughput (When Packet size=500 bytes, Packet Interval=0.15 sec) Figure 4.38 Impact of Varying the Number of Nodes, Mobility Rate on the Throughput (When Packet size=100 bytes, Packet Interval=0.015 sec) Figure 4.39 Impact of Varying the Number of Nodes, Mobility Rate on the Throughput (When Packet size=500 bytes, Packet Interval=0.015 sec) Figure 4.40 Impact of Varying the Number of Nodes, Mobility Rate on the Routing Load (When Packet size=100 bytes, Packet Interval=0.15 sec) Figure 4.41 Impact of Varying the Number of Nodes, Mobility Rate on the Routing Load (When Packet size=500 bytes, Packet Interval=0.15 sec) Figure 4.42 Impact of Varying the Number of Nodes, Mobility Rate on the Routing Load (When Packet size=100 bytes, Packet Interval=0.015 sec) Figure 4.43 Impact of Varying the Number of Nodes, Mobility Rate on the Routing Load (When Packet size=100 bytes, Packet 76 76 76 76 77 78 78 78 79 79 80 80 vii
Interval=0.015 sec) Figure 4.44 Impact of Varying the Number of Nodes, Mobility Rate on the 81 Packet Delivery Ratio (When Packet size=100 bytes, Packet Interval=0.15 sec).. Figure 4.45 Impact of Varying the Number of Nodes, Mobility Rate on the 81 Average End-To-End Delay (When Packet size=500 bytes, Packet Interval=0.15 sec).. Figure 4.46 Impact of Varying the Number of Nodes, Mobility Rate on the 81 Packet Delivery Ratio (When Packet size=100 bytes, Packet Interval=0.015 sec)... Figure 4.47 Impact of Varying the Number of Nodes, Mobility Rate on the 82 Packet Delivery Ratio (When Packet size=500 bytes, Packet Interval=0.015 sec) Figure 4.48 Impact of Varying the Number of Nodes, Mobility Rate on the 82 Average End-To-End Delay (When Packet size=100 bytes, Packet Interval=0.15 sec).. Figure 4.49 Impact of Varying the Number of Nodes, Mobility Rate on the 83 Average End-To-End Delay (When Packet size=500 bytes, Packet Interval=0.15 sec).. Figure 4.50 Impact of Varying the Number of Nodes, Mobility Rate on the 83 Average End-To-End Delay (When Packet size=100 bytes, Packet Interval=0.015 sec) Figure 4.51 Impact of Varying the Number of Nodes, Mobility Rate on the 83 Average End-To-End Delay (When Packet size=500 bytes, Packet Interval=0.015 sec) Figure 5.1 Generic Search Algorithm. 89 Figure 5.2 Associate Memory Organization... 89 Figure 5.3 Working of Generic Search Algorithm. 90 Figure 5.4 Organization of Present and Modified Table 92 Figure 5.5 Coherence Check of Mobile Node C for Read Operation of Block i... 93 viii
Figure 5.6 Coherence Check of Mobile Node C for Write Operation of 94 Block i... Figure 6.1 Hybrid MANET 97 Figure 6.2(a-d) Parameters Setting for Routing Protocols. 99 Figure 6.3(a-e) Configured Routing Protocols, Proxy Server, SIP Client, Voice 100 Encoding and Voice Table Configuration on each Node Figure 6.4 Hybrid MANET for the Voice Communication (Network 100 Topology Used)..... Figure 6.5 Calling and Called Nodes in MANET.. 101 Figure 6.6 SIP Active Calls 101 Figure 6.7 SIP Enabled Client Requests for Voice Communication to the SIP 102 Proxy Server.. Figure 6.8 Voice Traffic Sent. 102 Figure 6.9 Voice Traffic Received..... 103 Figure 6.10 Voice Packet End-to-End Delay... 103 Figure 6.11 Voice Jitter 104 Figure 6.12 Voice Packet Delay Variation... 104 Figure 7.1 Propagation of Trust.. 107 Figure 7.2 Trusted and Untrusted Routing. 109 Figure 7.3 Trust Conscious Secure Route Discovery between Mobile Node A 111 and B... Figure 7.4 Mobile Node B Acting as a Proxy Node.. 111 Figure 7.5 Trust Conscious Secure Route Discovery between Mobile Node C 112 and A via Proxy Node B... Figure 8.1 QoS Routing in Ad hoc Network.. 115 Figure 8.2 Hash-based Message Authentication Code Concept. 119 Figure 8.3 Ad hoc Network Topology 121 Figure 8.4 Bandwidth Reservation by Hop-by-Hop Approach.. 123 Figure 8.5 (a) Time Slot (T) and Least Cost First (T LCF ) Reservation tree of path (S, A, B, D) 124 ix
Figure 8.5 (b) Time Slot (T) and Least Cost First (T LCF ) Reservation tree of path 124 (S, E, F, D) Figure 8.5 (c) Time Slot (T) and Least Cost First (T LCF ) Reservation tree of path 125 (S, A, C, B, D)... Figure 8.5 (d) Time Slot (T) and Least Cost First (T LCF ) Reservation tree of path 125 (S, A, C, F, D)... Figure 8.5 (e) Time Slot (T) and Least Cost First (T LCF ) Reservation tree of path 125 (S, E, C, B, D)... Figure 8.5 (f) Time Slot (T) and Least Cost First (T LCF ) Reservation tree of path 126 (S, E, C, F, D) Figure 8.6 End to End Bandwidth by Hop-by-Hop and Least Cost First 126 Reservation Approach of path (S, A, B, D).. Figure 8.7 Unipath Discovered by Multipath Discovery Algorithm.. 127 Figure 8.8 Multipath Route Maintenance... 128 x
LIST OF TABLES Table No. Caption Page No. Table 1.1 Comparison Between Cellular Networks and Ad hoc Wireless 3 Networks Table 1.2 QoS Parameters for various Applications.. 10 Table 2.1 Comparison of the Features of DSR, AODV and TORA.. 29 Table 2.2 Routing Table for Node 1... 31 Table 2.3 Modified Routing Table for Node 1... 32 Table 3.1 Comparison of Different Distributed Trust Computing Schemes. 45 Table 3.2 Comparison of Different Centralized Trust Computing Schemes. 47 Table 3.3 Operational Requirements of Secure Ad hoc Routing Protocols.. 56 Table 3.4 Security Protocols Parameters... 56 Table 3.5 Comparison of Security Protocols With Their Defense Against Attack 64 Table 4.1 Simulation Parameters... 67 Table 4.2 List of Various Simulation Scenarios 67 Table 4.3 Performance Metrics with Number of nodes=25, Packet size=500 69 Table 4.4 Performance Metrics with Number of nodes=50, Packet size=500 69 Table 4.5 Performance Metrics with Number of nodes=75, Packet size=500 69 Table 4.6 Performance Metrics with Number of nodes=100, Packet size=500 69 Table 4.7 Performance Metrics with Number of nodes=25, Packet size=500 70. Table 4.8 Performance Metrics with Number of nodes=50, Packet size=500 70. Table 4.9 Performance Metrics with Number of nodes=75, Packet size=500. 70 xi
Table 4.10 Table 4.11 Table 4.12 Table 4.13 Table 4.14 Table 4.15 Table 4.16 Table 4.17 Table 4.18 Table 4.19 Table 4.20 Table 4.21 Table 4.22 Table 4.23 Table 4.24 Performance Metrics with Number of nodes=100, Packet size=500. Performance Metrics with Number of nodes=25, Packet size=1000 Performance Metrics with Number of nodes=50, Packet size=1000 Performance Metrics with Number of nodes=75, Packet size=1000 Performance Metrics with Number of nodes=100, Packet size=1000 Performance Metrics with Number of nodes=25, Packet size=1000. Performance Metrics with Number of nodes=50, Packet size=1000. Performance Metrics with Number of nodes=75, Packet size=1000. Performance Metrics with Number of nodes=100, Packet size=1000. Performance Metrics with Number of nodes=25, Packet size=500 Performance Metrics with Number of nodes=50, Packet size=500 Performance Metrics with Number of nodes=75, Packet size=500 Performance Metrics with Number of nodes=100, Packet size=500 Performance Metrics with Number of nodes=25, Packet size=500 Performance Metrics with Number of nodes=50, Packet size=500 70 71 71 71 71 74 74 xii
Table 4.25 Performance Metrics with Number of nodes=75, Packet size=500 74 Table 4.26 Performance Metrics with Number of nodes=100, Packet size=500 74 Table 4.27 Performance Metrics with Number of nodes=25, Packet size=1000 75 Table 4.28 Performance Metrics with Number of nodes=50, Packet size=1000 75 Table 4.29 Performance Metrics with Number of nodes=75, Packet size=1000 75 Table 4.30 Performance Metrics with Number of nodes=100, Packet size=1000 75 Table 4.31 Performance Metrics with Number of nodes=25, Packet size=1000 76 Table 4.32 Performance Metrics with Number of nodes=50, Packet size=1000 76 Table 4.33 Performance Metrics with Number of nodes=75, Packet size=1000 76 Table 4.34 Performance Metrics with Number of nodes=100, Packet size=1000 76 Table 6.1 Simulation Parameters.. 99 Table 6.2 List of Scenarios 99 Table 6.3 Voice Communication Setup. 101 Table 6.4 Comparisons of Call Setup Time, Active Calls, Voice Traffic Sent 102 and Voice Traffic Received... Table 6.5 Performance Analysis of Different Routing Protocols.. 105 Table 8.1 Available Paths from node B to G... 115 Table 8.2 Available Paths from node B to G. 117 Table 8.3 Performance Comparison of QoS-aware Routing Protocol.. 118 Table 8.4 Attacks on DSR and AODV Protocols.. 118 Table 8.5 Secure Routing Solutions For DSR And AODV... 119 xiii
TABLE OF CONTENTS Page No. Candidate Declaration Acknowledgement List of Publications List of Figures List of Tables List of Abbreviations Abstract Table of Contents i ii iii iv xi xiv xvi xviii Chapter 1: Introduction 1-18 1.1 Cellular Networks Vs Mobile Ad Hoc Networks 1 1.1.1 Mobile Ad Hoc Networks 2 1.2 MANETs Features that Impact Security and QoS 3 1.3 Applications of Ad Hoc Wireless Networks 5 1.4 Issues in Ad Hoc Wireless Network 6 1.5 Security in Mobile Ad Hoc Networks 8 1.5.1 Security Goals 8 1.5.2 Security Attacks on Ad Hoc Routing Protocols 9 1.6 Definition of QoS 10 1.6.1 QoS in Different Layers 11 1.6.2 Classification of QoS Metrics 11 1.6.3 Classifications of QoS Approaches 12 1.7 Simulation tools 13 1.7.1 Introduction to NS2 13 1.7.2 OPNET-Network Simulator 15 xviii
1.8 Research Objective 16 1.9 Thesis Organization 18 Chapter 2: Mobile Ad Hoc Routing Protocols 19-35 2.1 The Goals of a Routing Protocol in Ad Hoc Wireless 19 2.2 Classification of Routing Protocols 20 2.2.1 Based on the Routing Information Update Mechanism 20 2.2.2 Based on the Use of Temporal Information for Routing 21 2.2.3 Based on the Routing Topology 21 2.2.4 Based on the Utilization of Specific Resources 22 2.3 On-Demand / Reactive Routing Protocols 22 2.3.1 Ad hoc On-demand Distance Vector 22 2.3.2 Dynamic Source Routing 25 2.3.3 Temporally Ordered Routing Algorithm 27 2.4 Proactive or Table-Driven Routing Protocols 30 2.4.1 Destination Sequenced Distance Vector Routing Protocol 30 2.4.2 Optimized Link State Routing 32 Chapter 3: Literature Survey 36-64 3.1 Overview of Scalability 36 3.2 Role of Caching in Route Optimization 37 3.2.1 Associative Search and Issue of Cache Coherence 38 3.2.2 Issue of Cache Coherence 39 3.3 Overview of Session Initiation Protocol for Voice Support 41 3.3.1 Session Initiation Protocol 41 3.4 Overview of Trust Computations 43 3.4.1 Distributed Trust Computations 44 3.4.2 Centralized Trust Establishment 47 3.5 Trust Based Network Security 48 3.5.1 Cryptography Based Hard Security Services 48 3.5.2 Trust Based Soft Security Services 49 3.6 Design Considerations for QoS-Aware Routing 50 3.7 Security Mechanisms 53 xix
3.7.1 Message Encryption 54 3.7.2 Digital Signature and Hashing 54 3.7.3 Key Management 55 3.8 Secure Routing Protocols 55 3.8.1 Authenticated Routing for Ad hoc Networks (ARAN) 56 3.8.2 ARIADNE 58 3.8.3 Secure and Efficient Ad hoc Distance Vector (SEAD) Routing 59 Protocol 3.8.4 Secure Routing Protocol (SRP) 60 3.8.5 Secure Ad hoc On-demand Distance Vector Routing (SAODV) 61 3.8.6 Security-aware Ad hoc Routing (SAR) 63 Chapter 4: Impact of Scalability on QoS-Aware Routing 65-84 4.1 Introduction 65 4.2 QoS based Performance Metrics 66 4.3 Performance Evaluation 67 4.4 Results and Discussion 77 4.4.1 Throughput 77 4.4.2 Routing Load 79 4.4.3 Packet Delivery Ratio 80 4.4.4 Average End-To-End Delay 82 4.5 Conclusion 84 Chapter 5: Cache Coherence Handling Scheme for DSR Routing 85-95 5.1 Introduction 85 5.2 Proposed Cache Search Algorithm 87 5.2.1 Generic Search Algorithm 88 5.2.2 Working of Generic Search Algorithm 89 5.3 Cache Coherence Handling Scheme 91 5.3.1 Existing Dynamic Coherence Check Scheme 91 5.3.2 Proposed Optimized Dynamic Cache Coherence Handling Scheme 92 5.4 Conclusion 95 xx
Chapter 6: Voice Communication Over Hybrid MANETs 96-105 6.1 Introduction 96 6.2 Performance Analysis 98 6.2.1 Performance Metrics 98 6.3 Simulation Results and Discussion 99 6.4 Conclusion 105 Chapter 7: A Trust Conscious Secure Route Data Communication in 106-113 MANETs 7.1 Introduction 106 7.2 AODV with Embedded Soft Security 108 7.3 Proposed Trust Conscious Secure Route Mechanism 109 7.3.1 Joining a New Node in Ad hoc Network and Trust Relationship is 110 Nil 7.3.2 A Trusted Intermediate Node Act as a Proxy Node to Dynamically 111 Increase the Trust 7.4 Conclusion 113 Chapter 8: Secure QoS Enabled On-Demand Link-State Multipath Routing 114-129 8.1 Introduction 114 8.2 Routing Security Issue and Their Existing Solution 118 8.3 Proposed Multipath Routing Protocol 119 8.3.1 Secure Broadcasting QRREQ Packets 120 8.3.2 Unipath Discovery Operations Perform By Destination Node 122 8.3.3 Multipath Discovery Operation Perform By Destination 126 8.3.4 Secure Unicasting of QRREP Packets to Source Node 127 8.3.5 Multipath Route Maintenance 128 8.4 Conclusion 129 Chapter 9: Conclusion and Further Scope of Research 130-134 9.1 Conclusion 130 9.2 Further Scope of Research 132 References 135-149 xxi