Cover image for Evolutionary algorithms for mobile ad hoc networks
Title:
Evolutionary algorithms for mobile ad hoc networks
Series:
Nature-inspired computing series
Physical Description:
xiv, 222 pages : illustrations ; 25 cm.
ISBN:
9781118341131
Abstract:
"This comprehensive guide describes how evolutionary algorithms (EA) may be used to identify, model, and optimize day-to-day problems that arise for researchers in optimization and mobile networking. It provides efficient and accurate information on dissemination algorithms, topology management, and mobility models to address challenges in the field. It is an ideal book for researchers and students in the field of mobile networks"-- Provided by publisher.

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010341667 TK6570.M6 D65 2014 Open Access Book Book
Searching...

On Order

Summary

Summary

Describes how evolutionary algorithms (EAs) can be used to identify, model, and minimize day-to-day problems that arise for researchers in optimization and mobile networking

Mobile ad hoc networks (MANETs), vehicular networks (VANETs), sensor networks (SNs), and hybrid networks--each of these require a designer's keen sense and knowledge of evolutionary algorithms in order to help with the common issues that plague professionals involved in optimization and mobile networking.

This book introduces readers to both mobile ad hoc networks and evolutionary algorithms, presenting basic concepts as well as detailed descriptions of each. It demonstrates how metaheuristics and evolutionary algorithms (EAs) can be used to help provide low-cost operations in the optimization process--allowing designers to put some "intelligence" or sophistication into the design. It also offers efficient and accurate information on dissemination algorithms, topology management, and mobility models to address challenges in the field.

Evolutionary Algorithms for Mobile Ad Hoc Networks :

Instructs on how to identify, model, and optimize solutions to problems that arise in daily research Presents complete and up-to-date surveys on topics like network and mobility simulators Provides sample problems along with solutions/descriptions used to solve each, with performance comparisons Covers current, relevant issues in mobile networks, like energy use, broadcasting performance, device mobility, and more

Evolutionary Algorithms for Mobile Ad Hoc Networks is an ideal book for researchers and students involved in mobile networks, optimization, advanced search techniques, and multi-objective optimization.


Author Notes

Bernab Dorronsoro, PhD, earned his PhD in computer science from the University of Mlaga (Spain) in 2007. His main research interests include metaheuristics and mobile networks, among others.
Patricia Ruiz, PhD, earned her PhD in computer science at the University of Luxembourg and her degree in telecommunication engineering from the University of Mlaga (Spain).
Grgoire Danoy, PhD, earned his PhD from University of St Etienne (Ecole des Mines) or the optimization of real-world problems using co-evolutionary genetic algorithms, including topology management problems in mobile ad hoc networks.
Yoann Pign, PhD, obtained his PhD from the University of Le Havre, France, on Modelling and Processing Dynamic Graphs, Applications to Mobile Ad Hoc Networks.
Pascal Bouvry, PhD, earned his PhD in computer science from the University of Grenoble (INPG), France, in 1994.


Table of Contents

