A Review on Swarm Intelligence Based Routing Approaches

The principles of bio-inspired or swarm intelligence algorithms can be effectively used to achieve optimal solutions in routing for complex and dynamic wireless sensor networks or body area networks. As the name indicates, it is a field that is inspired by natural living beings like ants, bees, fishes, etc. Studies have proved that the routing protocols based on such bio-inspired methods perform better in terms of energy efficiency, reliability, adaptivity, scalability, and robustness. The general classification of routing protocols is classical-based and swarm-based routing protocols, where both the protocols were specifically categorized as data-centric, location-aware, hierarchical and network flow, and QoS aware protocols. In this paper, an evocative taxonomy and comparison of various swarm-based routing algorithms are presented. A brief discussion about the sensor network design and the major factors that influence the routing is also discussed. The comparative analysis of the selected swarm-based protocols is also done with respect to routing characteristics like query based, route selection, energy efficiency, and path selection. From the review, it is observed that the selection of a routing protocol is application dependent. This paper will be helpful to the researchers as a reference on bio-inspired algorithms for new protocol designs and also for the proper selection of routing protocols according to the type of applications

A Review on Swarm Intelligence Based Routing Approaches

The principles of bio-inspired or swarm intelligence algorithms can be effectively used to achieve optimal solutions in routing for complex and dynamic wireless sensor networks or body area networks. As the name indicates, it is a field that is inspired by natural living beings like ants, bees, fishes, etc. Studies have proved that the routing protocols based on such bio-inspired methods perform better in terms of energy efficiency, reliability, adaptivity, scalability, and robustness. The general classification of routing protocols is classical-based and swarm-based routing protocols, where both the protocols were specifically categorized as data-centric, location-aware, hierarchical and network flow, and QoS aware protocols. In this paper, an evocative taxonomy and comparison of various swarm-based routing algorithms are presented. A brief discussion about the sensor network design and the major factors that influence the routing is also discussed. The comparative analysis of the selected swarm-based protocols is also done with respect to routing characteristics like query based, route selection, energy efficiency, and path selection. From the review, it is observed that the selection of a routing protocol is application dependent. This paper will be helpful to the researchers as a reference on bio-inspired algorithms for new protocol designs and also for the proper selection of routing protocols according to the type of applications

Cognitive Security Framework For Heterogeneous Sensor Network Using Swarm Intelligence

