Extending the Lifetime of Wireless Sensor Networks Based on an Improved Multi-objective Artificial Bees Colony Algorithm

Reducing the sensors\u27 energy expenditure to prolong the network lifespan as long as possible remains a fundamental problem in the field of wireless networks. Particularly in applications with inaccessible environments, which impose crucial constraints on sensor replacement. It is, therefore, necessary to design adaptive routing protocols, taking into account the environmental constraints and the limited energy of sensors. To have an energy-efficient routing protocol, a new cluster heads’ (CHs) selection strategy using a modified multi-objective artificial bees colony (MOABC) optimization is defined. The modified MOABC is based on the roulette wheel selection over non-dominated solutions of the repository (hyper-cubes) in which a rank is assigned to each hypercube based on its density in dominated solutions of the current iteration and then a random food source is elected by roulette from the densest hypercube. The proposed work aims to find the optimal set of CHs based on their residual energies to ensure an optimal balance between the nodes\u27 energy consumption. The achieved results proved that the proposed MOABC-based protocol considerably outperforms recent studies and well-known energy-efficient protocols, namely: LEACH, C-LEACH, SEP, TSEP, DEEC, DDEEC, and EDEEC in terms of energy efficiency, stability, and network lifespan extension

A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET

BSRS: Best Stable Route Selection Algorithm for Wireless Sensor Network Applications

Topological changes in sensor networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS-driven services. Because of connectivity richness in sensor networks, there often exist multiple paths between a source and a destination. Since many applications require uninterrupted connectivity of a session, the ability to find long-living paths can be very useful. In this paper, we propose Best Stable Route Selection (BSRS) approach based on Artificial Bee Colony based search algorithm, ensures that contributes stable quality performance of network and to calculate the best stable path services randomly based on QoS parameter requirements and existing circulation load; so that efficient route selection can easily capture by designing of proposed BSRS approach. The implementation of the proposed BSRS technique is implemented using NS2 simulation environment and the AODV routing protocol is used to incorporate the proposed algorithm. The experimental results are measured in terms of end to end delay, throughput, packet delivery ratio, and energy consumption and routing overhead. The results show the proposed BSRS algorithm improves the flexibility of network node and performance of network when multiple inefficient paths exist

Energy Efficient Multi-hop routing scheme using Taylor based Gravitational Search Algorithm in Wireless Sensor Networks

A group of small sensors can participate in the wireless network infrastructure and make appropriate transmission and communication sensor networks. There are numerous uses for drones, including military, medical, agricultural, and atmospheric monitoring. The power sources available to nodes in WSNs are restricted. Furthermore, because of this, a diverse method of energy availability is required, primarily for communication over a vast distance, for which Multi-Hop (MH) systems are used. Obtaining the optimum routing path between nodes is still a significant problem, even when multi-hop systems reduce the cost of energy needed by every node along the way. As a result, the number of transmissions must be kept to a minimum to provide effective routing and extend the system\u27s lifetime. To solve the energy problem in WSN, Taylor based Gravitational Search Algorithm (TBGSA) is proposed, which combines the Taylor series with a Gravitational search algorithm to discover the best hops for multi-hop routing. Initially, the sensor nodes are categorised as groups or clusters and the maximum capable node can access the cluster head the next action is switching between multiple nodes via a multi-hop manner. Initially, the best (CH) Cluster Head is chosen using the Artificial Bee Colony (ABC) algorithm, and then the data is transmitted utilizing multi-hop routing. The comparison result shows out the extension of networks longevity of the proposed method with the existing EBMRS, MOGA, and DMEERP methods. The network lifetime of the proposed method increased by 13.2%, 21.9% and 29.2% better than DMEERP, MOGA, and EBMRS respectively

Bio-Inspired Load Balancing In Large-Scale WSNs Using Pheromone Signalling

Wireless sensor networks (WSNs) consist of multiple, distributed nodes each with limited resources. With their strict resource constraints and application-specific characteristics, WSNs contain many challenging tradeoffs. This paper proposes a bioinspired load balancing approach, based on pheromone signalling mechanisms, to solve the tradeoff between service availability and energy consumption. We explore the performance consequences of the pheromone-based load balancing approach using (1) a system-level simulator, (2) deployment of real sensor testbeds to provide a competitive analysis of these evaluation methodologies. The effectiveness of the proposed algorithm is evaluated with different scenario parameters and the required performance evaluation techniques are investigated on case studies based on sound sensors

Bio-inspired Optimization: Algorithm, Analysis and Scope of Application

In the last few years, bio-inspired optimization techniques have been widely adopted in fields such as computer science, mathematics, and biology in order to optimize solutions. Bio inspired optimization problems are usually nonlinear and restricted to multiple nonlinear constraints to tackle the problems of the traditional optimization algorithms, the recent trends tend to apply bio-inspired optimization algorithms which represent a promising approach for solving complex optimization problems. This work comprises state-of-art of ten recent bio-inspired algorithms, gap analysis, and its applications namely; Particle swarm optimization (PSO), Genetic Bee Colony (GBC) Algorithm, Fish Swarm Algorithm (FSA), Cat Swarm Optimization (CSO), Whale Optimization Algorithm (WOA), Artificial Algae Algorithm (AAA), Elephant Search Algorithm (ESA), Cuckoo Search Optimization Algorithm (CSOA), Moth flame optimization (MFO), and Grey Wolf Optimization (GWO) algorithm. The previous related works collected from Scopus databases are presented. Also, we explore some key issues in optimization and some applications for further research. We also analyze in-depth discussions on the essence of these algorithms and their connections to self-organization and their applications in different areas of research are presented. As a result, the proposed analysis of these algorithms leads to some key problems that have to be addressed in the future

Ant colony optimization approaches in wireless sensor network: Performance evaluation

Wireless Sensor Network (WSN) has been widely implemented in large sectors such as military, habitat, business, industrial, health and environment. WSN is part of a distributed system where elements such as routing, load balancing, energy efficiency, node localization, time synchronization, data aggregation and security need to be addressed to improve its efficiency, robustness, extendibility, applicability and reliability. Despite multiple approaches proposed to improve all these aspects, there is still room for improvement in order to enhance the capability of WSN in terms of routing and energy efficiency. Ant Colony Optimization (ACO) is one of the approaches used to extend WSN capabilities because its heuristic nature is very suitable with distributed and dynamic environments. This study covers the common WSN aspects and performance evaluation criteria in addition to the list of previous studies that have used ACO approaches in WSN