A Multi-Objective Ant Colony Optimisation-Based Routing Approach for Wireless Sensor Networks Incorporating Trust
Total Page:16
File Type:pdf, Size:1020Kb
Georg-August-Universit¨at G¨ottingen Institute of Computer Science A Multi-objective Ant Colony Optimisation-based Routing Approach for Wireless Sensor Networks Incorporating Trust Dissertation zur Erlangung des mathematisch-naturwissenschaftlichen Doktorgrades \Doctor rerum naturalium" der Georg-August-Universit¨atG¨ottingen vorgelegt von Ansgar Kellner aus Hannover G¨ottingen2012 Referent: Prof. Dr. Dieter Hogrefe Korreferent: Prof. Dr. Xiaoming Fu Tag der m¨undlichenPr¨ufung: 21. Juni 2012 Abstract In the near future, Wireless Sensor Networks (WSNs) are expected to play an im- portant role for sensing applications, in the civilian as well as in the military sector. WSNs are autonomous, distributed, self-organised networks consisting of multiple sen- sor nodes. Usually, the limited radio range of the nodes, arising from energy constrains, is overcome by the cooperation of nodes. As the Combinatorial Optimisation Problem (COP) of routing is computationally hard, often approximation algorithms are preferred, which are capable of finding near optimal solutions within polynomial time. A simple but robust way of solving the routing COP is the application of Ant Colony Optimisation (ACO)-based routing algorithms. When multiple (conflicting) objectives should be considered, ACO algorithms can be extended to Multi-objective Ant Colony Optimisation (MOACO) algorithms that are capable of considering multiple objectives at the same time within the optimisation process. Normally, the routing in WSNs is susceptible to adversaries due to their deployment in unattended or in hostile environments. Particularly, attacks from compromised nodes (insider attacks) are a severe problem in WSNs. As insider attacks cannot be alleviated by classical security measures, often soft security measures (trust and reputation) are applied to mitigate the impact of these attacks. In this thesis, the idea of using trust as security measure against insider attacks is seized and interweaved with an MOACO-based routing approach. The Multi-objective Ant Colony Optimisation Routing Framework for WSNs (MARFWSN) is developed, a routing framework for WSNs that provides an interface for the docking of MOACO- based algorithms that can be used for the routing. Different MOACO-based algo- rithms { including ASMOACO, MMASMOACO, ACSMOACO and SRMOACO { are implemented and tested, considering multiple objectives incorporating trust. In the first step, several pre-experiments are conducted to find the best input parameters for the MOACO-based WSN routing algorithms. Subsequently, further experiments aim for comparing the MOACO-based routing algorithms to the well-known Dynamic Source Routing (DSR) protocol regarding several performance criteria. Different topologies and traffic pat- terns are taken into account to obtain heterogeneous results, depending on the specific application area of the tested routing algorithms. The simulation results show that the MOACO-based routing algorithms perform sim- ilarly compared to the DSR-based protocol, implicating the possibility for their util- isation in WSNs. The additional benefit of the mitigation of insider attacks for the MOACO-based algorithms, though result in a slightly higher routing overhead and end-to-end delay. Contents 1 Introduction1 1.1 Research Question......................4 1.2 Thesis Contributions.....................5 1.3 Thesis Scope.........................5 2 Theoretical Foundations9 2.1 Wireless Sensor Networks..................9 2.1.1 Application Areas of WSNs............. 10 2.1.2 Sensor Node Hardware Components........ 12 2.1.3 Network Architecture of WSNs........... 13 2.1.4 Difference between MANETs and WSNs...... 15 2.1.5 Unique Constraints and Challenges of WSNs... 16 2.1.6 Security in WSNs.................. 19 2.2 Trust and Reputation.................... 22 2.2.1 Hard vs. Soft Security................ 22 2.2.2 Notion of Trust and Reputation........... 23 2.2.3 Classes of Trust.................... 27 2.2.4 Trust in WSNs.................... 27 2.3 COPs Fundamentals..................... 29 2.3.1 Global Optimisation................. 29 2.3.2 Combinatorial Optimisation Problems....... 32 2.3.3 Multi-objective Combinatorial Optimisation Prob- lems.......................... 39 2.3.4 Decision Making................... 43 2.4 Ant Colony Optimisation.................. 51 vii viii CONTENTS 2.4.1 Biologically-inspired Algorithms for Optimisation Problems....................... 51 2.4.2 Ant Colony Optimisation.............. 54 2.4.3 From Real Ants to Artificial Ants......... 59 2.4.4 Ant Colony Optimisation Algorithms........ 62 2.4.5 Theoretical Works on Ant Colony Optimisation Al- gorithms........................ 73 2.4.6 Applications of Ant Colony Optimisation Algorithms 73 2.5 Multi-objective Ant Colony Optimisation......... 74 2.5.1 Taxonomy of Multi-objective Ant Colony Optimi- sation Algorithms.................. 75 2.5.2 Performance Metrics................. 79 2.6 Summary........................... 84 3 Application of ACO to Routing in WSNs 87 3.1 Routing in WSNs....................... 87 3.1.1 Characteristics of the Routing in WSNs...... 88 3.1.2 Taxonomy of WSN Routing Algorithms...... 89 3.1.3 WSN Routing Requirements............ 93 3.1.4 WSN Network Layer Attacks............ 94 3.2 Routing Based on Ant Colony Optimisation........ 96 3.2.1 Basic Idea of ACO-based Routing Algorithms in WSNs......................... 96 3.2.2 Wired Networks................... 99 3.2.3 Wireless Networks.................. 100 3.2.4 Multi-objective Ant Colony Optimisation Algo- rithms for Routing.................. 112 3.3 Summary........................... 113 CONTENTS ix 4 Implementation 117 4.1 Problem Definition...................... 117 4.2 Methodology......................... 118 4.2.1 Simulation Environments for WSNs........ 118 4.2.2 OMNeT++...................... 121 4.3 Implementation of App. and Netw. Layer......... 127 4.3.1 Application Layer.................. 127 4.3.2 Network Layer: Multi-objective Ant Colony Opti- misation Routing Framework for Wireless Sensor Networks....................... 132 4.3.3 Network Layer: Dynamic Source Routing..... 150 4.4 Summary........................... 158 5 Experiments and Evaluation 163 5.1 Experiment Settings..................... 163 5.1.1 Simulation Scenario Configuration......... 164 5.1.2 Sensor Node Configuration............. 168 5.2 Routing Algorithms..................... 172 5.2.1 MARFWSN-based Network Layer......... 172 5.2.2 DSR-based Network Layer.............. 176 5.2.3 Performance Metrics................. 177 5.3 Experiments and Evaluation................. 179 5.3.1 Pre-Experiments: Finding Optimal Parameters for MOACO Algorithms................. 179 5.3.2 Comparison of MARFWSN-based and DSR-based Routing Algorithms................. 186 5.3.3 Remarks........................ 255 x CONTENTS 5.3.4 Conclusions...................... 256 5.4 Summary........................... 260 6 Conclusions and Future Work 263 6.1 Contributions......................... 263 6.1.1 Foundations...................... 263 6.1.2 Multi-objective Ant Colony Optimisation Routing Framework for Wireless Sensor Networks (WSNs) 264 6.1.3 Experiments and Evaluation............ 265 6.2 Future Work......................... 267 References 298 List of Figures 1.1 Scalability vs. determinism (cf. [1, p. 50]).........3 1.2 Overview of chapters of the thesis..............6 2.1 Components of a sensor node (cf. [2])............ 12 2.2 Architecture of a WSN.................... 13 2.3 Basic security requirements for WSNs........... 20 2.4 Trust transitivity....................... 25 2.5 Trust in WSNs (cf. [3]).................... 28 2.6 Local and global maxima and minima........... 30 2.7 The concept of mathematical optimisation: modelling and solving............................. 31 2.8 Mapping from decision space to objective space...... 33 2.9 Four cities Travelling Salesman Problem (TSP)...... 39 2.10 Mapping from decision space to objective space...... 41 2.11 Mapping from Pareto set in the decision space to Pareto front in the objective space................. 43 2.12 Finding the final solution.................. 44 2.13 Three approaches to incorporate the Decision Maker (DM) in the decision making process (cf. [4])........... 45 2.14 Taxonomy of biologically-inspired algorithms....... 51 2.15 Experimental setup of the diamond-shaped bridge experi- ment (cf. [5])......................... 56 2.16 Experimental setup of the bridge experiment with two modules in which each module has two branches of dif- ferent lengths (cf. [6]).................... 58 2.17 Example of hypervolume indicator............. 81 xiii xiv LIST OF FIGURES 3.1 Basic idea of Multi-objective Ant Colony Optimisation (MOACO)-based routing algorithms............ 98 4.1 OMNeT++: simple and compound modules (cf. [7])... 122 4.2 OMNeT++ 4.0 IDE [8]................... 123 4.3 MiXiM: base node...................... 125 4.4 MiXiM: base network.................... 126 4.5 Application protocol message flow............. 128 4.6 Application messages..................... 129 4.7 Derived classes from GenericMOACO all implementing the IMOACO interface....................... 138 4.8 Flowchart of the route discovery with forward ants.... 145 4.9 Flowchart of transporting packets with backward ants.. 146 4.10 Overview of the main data structure for MOACO-based algorithms in an example.................. 147 4.11 Two phases of HELLO messages.............. 148 4.12 Basic idea of the application message queue........ 150 4.13 Flowchart of the application message queue.......