HBMFTEFR: Design of a Hybrid Bioinspired Model for Fault-Tolerant Energy Harvesting Networks via Fuzzy Rule Checks

Designing energy harvesting networks requires modelling of energy distribution under different real-time network conditions. These networks showcase better energy efficiency, but are affected by internal & external faults, which increase energy consumption of affected nodes. Due to this probability of node failure, and network failure increases, which reduces QoS (Quality of Service) for the network deployment. To overcome this issue, various fault tolerance & mitigation models are proposed by researchers, but these models require large training datasets & real-time samples for efficient operation. This increases computational complexity, storage cost & end-to-end processing delay of the network, which reduces its QoS performance under real-time use cases. To mitigate these issues, this text proposes design of a hybrid bioinspired model for fault-tolerant energy harvesting networks via fuzzy rule checks. The proposed model initially uses a Genetic Algorithm (GA) to cluster nodes depending upon their residual energy & distance metrics. Clustered nodes are processed via Particle Swarm Optimization (PSO) that assists in deploying a fault-tolerant & energy-harvesting process. The PSO model is further augmented via use of a hybrid Ant Colony Optimization (ACO) Model with Teacher Learner Based Optimization (TLBO), which assists in value-based fault prediction & mitigation operations. All bioinspired models are trained-once during initial network deployment, and then evaluated subsequently for each communication request. After a pre-set number of communications are done, the model re-evaluates average QoS performance, and incrementally reconfigures selected solutions. Due to this incremental tuning, the model is observed to consume lower energy, and showcases lower complexity when compared with other state-of-the-art models. Upon evaluation it was observed that the proposed model showcases 15.4% lower energy consumption, 8.5% faster communication response, 9.2% better throughput, and 1.5% better packet delivery ratio (PDR), when compared with recently proposed energy harvesting models. The proposed model also showcased better fault prediction & mitigation performance when compared with its counterparts, thereby making it useful for a wide variety of real-time network deployments

Predicting and Recovering Link Failure Localization Using Competitive Swarm Optimization for DSR Protocol in MANET

Portable impromptu organization is a self-putting together, major construction-less, independent remote versatile hub that exists without even a trace of a determined base station or government association. MANET requires no extraordinary foundation as the organization is unique. Multicasting is an urgent issue in correspondence organizations. Multicast is one of the effective methods in MANET. In multicasting, information parcels from one hub are communicated to a bunch of recipient hubs all at once, at a similar time. In this research work, Failure Node Detection and Efficient Node Localization in a MANET situation are proposed. Localization in MANET is a main area that attracts significant research interest. Localization is a method to determine the nodes’ location in the communication network. A novel routing algorithm, which is used for Predicting and Recovering Link Failure Localization using a Genetic Algorithm with Competitive Swarm Optimization (PRLFL-GACSO) Algorithm is proposed in this study to calculate and recover link failure in MANET. The process of link failure detection is accomplished using mathematical modelling of the genetic algorithm and the routing is attained using the Competitive Swarm optimization technique. The result proposed MANET method makes use of the CSO algorithm, which facilitates a well-organized packet transfer from the source node to the destination node and enhances DSR routing performance. Based on node movement, link value, and endwise delay, the optimal route is found. The main benefit of the PRLFL-GACSO Algorithm is it achieves multiple optimal solutions over global information. Further, premature convergence is avoided using Competitive Swarm Optimization (CSO). The suggested work is measured based on the Ns simulator. The presentation metrix are PDR, endwise delay, power consumption, hit ratio, etc. The presentation of the proposed method is almost 4% and 5% greater than the present TEA-MDRP, RSTA-AOMDV, and RMQS-ua methods. After, the suggested method attains greater performance for detecting and recovering link failure. In future work, the hybrid multiway routing protocols are presented to provide link failure and route breakages and liability tolerance at the time of node failure, and it also increases the worth of service aspects, respectively

Optimal Relay Placement in Multi-hop Wireless Networks