Rapid development of sensor technology has led to applications ranging from academic to military in a short time span. These tiny sensors are deployed in environments where security for data or hardware cannot be guaranteed. Due to resource constraints, traditional security schemes cannot be directly applied. Unfortunately, due to minimal or no communication security schemes, the data, link and the sensor node can be easily tampered by intruder attacks. This dissertation presents a security framework applied to a sensor network that can be managed by a cohesive sensor manager. A simple framework that can support security based on situation assessment is best suited for chaotic and harsh environments. The objective of this research is designing an evolutionary algorithm with controllable parameters to solve existing and new security threats in a heterogeneous communication network. An in-depth analysis of the different threats and the security measures applied considering the resource constrained network is explored. Any framework works best, if the correlated or orthogonal performance parameters are carefully considered based on system goals and functions. Hence, a trade-off between the different performance parameters based on weights from partially ordered sets is applied to satisfy application specific requirements and security measures. The proposed novel framework controls heterogeneous sensor network requirements,and balance the resources optimally and efficiently while communicating securely using a multi-objection function. In addition, the framework can measure the affect of single or combined denial of service attacks and also predict new attacks under both cooperative and non-cooperative sensor nodes. The cognitive intuition of the framework is evaluated under different simulated real time scenarios such as Health-care monitoring, Emergency Responder, VANET, Biometric security access system, and Battlefield monitoring. The proposed three-tiered Cognitive Security Framework is capable of performing situation assessment and performs the appropriate security measures to maintain reliability and security of the system. The first tier of the proposed framework, a crosslayer cognitive security protocol defends the communication link between nodes during denial-of-Service attacks by re-routing data through secure nodes. The cognitive nature of the protocol balances resources and security making optimal decisions to obtain reachable and reliable solutions. The versatility and robustness of the protocol is justified by the results obtained in simulating health-care and emergency responder applications under Sybil and Wormhole attacks. The protocol considers metrics from each layer of the network model to obtain an optimal and feasible resource efficient solution. In the second tier, the emergent behavior of the protocol is further extended to mine information from the nodes to defend the network against denial-of-service attack using Bayesian models. The jammer attack is considered the most vulnerable attack, and therefore simulated vehicular ad-hoc network is experimented with varied types of jammer. Classification of the jammer under various attack scenarios is formulated to predict the genuineness of the attacks on the sensor nodes using receiver operating characteristics. In addition to detecting the jammer attack, a simple technique of locating the jammer under cooperative nodes is implemented. This feature enables the network in isolating the jammer or the reputation of node is affected, thus removing the malicious node from participating in future routes. Finally, a intrusion detection system using `bait\u27 architecture is analyzed where resources is traded-off for the sake of security due to sensitivity of the application. The architecture strategically enables ant agents to detect and track the intruders threateningthe network. The proposed framework is evaluated based on accuracy and speed of intrusion detection before the network is compromised. This process of detecting the intrusion earlier helps learn future attacks, but also serves as a defense countermeasure. The simulated scenarios of this dissertation show that Cognitive Security Framework isbest suited for both homogeneous and heterogeneous sensor networks

Energy and performance-optimized scheduling of tasks in distributed cloud and edge computing systems

Infrastructure resources in distributed cloud data centers (CDCs) are shared by heterogeneous applications in a high-performance and cost-effective way. Edge computing has emerged as a new paradigm to provide access to computing capacities in end devices. Yet it suffers from such problems as load imbalance, long scheduling time, and limited power of its edge nodes. Therefore, intelligent task scheduling in CDCs and edge nodes is critically important to construct energy-efficient cloud and edge computing systems. Current approaches cannot smartly minimize the total cost of CDCs, maximize their profit and improve quality of service (QoS) of tasks because of aperiodic arrival and heterogeneity of tasks. This dissertation proposes a class of energy and performance-optimized scheduling algorithms built on top of several intelligent optimization algorithms. This dissertation includes two parts, including background work, i.e., Chapters 3–6, and new contributions, i.e., Chapters 7–11. 1) Background work of this dissertation. Chapter 3 proposes a spatial task scheduling and resource optimization method to minimize the total cost of CDCs where bandwidth prices of Internet service providers, power grid prices, and renewable energy all vary with locations. Chapter 4 presents a geography-aware task scheduling approach by considering spatial variations in CDCs to maximize the profit of their providers by intelligently scheduling tasks. Chapter 5 presents a spatio-temporal task scheduling algorithm to minimize energy cost by scheduling heterogeneous tasks among CDCs while meeting their delay constraints. Chapter 6 gives a temporal scheduling algorithm considering temporal variations of revenue, electricity prices, green energy and prices of public clouds. 2) Contributions of this dissertation. Chapter 7 proposes a multi-objective optimization method for CDCs to maximize their profit, and minimize the average loss possibility of tasks by determining task allocation among Internet service providers, and task service rates of each CDC. A simulated annealing-based bi-objective differential evolution algorithm is proposed to obtain an approximate Pareto optimal set. A knee solution is selected to schedule tasks in a high-profit and high-quality-of-service way. Chapter 8 formulates a bi-objective constrained optimization problem, and designs a novel optimization method to cope with energy cost reduction and QoS improvement. It jointly minimizes both energy cost of CDCs, and average response time of all tasks by intelligently allocating tasks among CDCs and changing task service rate of each CDC. Chapter 9 formulates a constrained bi-objective optimization problem for joint optimization of revenue and energy cost of CDCs. It is solved with an improved multi-objective evolutionary algorithm based on decomposition. It determines a high-quality trade-off between revenue maximization and energy cost minimization by considering CDCs’ spatial differences in energy cost while meeting tasks’ delay constraints. Chapter 10 proposes a simulated annealing-based bees algorithm to find a close-to-optimal solution. Then, a fine-grained spatial task scheduling algorithm is designed to minimize energy cost of CDCs by allocating tasks among multiple green clouds, and specifies running speeds of their servers. Chapter 11 proposes a profit-maximized collaborative computation offloading and resource allocation algorithm to maximize the profit of systems and guarantee that response time limits of tasks are met in cloud-edge computing systems. A single-objective constrained optimization problem is solved by a proposed simulated annealing-based migrating birds optimization. This dissertation evaluates these algorithms, models and software with real-life data and proves that they improve scheduling precision and cost-effectiveness of distributed cloud and edge computing systems

Energy-efficient routing protocols in heterogeneous wireless sensor networks

Sensor networks feature low-cost sensor devices with wireless network capability, limited transmit power, resource constraints and limited battery energy. The usage of cheap and tiny wireless sensors will allow very large networks to be deployed at a feasible cost to provide a bridge between information systems and the physical world. Such large-scale deployments will require routing protocols that scale to large network sizes in an energy-efficient way. This thesis addresses the design of such network routing methods. A classification of existing routing protocols and the key factors in their design (i.e., hardware, topology, applications) provides the motivation for the new three-tier architecture for heterogeneous networks built upon a generic software framework (GSF). A range of new routing algorithms have hence been developed with the design goals of scalability and energy-efficient performance of network protocols. They are respectively TinyReg - a routing algorithm based on regular-graph theory, TSEP - topological stable election protocol, and GAAC - an evolutionary algorithm based on genetic algorithms and ant colony algorithms. The design principle of our routing algorithms is that shortening the distance between the cluster-heads and the sink in the network, will minimise energy consumption in order to extend the network lifetime, will achieve energy efficiency. Their performance has been evaluated by simulation in an extensive range of scenarios, and compared to existing algorithms. It is shown that the newly proposed algorithms allow long-term continuous data collection in large networks, offering greater network longevity than existing solutions. These results confirm the validity of the GSF as an architectural approach to the deployment of large wireless sensor networks

Modeling industry 4.0 based fog computing environments for application analysis and deployment

The extension of the Cloud to the Edge of the network through Fog Computing can have a significant impact on the reliability and latencies of deployed applications. Recent papers have suggested a shift from VM and Container based deployments to a shared environment among applications to better utilize resources. Unfortunately, the existing deployment and optimization methods pay little attention to developing and identifying complete models to such systems which may cause large inaccuracies between simulated and physical run-time parameters. Existing models do not account for application interdependence or the locality of application resources which causes extra communication and processing delays. This paper addresses these issues by carrying out experiments in both cloud and edge systems with various scales and applications. It analyses the outcomes to derive a new reference model with data driven parameter formulations and representations to help understand the effect of migration on these systems. As a result, we can have a more complete characterization of the fog environment. This, together with tailored optimization methods than can handle the heterogeneity and scale of the fog can improve the overall system run-time parameters and improve constraint satisfaction. An Industry 4.0 based case study with different scenarios was used to analyze and validate the effectiveness of the proposed model. Tests were deployed on physical and virtual environments with different scales. The advantages of the model based optimization methods were validated in real physical environments. Based on these tests, we have found that our model is 90% accurate on load and delay predictions for application deployments in both cloud and edge

Hybridization of enhanced ant colony system and Tabu search algorithm for packet routing in wireless sensor network

In Wireless Sensor Network (WSN), high transmission time occurs when search agent focuses on the same sensor nodes, while local optima problem happens when agent gets trapped in a blind alley during searching. Swarm intelligence algorithms have been applied in solving these problems including the Ant Colony System (ACS) which is one of the ant colony optimization variants. However, ACS suffers from local optima and stagnation problems in medium and large sized environments due to an ineffective exploration mechanism. This research proposes a hybridization of Enhanced ACS and Tabu Search (EACS(TS)) algorithm for packet routing in WSN. The EACS(TS) selects sensor nodes with high pheromone values which are calculated based on the residual energy and current pheromone value of each sensor node. Local optima is prevented by marking the node that has no potential neighbour node as a Tabu node and storing it in the Tabu list. Local pheromone update is performed to encourage exploration to other potential sensor nodes while global pheromone update is applied to encourage the exploitation of optimal sensor nodes. Experiments were performed in a simulated WSN environment supported by a Routing Modelling Application Simulation Environment (RMASE) framework to evaluate the performance of EACS(TS). A total of 6 datasets were deployed to evaluate the effectiveness of the proposed algorithm. Results showed that EACS(TS) outperformed in terms of success rate, packet loss, latency, and energy efficiency when compared with single swarm intelligence routing algorithms which are Energy-Efficient Ant-Based Routing (EEABR), BeeSensor and Termite-hill. Better performances were also achieved for success rate, throughput, and latency when compared to other hybrid routing algorithms such as Fish Swarm Ant Colony Optimization (FSACO), Cuckoo Search-based Clustering Algorithm (ICSCA), and BeeSensor-C. The outcome of this research contributes an optimized routing algorithm for WSN. This will lead to a better quality of service and minimum energy utilization

Study of Wireless Sensor Network Applications in Network Optimization

Because of the rapid development of wireless sensor network, it widely applied in all areas of life, in-depth study of the technology will also explore the potential application of more in-depth. The main research of WSN technology in some environment in the real world information acquisition and processing technology, it realizes the intercommunication of the real world and the Internet world, opened the human WSN network era. WSN network through the digital world com. Human concepts inherent information world and explore the objective facts, from the inquiry from change the people and things in nature, the data are the basic objects interactively; the sensor node has sensing effect in direct contact with the objective environment, continuously enhance the practical function of virtual networks, but also increase the capacity of human understanding of the objective world; through the real-time sensing and found the state change monitoring target, at the same time the collection of data processing, the processing of useful information through the wireless transmission mode is transmitted to a data collection center or client. It will make the development and wide application in various fields of social life are more intelligent and modernization. Although its development still in an immature stage, Tan of many problems still has not obtained the very good solution, research work on WSN is far from over. In this paper the concept and system structure of wireless sensor network analysis began to design, application system based on wireless sensor network monitoring farmland use temperature and humidity ZigBee as an example to study the development process of application system for wireless sensor networks