Prefacep. xiii
Part I Basic Concepts and Literature Reviewp. 1
1 Introduction to Mobile Ad Hoc Networksp. 3
1.1 Mobile Ad Hoc Networksp. 6
1.2 Vehicular Ad Hoc Networksp. 9
1.2.1 Widen Access in Vehicular Environment (WAVE)p. 11
1.2.2 Communication Access for Laud Mobiles (CALM)p. 12
1.2.3 C2C Networkp. 13
1.3 Sensor Networksp. 14
1.3.1 LBEEI451p. 17
1.3.2 IEEE 802.15.4p. 17
1.3.3 ZigBeep. 18
1.3.4 6LoWPANp. 19
1.3.5 Bluetoothp. 19
1.3.6 Wireless Industrial Automation Systemp. 20
1.4 Conclusionp. 20
Referencesp. 21
2 Introduction to Evolutionary Algorithmsp. 27
2.1 Optimization Basicsp. 28
2.2 Evolutionary Algorithmsp. 29
2.3 Basic Components of Evolutionary Algorithmsp. 32
2.3.1 Representationp. 32
2.3.2 Fitness Functionp. 32
2.3.3 Selectionp. 32
2.3.4 Crossoverp. 33
2.3.5 Mutationp. 34
2.3.6 Replacementp. 35
2.3.7 Elitismp. 35
2.3.8 Stopping Criteriap. 35
2.4 Panmictic Evolutionary Algorithmsp. 36
2.4.1 Generational EAp. 36
2.4.2 Steady-State EAp. 36
2.5 Evolutionary Algorithms with Structured Populationsp. 36
2.5.1 Cellular EAsp. 37
2.5.2 Cooperative Revolutionary EAsp. 38
2.6 Multi-Objective Evolutionary Algorithmsp. 39
2.6.1 Basic Concepts in Multi-Objective Optimizationp. 40
2.6.2 Hierarchical Multi-Objective Problem Optimizationp. 42
2.6.3 Simultaneous Multi-Objective Problem Optimizationp. 43
2.7 Conclusionp. 44
Referencesp. 45
3 Survey on Optimization Problems for Mobile Ad Hoc Networksp. 49
3.1 Taxonomy of the Optimization Processp. 51
3.1.1 Online and Offline Techniquesp. 51
3.1.2 Using Global or Local Knowledgep. 52
3.1.3 Centralized and Decentralized Systemsp. 52
3.2 State of the Artp. 53
3.2.1 Topology Managementp. 53
3.2.2 Broadcasting Algorithmsp. 58
3.2.3 Routing Protocolsp. 59
3.2.4 Clustering Approachesp. 63
3.2.5 Protocol Optimizationp. 64
3.2.6 Modeling the Mobility of Nodesp. 65
3.2.7 Selfish Behaviorsp. 66
3.2.8 Security Issuesp. 67
3.2.9 Other Applicationsp. 67
3.3 Conclusionp. 68
Referencesp. 69
4 Mobile Networks Simulationp. 79
4.1 Signal Propagation Modelingp. 80
4.1.1 Physical Phenomenap. 81
4.1.2 Signal Propagation Modelsp. 85
4.2 State of the Art of Network Simulatorsp. 89
4.2.1 Simulatorsp. 89
4.2.2 Analysisp. 92
4.3 Mobility Simulationp. 93
4.3.1 Mobility Modelsp. 93
4.3.2 State of the Art of Mobility Simulatorsp. 96
4.4 Conclusionp. 98
Referencesp. 98
Part II Problems Optimizationp. 105
5 Proposed Optimization Frameworkp. 107
5.1 Architecturep. 108
5.2 Optimization Algorithmsp. 110
5.2.1 Single-Objective Algorithmsp. 110
5.2.2 Multi-Objective Algorithmsp. 115
5.3 Simulatorsp. 121
5.3.1 Network Simulator: ns-3p. 121
5.3.2 Mobility Simulator: SUMOp. 123
5.3.3 Graph-Based Simulationsp. 126
5.4 Experimental Setupp. 127
5.5 Conclusion 131 Referencesp. 131
6 Broadcasting Protocolp. 135
6.1 The Problemp. 136
6.1.1 DFCN Protocolp. 136
6.1.2 Optimization Problem Definitionp. 138
6.2 Experimentsp. 140
6.2.1 Algorithm Configurationsp. 140
6.2.2 Comparison of the Performance of the Algorithmsp. 141
6.3 Analysis of Resultsp. 142
6.3.1 Building a Representative Subset of Best Solutionsp. 143
6.3.2 Interpretation of the Resultsp. 145
6.3.3 Selected Improved DFCN Configurationsp. 148
6.4 Conclusionp. 150
Referencesp. 151
7 Energy Managementp. 153
7.1 The Problemp. 154
7.1.1 AEDB Protocolp. 154
7.1.2 Optimization Problem Definitionp. 156
7.2 Experimentsp. 159
7.2.1 Algorithm Configurationsp. 159
7.2.2 Comparison of the Performance of the Algorithmsp. 160
7.3 Analysis of Resultsp. 161
7.4 Selecting Solutions from the Pareto Frontp. 164
7.4.1 Performance of the Selected Solutionsp. 167
7.5 Conclusionp. 170
Referencesp. 171
8 Network Topologyp. 173
8.1 The Problemp. 175
8.1.1 Injection Networksp. 175
8.1.2 Optimization Problem Definitionp. 176
8.2 Heuristicsp. 178
8.2.1 Centralizedp. 178
8.2.2 Distributedp. 179
8.3 Experimentsp. 180
8.3.1 Algorithm Configurationsp. 180
8.3.2 Comparison of the Performance of the Algorithmsp. 180
8.4 Analysis of Resultsp. 183
8.4.1 Analysis of the Objective Valuesp. 183
8.4.2 Comparison with Heuristicsp. 185
8.5 Conclusionp. 187
Referencesp. 188
9 Realistic Vehicular Mobilityp. 191
9.1 The Problemp. 192
9.1.1 Vehicular Mobility Modelp. 192
9.1.2 Optimization Problem Definitionp. 196
9.2 Experimentsp. 199
9.2.1 Algorithms Configurationp. 199
9.2.2 Comparison of the Performance of the Algorithmsp. 200
9.3 Analysis of Resultsp. 202
9.3.1 Analysis of the Decision Variablesp. 202
9.3.2 Analysis of the Objective Valuesp. 204
9.4 Conclusionp. 206
Referencesp. 206
10 Summary and Discussionp. 209
10.1 A New Methodology for Optimization in Mobile Ad Hoc Networksp. 211
10.2 Performance of the Three Algorithmic Proposalsp. 213
10.2.1 Broadcasting Protocolp. 213
10.2.2 Energy-Efficient Communicationsp. 214
10.2.3 Network Connectivityp. 214
10.2.4 Vehicular Mobilityp. 215
10.3 Global Discussion on the Performance of the Algorithmsp. 215
10.3.1 Single-Objective Casep. 216
10.3.2 Multi-Objective Casep. 217
10.4 Conclusionp. 218
Referencesp. 218
Indexp. 221