Relay node placement in wireless environments is a research topic recurrently studied in the specialized literature. A variety of network performance goals, such as coverage, data rate and network lifetime, are considered as criteria to lead the placement of the nodes. In this work, a new relay placement approach to maximize network connectivity in a multi-hop wireless network is presented. Here, connectivity is defined as a combination of inter-node reachability and network throughput. The nodes are placed following a two-step procedure: (i) initial distribution, and (ii) solution selection. Additionally, a third stage for placement optimization is optionally proposed to maximize throughput. This tries to be a general approach for placement, and several initialization, selection and optimization algorithms can be used in each of the steps. For experimentation purposes, a leave-one-out selection procedure and a PSO related optimization algorithm are employed and evaluated for second and third stages, respectively. Other node placement solutions available in the literature are compared with the proposed one in realistic simulated scenarios. The results obtained through the properly devised experiments show the improvements achieved by the proposed approach

Metaheuristics Techniques for Cluster Head Selection in WSN: A Survey

In recent years, Wireless sensor communication is growing expeditiously on the capability to gather information, communicate and transmit data effectively. Clustering is the main objective of improving the network lifespan in Wireless sensor network. It includes selecting the cluster head for each cluster in addition to grouping the nodes into clusters. The cluster head gathers data from the normal nodes in the cluster, and the gathered information is then transmitted to the base station. However, there are many reasons in effect opposing unsteady cluster head selection and dead nodes. The technique for selecting a cluster head takes into factors to consider including residual energy, neighbors’ nodes, and the distance between the base station to the regular nodes. In this study, we thoroughly investigated by number of methods of selecting a cluster head and constructing a cluster. Additionally, a quick performance assessment of the techniques' performance is given together with the methods' criteria, advantages, and future directions

Bio-inspired Medium Access Control for Wireless Sensor Networks

This thesis studies the applications of biologically inspired algorithms and behaviours to the Medium Access Control (MAC) layer of Wireless Sensor Networks (WSNs). By exploring the similarity between a general communications channel and control engineering theory, we propose a simple method to control transmissions that we refer to as transmission delay. We use this concept and create a protocol inspired by Particle Swarm Optimisation (PSO) to optimise the communications. The lessons learned from this protocol inspires us to move closer to behaviours found in nature and the Emergence MAC (E-MAC) protocol is presented. The E-MAC protocol shows emergent behaviours arising from simple interactions and provides great throughput, low end-to-end delay and high fairness. Enhancements to this protocol are later proposed. We empirically evaluate these protocols and provide relevant parameter sweeps to show their performance. We also provide a theoretical approach to proving the settling properties of E-MAC. The presented protocols and methods provide a different approach towards MAC in WSNs

Recent Developments in Smart Healthcare

Medicine is undergoing a sector-wide transformation thanks to the advances in computing and networking technologies. Healthcare is changing from reactive and hospital-centered to preventive and personalized, from disease focused to well-being centered. In essence, the healthcare systems, as well as fundamental medicine research, are becoming smarter. We anticipate significant improvements in areas ranging from molecular genomics and proteomics to decision support for healthcare professionals through big data analytics, to support behavior changes through technology-enabled self-management, and social and motivational support. Furthermore, with smart technologies, healthcare delivery could also be made more efficient, higher quality, and lower cost. In this special issue, we received a total 45 submissions and accepted 19 outstanding papers that roughly span across several interesting topics on smart healthcare, including public health, health information technology (Health IT), and smart medicine

Solving k

Coverage problem is a critical issue in wireless sensor networks for security applications. The k-barrier coverage is an effective measure to ensure robustness. In this paper, we formulate the k-barrier coverage problem as a constrained optimization problem and introduce the energy constraint of sensor node to prolong the lifetime of the k-barrier coverage. A novel hybrid particle swarm optimization and gravitational search algorithm (PGSA) is proposed to solve this problem. The proposed PGSA adopts a k-barrier coverage generation strategy based on probability and integrates the exploitation ability in particle swarm optimization to update the velocity and enhance the global search capability and introduce the boundary mutation strategy of an agent to increase the population diversity and search accuracy. Extensive simulations are conducted to demonstrate the effectiveness of our proposed algorithm