Preface |
|
xiii | |
|
|
xv | |
|
Chapter 1 Bio-Inspired Computation and Optimization: An Overview |
|
|
1 | (22) |
|
|
2 | (1) |
|
1.2 Telecommunications and Optimization |
|
|
2 | (2) |
|
1.3 Key Challenges in Optimization |
|
|
4 | (3) |
|
1.3.1 Infinite Monkey Theorem and Heuristicity |
|
|
4 | (1) |
|
1.3.2 Efficiency of an Algorithm |
|
|
5 | (1) |
|
1.3.3 How to Choose Algorithms |
|
|
5 | (1) |
|
|
6 | (1) |
|
1.4 Bio-Inspired Optimization Algorithms |
|
|
7 | (6) |
|
1.4.1 SI-Based Algorithms |
|
|
7 | (3) |
|
1.4.2 Non-SI-Based Algorithms |
|
|
10 | (3) |
|
|
13 | (1) |
|
1.5 Artificial Neural Networks |
|
|
13 | (3) |
|
|
13 | (1) |
|
|
14 | (1) |
|
1.5.3 Back Propagation Algorithm |
|
|
15 | (1) |
|
1.6 Support Vector Machine |
|
|
16 | (3) |
|
|
16 | (2) |
|
1.6.2 Kernel Tricks and Nonlinear SVM |
|
|
18 | (1) |
|
|
19 | (4) |
|
|
19 | (4) |
|
Chapter 2 Bio-Inspired Approaches in Telecommunications |
|
|
23 | (20) |
|
|
23 | (2) |
|
2.2 Design Problems in Telecommunications |
|
|
25 | (2) |
|
|
27 | (6) |
|
2.3.1 Energy Consumption in Wireless Communications |
|
|
28 | (1) |
|
2.3.2 Metrics for Energy Efficiency |
|
|
29 | (2) |
|
2.3.3 Radio Resource Management |
|
|
31 | (1) |
|
2.3.4 Strategic Network Deployment |
|
|
32 | (1) |
|
2.4 Orthogonal Frequency Division Multiplexing |
|
|
33 | (2) |
|
|
33 | (1) |
|
2.4.2 Three-Step Procedure for Timing and Frequency Synchronization |
|
|
34 | (1) |
|
2.5 OFDMA Model Considering Energy Efficiency and Quality-of-Service |
|
|
35 | (3) |
|
2.5.1 Mathematical Formulation |
|
|
35 | (2) |
|
|
37 | (1) |
|
|
38 | (5) |
|
|
38 | (5) |
|
Chapter 3 Firefly Algorithm in Telecommunications |
|
|
43 | (30) |
|
|
44 | (2) |
|
|
46 | (3) |
|
3.2.1 Algorithm Complexity |
|
|
48 | (1) |
|
3.2.2 Variants of Firefly Algorithm |
|
|
48 | (1) |
|
3.3 Traffic Characterization |
|
|
49 | (6) |
|
3.3.1 Network Management Based on Flow Analysis and Traffic Characterization |
|
|
51 | (1) |
|
3.3.2 Firefly Harmonic Clustering Algorithm |
|
|
52 | (2) |
|
|
54 | (1) |
|
3.4 Applications in Wireless Cooperative Networks |
|
|
55 | (15) |
|
|
58 | (1) |
|
3.4.2 System Model and Problem Statement |
|
|
59 | (3) |
|
|
62 | (2) |
|
|
64 | (1) |
|
3.4.5 Simulations and Numerical Results |
|
|
65 | (5) |
|
|
70 | (3) |
|
3.5.1 FA in Traffic Characterization |
|
|
70 | (1) |
|
3.5.2 FA in Cooperative Networks |
|
|
70 | (1) |
|
|
70 | (3) |
|
Chapter 4 A Survey of Intrusion Detection Systems Using Evolutionary Computation |
|
|
73 | (22) |
|
|
73 | (2) |
|
4.2 Intrusion Detection Systems |
|
|
75 | (4) |
|
|
76 | (2) |
|
4.2.2 Research Areas and Challenges in Intrusion Detection |
|
|
78 | (1) |
|
4.3 The Method: Evolutionary Computation |
|
|
79 | (1) |
|
4.4 Evolutionary Computation Applications on Intrusion Detection |
|
|
80 | (9) |
|
|
80 | (1) |
|
|
81 | (2) |
|
4.4.3 Detection Techniques and Response |
|
|
83 | (3) |
|
|
86 | (2) |
|
|
88 | (1) |
|
4.4.6 Testing and Evaluation |
|
|
88 | (1) |
|
4.5 Conclusion and Future Directions |
|
|
89 | (6) |
|
|
90 | (1) |
|
|
91 | (4) |
|
Chapter 5 VoIP Quality Prediction Model by Bio-Inspired Methods |
|
|
95 | (22) |
|
|
96 | (1) |
|
5.2 Speech Quality Measurement Background |
|
|
97 | (3) |
|
|
97 | (1) |
|
5.2.2 Intrusive Objective Methods |
|
|
98 | (1) |
|
5.2.3 Nonintrusive Objective Methods |
|
|
99 | (1) |
|
5.2.4 Bio-Inspired Methods |
|
|
100 | (1) |
|
|
100 | (6) |
|
5.3.1 Methodology for Conversational Quality Prediction (PESQ/E-model) |
|
|
100 | (4) |
|
5.3.2 Nonlinear Surface Regression Model |
|
|
104 | (1) |
|
5.3.3 Neural Network Model |
|
|
105 | (1) |
|
|
105 | (1) |
|
|
106 | (4) |
|
5.4.1 The Data Sets' Structure |
|
|
108 | (2) |
|
5.4.2 The Performance Measures |
|
|
110 | (1) |
|
5.5 Results and Discussion |
|
|
110 | (3) |
|
5.5.1 Correlation Comparison |
|
|
110 | (1) |
|
|
111 | (2) |
|
|
113 | (4) |
|
|
115 | (2) |
|
Chapter 6 On the Impact of the Differential Evolution Parameters in the Solution of the Survivable Virtual Topology-Mapping Problem in IP-Over-WDM Networks |
|
|
117 | (24) |
|
|
117 | (3) |
|
|
120 | (1) |
|
|
121 | (3) |
|
6.3.1 Fitness of an Individual |
|
|
123 | (1) |
|
6.3.2 Pseudocode of the DE Algorithm |
|
|
123 | (1) |
|
6.3.3 Enhanced DE-VTM Algorithm |
|
|
124 | (1) |
|
|
124 | (4) |
|
6.5 Results and Discussion |
|
|
128 | (11) |
|
|
139 | (2) |
|
|
139 | (2) |
|
Chapter 7 Radio Resource Management by Evolutionary Algorithms for 4G LTE-Advanced Networks |
|
|
141 | (24) |
|
7.1 Introduction to Radio Resource Management |
|
|
142 | (3) |
|
|
143 | (1) |
|
|
143 | (2) |
|
|
145 | (2) |
|
7.2.1 Carrier Aggregation |
|
|
145 | (1) |
|
|
145 | (1) |
|
|
146 | (1) |
|
7.2.4 Coordinated Multipoint Transmission |
|
|
146 | (1) |
|
7.3 Self-Organization Using Evolutionary Algorithms |
|
|
147 | (3) |
|
|
147 | (1) |
|
|
148 | (1) |
|
|
148 | (1) |
|
7.3.4 LTE-A Open Research Issues and Challenges |
|
|
149 | (1) |
|
|
150 | (11) |
|
|
151 | (1) |
|
|
152 | (1) |
|
|
153 | (1) |
|
|
154 | (1) |
|
7.4.5 Resource Allocation |
|
|
155 | (6) |
|
|
161 | (4) |
|
|
162 | (3) |
|
Chapter 8 Robust Transmission for Heterogeneous Networks with Cognitive Small Cells |
|
|
165 | (20) |
|
|
165 | (2) |
|
8.2 Spectrum Sensing for Cognitive Radio |
|
|
167 | (1) |
|
8.3 Underlay Spectrum Sharing |
|
|
168 | (2) |
|
8.3.1 Underlay Spectrum Sharing for Heterogeneous Networks with MIMO Channels |
|
|
169 | (1) |
|
8.3.2 Underlay Spectrum Sharing for Heterogeneous Networks with Doubly Selective Fading SISO Channels |
|
|
169 | (1) |
|
|
170 | (1) |
|
8.4.1 System Model with MIMO Channel |
|
|
170 | (1) |
|
8.4.2 System Model with Doubly Fading Selective SISO Channel |
|
|
170 | (1) |
|
|
171 | (2) |
|
8.6 Sparsity-Enhanced Mismatch Model (SEMM) |
|
|
173 | (2) |
|
8.7 Sparsity-Enhanced Mismatch Model-Reverse DPSS (SEMMR) |
|
|
175 | (2) |
|
8.8 Precoder Design Using the SEMM and SEMMR |
|
|
177 | (3) |
|
8.8.1 SEMM Precoder Design |
|
|
177 | (1) |
|
8.8.2 Second-Stage SEMMR Precoder and Decoder Design |
|
|
178 | (2) |
|
|
180 | (2) |
|
|
180 | (1) |
|
|
181 | (1) |
|
|
182 | (3) |
|
|
183 | (2) |
|
Chapter 9 Ecologically Inspired Resource Distribution Techniques for Sustainable Communication Networks |
|
|
185 | (20) |
|
|
185 | (1) |
|
9.2 Consumer-Resource Dynamics |
|
|
186 | (2) |
|
9.3 Resource Competition in the NGN |
|
|
188 | (4) |
|
9.4 Conditions for Stability and Coexistence |
|
|
192 | (3) |
|
9.5 Application for LTE Load Balancing |
|
|
195 | (2) |
|
9.6 Validation and Results |
|
|
197 | (4) |
|
|
201 | (4) |
|
|
201 | (4) |
|
Chapter 10 Multiobjective Optimization in Optical Networks |
|
|
205 | (40) |
|
|
206 | (2) |
|
10.1.1 Common Optical Network Problems in a Multiobjective Context |
|
|
206 | (2) |
|
10.2 Multiobjective Optimization |
|
|
208 | (7) |
|
10.2.1 Multiobjective Optimization Formulation |
|
|
208 | (1) |
|
10.2.2 Multiobjective Performance Metrics |
|
|
209 | (1) |
|
10.2.3 Experimental Methodology |
|
|
210 | (2) |
|
10.2.4 Algorithms to Solve MOPs |
|
|
212 | (3) |
|
|
215 | (9) |
|
|
215 | (1) |
|
10.3.2 Multiobjective RWA Formulation |
|
|
216 | (1) |
|
|
216 | (1) |
|
|
217 | (3) |
|
10.3.5 Classical Heuristics |
|
|
220 | (1) |
|
|
221 | (1) |
|
10.3.7 Experimental Results |
|
|
222 | (2) |
|
|
224 | (8) |
|
|
225 | (1) |
|
10.4.2 Classical Problem Formulation |
|
|
226 | (1) |
|
10.4.3 Multiobjective Formulation |
|
|
227 | (1) |
|
10.4.4 Traffic Models and Simulation Algorithm |
|
|
227 | (1) |
|
|
228 | (1) |
|
10.4.6 Experimental Results |
|
|
229 | (3) |
|
|
232 | (7) |
|
10.5.1 Problem Formulation |
|
|
235 | (1) |
|
10.5.2 Generating Candidate Cycles |
|
|
236 | (1) |
|
10.5.3 Multiobjective Evolutionary Algorithms |
|
|
237 | (1) |
|
10.5.4 Experimental Results |
|
|
238 | (1) |
|
|
239 | (6) |
|
|
240 | (5) |
|
Chapter 11 Cell-Coverage-Area Optimization Based on Particle Swarm Optimization (PSO) for Green Macro Long-Term Evolution (LTE) Cellular Networks |
|
|
245 | (18) |
|
|
245 | (1) |
|
|
246 | (2) |
|
11.3 Mechanism of Proposed Cell-Switching Scheme |
|
|
248 | (2) |
|
11.4 System Model and Problem Formulation |
|
|
250 | (2) |
|
|
252 | (2) |
|
11.6 Simulation Results and Discussion |
|
|
254 | (6) |
|
|
254 | (1) |
|
11.6.2 Simulation Flow Chart |
|
|
254 | (1) |
|
11.6.3 Results and Discussion |
|
|
255 | (4) |
|
11.6.4 Energy and OPEX Savings |
|
|
259 | (1) |
|
|
260 | (3) |
|
|
261 | (1) |
|
|
261 | (2) |
|
Chapter 12 Bio-Inspired Computation for Solving the Optimal Coverage Problem in Wireless Sensor Networks: A Binary Particle Swarm Optimization Approach |
|
|
263 | (24) |
|
|
264 | (2) |
|
12.2 Optimal Coverage Problem in WSN |
|
|
266 | (3) |
|
12.2.1 Problem Formulation |
|
|
266 | (2) |
|
|
268 | (1) |
|
|
269 | (1) |
|
|
269 | (3) |
|
12.3.1 Solution Representation and Fitness Function |
|
|
269 | (1) |
|
|
270 | (1) |
|
|
271 | (1) |
|
12.3.4 Maximizing the Disjoint Sets |
|
|
272 | (1) |
|
12.4 Experiments and Comparisons |
|
|
272 | (10) |
|
12.4.1 Algorithm Configurations |
|
|
272 | (1) |
|
12.4.2 Comparisons with State-of-the-Art Approaches |
|
|
273 | (1) |
|
12.4.3 Comparisons with the GA Approach |
|
|
274 | (2) |
|
12.4.4 Extensive Experiments on Different Scale Networks |
|
|
276 | (2) |
|
12.4.5 Results on Maximizing the Disjoint Sets |
|
|
278 | (4) |
|
|
282 | (5) |
|
|
282 | (1) |
|
|
283 | (4) |
|
Chapter 13 Clonal-Selection-Based Minimum-Interference Channel Assignment Algorithms for Multiradio Wireless mesh Networks |
|
|
287 | (36) |
|
|
288 | (2) |
|
|
290 | (5) |
|
|
290 | (2) |
|
13.2.2 Channel Assignment Problem |
|
|
292 | (2) |
|
13.2.3 Related Channel Assignment Algorithms |
|
|
294 | (1) |
|
13.3 Clonal-Selection-Based Algorithms for the Channel Assignment Problem |
|
|
295 | (9) |
|
|
296 | (6) |
|
|
302 | (1) |
|
13.3.3 Variants of the Channel Assignment Algorithm |
|
|
303 | (1) |
|
13.4 Performance Evaluation |
|
|
304 | (14) |
|
13.4.1 Comparison with Other Channel Assignment Algorithms |
|
|
306 | (2) |
|
|
308 | (1) |
|
13.4.3 Impact of Parameter Setting |
|
|
309 | (3) |
|
13.4.4 Impact of Local Search |
|
|
312 | (1) |
|
13.4.5 Variants of Channel Assignment Algorithm |
|
|
313 | (5) |
|
|
318 | (5) |
|
|
320 | (3) |
Index |
|
323 | |