Dynamic Ad Hoc Networks

Dynamic Ad Hoc
Networks......Page 4
Contents......Page 6
List of figures......Page 18
List of tables......Page 24
Editors biography......Page 26
Authors biography......Page 28
Preface......Page 40
Acknowledgement......Page 46
List of acronyms......Page 48
Part I: Concepts and principles......Page 58
1.1 Introduction......Page 60
1.1.1 Dynamic ad hoc networks......Page 61
1.1.2 Challenges of key management......Page 62
1.2.1 Desirable features for DANETs......Page 63
1.2.2 Evaluation metrics of key management......Page 65
1.3.1 Contributory key management schemes......Page 68
1.3.2 Distributive key management schemes......Page 69
1.4 Further developments......Page 72
1.5 Conclusion......Page 73
References......Page 74
2.1 Introduction......Page 78
2.2 Types of wireless ad hoc networks......Page 79
2.3 Energy-efficient routing in ad hoc networks......Page 81
2.4.1 Reliable and energy-efficient routing (RelEE)......Page 82
2.4.2 Energy-Efficient On-Demand Routing Algorithm (EEAODR)......Page 84
2.4.4 Progressive Energy-Efficient Routing (PEER)......Page 85
2.4.9 Modifications at the source node......Page 87
2.4.13 Energy Aware Routing Algorithm (EARA)......Page 88
2.4.14 Energy Efficient Integrated Routing Protocol (E2IRP)......Page 90
2.4.15 Power-aware Routing Protocol (PAR)......Page 92
2.4.17 Location-based Power Conservation (LBPC) Scheme for
MANETs......Page 93
2.4.18 Cluster-based routing protocol (CBRP)......Page 94
2.5 Energy-efficient routing approaches in ad hoc mesh
networks......Page 95
2.5.2 Battery aware multiple input multiple output (MIMO) mesh
network power scheduling (BAMPS)......Page 97
2.5.3 Energy Efficient Routing (E2R)......Page 98
2.6.1 MANETs versus Cognitive Radio ad hoc Networks......Page 100
2.6.2 Spectrum and Energy Aware Routing (SER) protocol......Page 101
2.6.3 Delay and Energy-based Spectrum Aware Routing (DESAR)
protocol......Page 102
References......Page 103
3.1 Introduction......Page 106
3.2.1 In-vehicle domain......Page 109
3.2.3 Infrastructure domain......Page 110
3.2.4 Standards for wireless access in VANETs......Page 112
3.3.1 Adversary model......Page 113
3.3.2 Attacks on VANETs......Page 114
3.4 Security solutions......Page 120
3.5 Privacy in VANET......Page 124
3.6 Future security challenges......Page 127
Acknowledgements......Page 130
References......Page 131
4.1 Introduction: MANETs connected to the Internet......Page 136
4.2 Requirements for connecting a MANET to the Internet......Page 138
4.3 Internet-gateway discovery in a MANET......Page 139
4.4 Techniques to adjust the frequency of the gateway messages......Page 140
4.4.2 Algorithm based on the stability factor......Page 141
4.4.3 Fuzzy-logic-based adaptive algorithm......Page 142
4.5.2 Maximal benefit coverage......Page 143
4.5.3 Low overhead and scalable proxied......Page 144
4.5.6 Load-based gateway discovery......Page 145
4.5.8 Adaptive distributed discovery......Page 146
4.5.10 Gateway discovery based on stable links......Page 147
4.6.1 Generic algorithm......Page 148
4.6.2 Regulated mobility degree......Page 149
4.6.6 Fuzzy-logic-based hybrid gateway discovery......Page 150
4.8 Conclusion......Page 151
References......Page 152
5.1 Introduction......Page 156
5.2 Fundamental concepts......Page 157
5.2.1 Ad hoc network scenario......Page 158
5.2.2 Capacity definition......Page 159
5.3.1 Modelling of the received signals in ad hoc networks......Page 164
5.3.2 Model verification......Page 166
5.4.2 Optimum outage threshold......Page 168
5.5 Further developments......Page 169
References......Page 172
Part II: Networking methods and techniques......Page 176
6.1 Introduction......Page 178
6.2 Requirements for a routing protocol for VANET......Page 179
6.3 State-of-art in routing protocols for VANET......Page 180
6.3.1 Topology-based routing......Page 181
6.3.2 Geographic routing......Page 182
6.3.3 Routing architecture for VANET......Page 184
6.4 Performance evaluation of routing protocols for VANET......Page 188
6.4.1 Results......Page 189
6.5.2 Applications support......Page 192
6.6 Conclusion......Page 194
References......Page 195
7 Exploiting cooperative relays in MIMO ad hoc networks......Page 198
7.1 Introduction......Page 199
7.2 Background and motivation......Page 201
7.3 Problem formulation and a centralized solution......Page 203
7.3.1 Problem formulation......Page 204
7.3.2 A centralized algorithm......Page 206
7.4 Packet scheduling with relay transmission......Page 208
7.4.1 Determination of transmitter nodes and the number of
transmission streams......Page 209
7.4.2 Allocation to antennas......Page 212
7.5.1 Relay operations......Page 213
7.5.2 Protocol details......Page 215
7.5.3 An example......Page 217
7.6 Performance evaluation......Page 218
7.7 Further development......Page 222
7.8 Conclusion......Page 223
References......Page 224
8.1 Introduction......Page 228
8.2 Mobile ad hoc networks......Page 229
8.2.1 Applications......Page 230
8.2.2 Open challenges......Page 231
8.3.1 Distance vector......Page 232
8.4.1 Characteristics of an ideal ad hoc routing protocol......Page 233
8.4.2 Taxonomy of ad hoc routing protocols......Page 234
8.4.3 On-demand single-path routing schemes......Page 236
8.5 Multipath routing......Page 239
8.5.2 Components of multipath routing......Page 240
8.5.3 On-demand multipath routing schemes......Page 242
8.5.4 Comparison and open issues......Page 244
8.6 Further trends......Page 246
References......Page 247
9.1 Introduction......Page 252
9.1.3 Ant colony optimization for multipath routing......Page 253
9.2.1 On-demand multipath routing protocols......Page 254
9.2.3 QoS enabled multipath routing protocols......Page 255
9.3.2 QoS model......Page 256
9.4.1 Packet structures of ants......Page 260
9.4.2 QAMR – the algorithm......Page 262
9.4.3 Performance analysis......Page 264
9.6 Conclusion......Page 267
References......Page 268
10.1 Introduction......Page 272
10.2 Multipath routing protocols in MANETs......Page 273
10.3.2 Particle swarm optimisation algorithm......Page 275
10.4.1 Model and assumptions......Page 276
10.4.3 Disjoint path set types......Page 277
10.4.4 HNN-based multipath routing......Page 278
10.4.5 Path set selection by PSO-optimised HNN......Page 280
10.5.3 Selecting network parameters by PSO algorithm......Page 281
10.6 Simulation results......Page 282
10.7 Conclusion......Page 283
References......Page 286
11.1.1 Mobile ad hoc networks......Page 290
11.1.2 Dominating set (DS) graph......Page 291
11.1.3 Routing in wireless ad hoc networks......Page 292
11.1.4 Clustering and topology control in MANETs......Page 293
11.2.1 Design objectives......Page 294
11.2.2 Design parameters......Page 295
11.2.3 SCAM algorithm......Page 297
11.2.4 Performance evaluation......Page 299
11.3 Distributed scenario-based clustering for MANET......Page 302
11.3.2 Design principles......Page 303
11.3.3 Performance evaluation......Page 309
11.4 Conclusion......Page 312
References......Page 313
Part III: Ad hoc network management......Page 316
12.1 Introduction......Page 318
12.2 Scope and objective......Page 319
12.3.1 Introduction to MANET......Page 320
12.3.2 Routing protocols......Page 321
12.3.3 Security issues in MANET......Page 322
12.3.4 Related work......Page 324
12.4 Reliable-AODV: mechanism to thwart Blackhole
and Grayhole attacks......Page 325
12.4.1 The proposed approach......Page 326
12.4.2 Algorithm analysis......Page 328
12.5.2 Experimental setup......Page 329
12.6.2 Effect of traffic load......Page 331
12.7 Further developments......Page 332
Acknowledgements......Page 334
References......Page 335
13.1 Introduction......Page 338
13.2 Channel reservation: Advantages and drawbacks......Page 340
13.3.1 Single channel CRF......Page 341
13.4 Performance evaluation......Page 343
13.5.1 M-DQDC overview......Page 346
13.5.2 Distributed queue......Page 347
13.5.3 Negotiation......Page 349
13.6 Evaluation results......Page 351
13.7 Further development......Page 352
13.8 Conclusion......Page 354
References......Page 355
14.1 Introduction......Page 358
14.2 Related work......Page 360
14.3 Energy consumption model......Page 362
14.3.1 Relay node location......Page 363
14.3.2 Optimal transmission range......Page 365
14.4 Energy efficient local forwarding schemes......Page 366
14.5 Simulation results......Page 369
14.5.1 Comparison of network lifetime and received packets in
different GR algorithms......Page 370
14.5.3 Comparison of nodes’ energy status in different GR
algorithms......Page 371
14.5.4 Comparison of other parameters in different GR algorithms......Page 373
14.7 Conclusion......Page 375
References......Page 376
15 Dynamic spectrum sharing between cooperative relay and
ad hoc networks: towards real-time optimal control......Page 380
15.1 Introduction......Page 381
15.2.1 Cooperative relay network model......Page 383
15.2.2 Ad hoc traffic prediction and interference metric......Page 385
15.3 Frame-level spectrum sharing: optimal design......Page 386
15.3.1 Convex reformulation of Problem (P)......Page 387
15.3.2 Lagrangian dual optimisation solution for problem (15.14)......Page 388
15.4 Ergodic spectrum sharing: practical online design......Page 391
15.4.1 Problem formulation......Page 392
15.4.2 Online spectrum access strategy......Page 394
15.4.3 Queueing process at the relay node......Page 396
15.5 Simulation results......Page 397
References......Page 399
Part IV: Applications and uses of ad hoc networking......Page 402
16.1 Introduction......Page 404
16.2.1 Unstructured network......Page 405
16.2.4 Limited transmission range......Page 406
16.3.2 Rescue operations......Page 407
16.4.1 QoS metrics......Page 409
16.4.3 QoS in physical layer......Page 411
16.4.4 QoS in data link and network layers......Page 412
16.5.1 Application invocation model......Page 414
16.5.3 Resource model and system model......Page 415
16.5.5 Recursive model......Page 416
16.7 Scheduling for multimedia for streaming......Page 417
16.7.2 Dynamic group-server scheduling......Page 418
16.7.3 Waited fair queue scheduling......Page 419
16.8.2 Support for delay-constrained applications......Page 420
16.8.3 Support for bandwidth-constrained applications......Page 421
16.9.2 Mobile agent......Page 422
16.10 Conclusion......Page 424
References......Page 425
17.1 Introduction......Page 428
17.2 Components of traffic system and their characteristics......Page 430
17.2.2 Vehicles......Page 431
17.2.4 Traffic signs and controllers......Page 432
17.3 Mobility models......Page 433
17.4 ITS and controlling traffic......Page 435
17.4.1 Macroscopic controllers......Page 436
17.4.2 Microscopic controllers......Page 437
17.5.1 VANET infrastructure deployment......Page 439
17.5.2 VANET, P2P and traffic information systems......Page 441
17.6 Conclusion......Page 442
References......Page 443
18.1 Introduction......Page 448
18.2 Secure routing......Page 450
18.3 Reputation system for trust-aware routing......Page 452
18.4.1 EMPIRE approach......Page 454
18.4.2 EMPIRE validation......Page 456
18.5 Performance evaluation of reputation system
adopting EMPIRE......Page 459
18.6 Further developments......Page 463
18.7 Conclusion......Page 467
References......Page 468
19.1 Introduction......Page 470
19.2 Related work......Page 471
19.3 Scheduling scheme for WSNs based on social
insect colonies......Page 472
19.3.2 Mechanisms......Page 473
19.4.1 Co-operative diversity......Page 475
19.4.2 Mechanisms......Page 477
19.5.1 Simulation settings......Page 479
19.5.2 Simulation results......Page 480
19.6 Discussion......Page 483
19.8 Conclusion......Page 484
Appendix A......Page 485
References......Page 487
Index......Page 490