Introduction / 1: |
Motivation of the Work / 1.1: |
Problem Statement / 1.2: |
Hypotheses / 1.2.1: |
An Engineering Approach to Nature-Inspired Routing Protocols / 1.3: |
The Scientific Contributions of the Work / 1.4: |
A Simple, Disributed, Decentralized Multi-Agent System / 1.4.1: |
A Comprehensive Routing System / 1.4.2: |
An Empirical Comprehensive Performance Evaluation Framework / 1.4.3: |
A Scalability Framework for (Nature-Inspired) Agent-Based Routing Protocols / 1.4.4: |
Protocol Engineering of Nature-Inspired Routing Protocols / 1.4.5: |
A Nature-Inspired Linux Router / 1.4.6: |
The Protocol Validation Framework / 1.4.7: |
The Formal Framework for Nature-Inspired Protocols / 1.4.8: |
A Simple, Efficient, and Scalable Nature-Inspired Security Framework / 1.4.9: |
Emerging Mobile and Wireless Sensors Ad Hoc Networks / 1.4.10: |
Organization of the Book / 1.5: |
A Comprehensive Survey of Nature-Inspired Routing Protocols / 2: |
Organization of the Chapter / 2.1: |
Network Routing Algorithms / 2.2: |
Features Landscape of a Modern Routing Algorithm / 2.2.1: |
Taxonomy of Routing Algorithms / 2.2.2: |
Ant Colony Optimization (ACO) Routing Algorithms for Fixed Networks / 2.3: |
Important Elements of ACO in Routing / 2.3.1: |
Ant-Based Control (ABC) for Circuit-Switched Networks / 2.3.2: |
Ant-Based Control (ABC) for Packet-Switched Networks / 2.3.3: |
AntNet / 2.3.4: |
Ant Colony Routing (ACR) and AntNet+SELA QoS-Aware Routing / 2.3.5: |
A Brief History of Research in AntNet / 2.3.6: |
Evolutionary Routing Algorithms for Fixed Networks / 2.4: |
Important Elements of EA in Routing / 2.4.1: |
GARA / 2.4.2: |
ASGA and SynthECA / 2.4.3: |
DGA / 2.4.4: |
Related Work on Routing Algorithms for Fixed Networks / 2.5: |
Artificial Intelligence Community / 2.5.1: |
Networking Community / 2.5.2: |
Summary / 2.6: |
From The Wisdom of the Hive to Routing in Telecommunication Networks / 3: |
An Agent-Based Investigation of a Honeybee Colony / 3.1: |
Labor Management / 3.2.1: |
The Communication Network of a Honeybee Colony / 3.2.2: |
Reinforcement Learning / 3.2.3: |
Distributed Coordination and Planning / 3.2.4: |
Energy-Efficient Foraging / 3.2.5: |
Stochastic Selection of Flower Sites / 3.2.6: |
Group Organization / 3.2.7: |
BeeHive: The Mapping of Concepts from Nature to Networks / 3.3: |
The Bee Agent Model / 3.4: |
Estimation Model of Agents / 3.4.1: |
Goodness of a Neighbor / 3.4.2: |
Communication Paradigm of Agents / 3.4.3: |
Packet-Switching Algorithm / 3.4.4: |
BeeHive Algorithm / 3.5: |
The Performance Evaluation Framework for Nature-Inspired Routing Algorithms / 3.6: |
Routing Algorithms Used for Comparison / 3.7: |
OSPF / 3.7.1: |
Daemon / 3.7.4: |
Simulation Environment for BeeHive / 3.8: |
simpleNet / 3.8.1: |
NTTNet / 3.8.2: |
Node150 / 3.8.3: |
Discussion of the Results from the Experiments / 3.9: |
Congestion Avoidance Behavior / 3.9.1: |
Queue Management Behavior / 3.9.2: |
Hot Spots / 3.9.3: |
Router Crash Experiments / 3.9.4: |
Bursty Traffic Generator / 3.9.5: |
Sessionless Network Traffic / 3.9.6: |
Size of Routing Table / 3.9.7: |
A Scalability Framework for Nature-Inspired Routing Algorithms / 3.10: |
Existing Work on Scalability Analysis / 4.1: |
The Scalability Model for a Routing Algorithm / 4.1.2: |
Cost Model / 4.2.1: |
Power Model of an Algorithm / 4.2.2: |
Scalability Metric for a Routing Algorithm / 4.2.3: |
Simulation Environment for Scalability Analysis / 4.3: |
Node350 / 4.3.1: |
Node650 / 4.3.5: |
Node1050 / 4.3.6: |
Throughput and Packet Delivery Ratio / 4.4: |
Packet Delay / 4.4.2: |
Control Overhead and Suboptimal Overhead / 4.4.3: |
Agent and Packet Processing Complexity / 4.4.4: |
Routing Table Size / 4.4.5: |
Investigation of the Behavior of AntNet / 4.4.6: |
Towards an Empirically Founded Scalability Model for Routing Protocols / 4.5: |
Scalability Matrix and Scalability Analysis / 4.5.1: |
Scalability Analysis of BeeHive / 4.5.2: |
Scalability Analysis of AntNet / 4.5.3: |
Scalability Analysis of OSPF / 4.5.4: |
BeeHive in Real Networks of Linux Routers / 4.6: |
Engineering of Nature-Inspired Routing Protocols / 5.1: |
Structural Design of a Routing Framework / 5.2.1: |
Structural Semantics of the Network Stack / 5.2.2: |
System Design Issues / 5.2.3: |
Natural Routing Framework: Design and Implementation / 5.3: |
Algorithm-Independent Framework / 5.3.1: |
Algorithmic-Dependent BeeHive Module / 5.3.2: |
Protocol Verification Framework / 5.4: |
The Motivation Behind the Design and Structure of Experiments / 5.5: |
Quantum Traffic Engineering / 5.6: |
Real-World Applications Traffic Engineering / 5.6.2: |
Hybrid Traffic Engineering / 5.6.3: |
A Formal Framework for Analyzing the Behavior of BeeHive / 5.7: |
Goodness / 6.1: |
Analytical Model / 6.3: |
Node Traffic / 6.3.1: |
Link Flows / 6.3.2: |
Calculation of Delays / 6.3.3: |
Throughput / 6.3.4: |
Empirical Verification of the Formal Model / 6.4: |
Example 1 / 6.4.1: |
Example 2 / 6.4.2: |
An Efficient Nature-Inspired Security Framework for BeeHive / 6.5: |
Robustness and Security Analysis of a Routing Protocol / 7.1: |
Security Threats to Nature-Inspired Routing Protocols / 7.2.1: |
Existing Works on Security of Routing Protocols / 7.2.2: |
BeeHiveGuard: A Digital Signature-Based Security Framework / 7.3: |
Agent Integrity / 7.3.1: |
Routing Information Integrity / 7.3.2: |
Architecture of BeeHiveGuard / 7.3.3: |
BeeHiveAIS: an Immune-Inspired Security Framework for BeeHive / 7.4: |
Artificial Immune Systems (AISs) / 7.4.1: |
Behavioral Analysis of BeeHive for Designing an AIS / 7.4.2: |
The AIS Model of BeeHiveAIS / 7.4.3: |
Top-Level BeeHiveAIS / 7.4.4: |
Simulation Models of Our Security Frameworks / 7.5: |
Attack Scenarios on Simple Topologies / 7.5.1: |
Analysis of Attacks and Effectiveness of Security Frameworks / 7.5.2: |
Bee-Inspired Routing Protocols for Mobile Ad Hoc and Sensor Networks / 7.5.3: |
Existing Works on Nature-Inspired MANET Routing Protocols / 8.1: |
Bee Agent Model / 8.1.2: |
Packers / 8.2.1: |
Scouts / 8.2.2: |
Foragers / 8.2.3: |
Beeswarm / 8.2.4: |
Architecture of BeeAdHoc / 8.3: |
Packing Floor / 8.3.1: |
Entrance / 8.3.2: |
Dance Floor / 8.3.3: |
Simulation Framework / 8.4: |
Metrics / 8.4.1: |
Node Mobility Behavior / 8.4.2: |
BeeAdHoc in Real-World MANETs / 8.5: |
A Performance Evaluation Framework for Real MANETs in Linux / 8.5.1: |
Results of Experiments / 8.6: |
Security Threats in BeeAdHoc / 8.7: |
Challenges for Routing Protocols in Ad Hoc Sensor Networks / 8.8: |
Existing Works on Routing Protocols for Wireless Sensor Networks / 8.8.1: |
BeeSensor: Architecture and Working / 8.9: |
BeeSensor Agent's Model / 8.9.1: |
Protocol Description / 8.9.2: |
A Performance Evaluation Framework for Nature-Inspired Routing Protocols for WSNs / 8.10: |
Results / 8.10.1: |
Conclusion and Future Work / 8.12: |
Conclusion / 9.1: |
Future Research / 9.2: |
Quality of Service (QoS) Routing / 9.2.1: |
Cyclic Paths / 9.2.2: |
Intelligent and Knowledgeable Network Engineering / 9.2.3: |
Bee Colony Metaheuristic / 9.2.4: |
Natural Engineering: The Need for a Distinct Discipline / 9.3: |
References |
Index |
Introduction / 1: |
Motivation of the Work / 1.1: |
Problem Statement / 1.2: |