Trust-aware energy-efficient stable clustering approach using fuzzy type-2 Cuckoo search optimization algorithm for wireless sensor networks

Wireless Networks - With the advancement of communication and sensor technologies, it has become possible to develop low-cost circuitry to sense and transmit the state of surroundings. Wireless...     

A stable energy efficient clustering protocol for wireless sensor networks

Sensor networks comprise of sensor nodes with limited battery power that are deployed at different geographical locations to monitor physical events. Information gathering is a typical but an important operation in many applications of wireless sensor networks (WSNs). It is necessary to operate the sensor network for longer period of time in an energy efficient manner for gathering information. One of the popular WSN protocol, named low energy adaptive clustering hierarchy (LEACH) and its variants, aim to prolong the network lifetime using energy efficient clustering approach. These protocols increase the network lifetime at the expense of reduced stability period (the time span before the first node dies). The reduction in stability period is because of the high energy variance of nodes. Stability period is an essential aspect to preserve coverage properties of the network. Higher is the stability period, more reliable is the network. Higher energy variance of nodes leads to load unbalancing among nodes and therefore lowers the stability period. Hence, it is perpetually attractive to design clustering algorithms that provides higher stability, lower energy variance and are energy efficient. In this paper to overcome the shortcomings of existing clustering protocols, a protocol named stable energy efficient clustering protocol is proposed. It balances the load among nodes using energy-aware heuristics and hence ensures higher stability period. The results demonstrate that the proposed protocol significantly outperforms LEACH and its variants in terms of energy variance and stability period.     

Effect of parametric enhancements on naked mole-rat algorithm for global optimization

Engineering with Computers - Naked mole-rat algorithm (NMRA) is a new swarm intelligence technique based on the mating patterns of NMRs present in nature. The algorithm though is very simple and...     

A boolean spider monkey optimization based energy efficient clustering approach for WSNs

Wireless sensor network (WSN) consists of densely distributed nodes that are deployed to observe and react to events within the sensor field. In WSNs, energy management and network lifetime optimization are major issues in the designing of cluster-based routing protocols. Clustering is an efficient data gathering technique that effectively reduces the energy consumption by organizing nodes into groups. However, in clustering protocols, cluster heads (CHs) bear additional load for coordinating various activities within the cluster. Improper selection of CHs causes increased energy consumption and also degrades the performance of WSN. Therefore, proper CH selection and their load balancing using efficient routing protocol is a critical aspect for long run operation of WSN. Clustering a network with proper load balancing is an NP-hard problem. To solve such problems having vast search area, optimization algorithm is the preeminent possible solution. Spider monkey optimization (SMO) is a relatively new nature inspired evolutionary algorithm based on the foraging behaviour of spider monkeys. It has proved its worth for benchmark functions optimization and antenna design problems. In this paper, SMO based threshold-sensitive energy-efficient clustering protocol is proposed to prolong network lifetime with an intend to extend the stability period of the network. Dual-hop communication between CHs and BS is utilized to achieve load balancing of distant CHs and energy minimization. The results demonstrate that the proposed protocol significantly outperforms existing protocols in terms of energy consumption, system lifetime and stability period.     

Tree-Based Threshold-Sensitive Energy-Efficient Routing Approach For Wireless Sensor Networks

Wireless Personal Communications - The widespread use of wireless sensor devices and their advancements in terms of size, deployment cost and user friendly interface have given rise to many...     

A novel bat flower pollination algorithm for synthesis of linear antenna arrays

In this paper, a novel algorithm, namely bat flower pollination (BFP) is proposed for synthesis of unequally spaced linear antenna array (LAA). The new method is a combination of bat algorithm (BA) and flower pollination algorithm (FPA). In BFP, both BA and FPA interact with each other to escape from local minima. The results of BFP for solving a set of 13 benchmark functions demonstrate its superior performance as compared to variety of well-known algorithms available in the literature. The novel proposed method is also used for the synthesis of unequally spaced LAA for single and multi-objective design. Simulation results show that BFP is able to provide better synthesis results than wide range of popular techniques like genetic algorithm, differential evolution, cuckoo search, particle swarm optimization, back scattering algorithm and others.

     

An energy efficient stable clustering approach using fuzzy extended grey wolf optimization algorithm for WSNs

Wireless Networks - Wireless sensor network (WSN) is a cost-effective networking solution for information updating in the coverage radius or in the sensing region. To record a real-time event, a...     

Synthesis of linear antenna array using flower pollination algorithm

Linear antenna array (LAA) design is a classical electromagnetic problem. It has been extensively dealt by number of researchers in the past, and different optimization algorithms have been applied for the synthesis of LAA. This paper presents a relatively new optimization technique, namely flower pollination algorithm (FPA) for the design of LAA for reducing the maximum side lobe level (SLL) and null control. The desired antenna is achieved by controlling only amplitudes or positions of the array elements. FPA is a novel meta-heuristic optimization method based on the process of pollination of flowers. The effectiveness and capability of FPA have been proved by taking difficult instances of antenna array design with single and multiple objectives. It is found that FPA is able to provide SLL reduction and steering the nulls in the undesired interference directions. Numerical results of FPA are also compared with the available results in the literature of state-of-the-art algorithms like genetic algorithm, particle swarm optimization, cuckoo search, tabu search, biogeography based optimization (BBO) and others which also proves the better performance of the proposed method. Moreover, FPA is more consistent in giving optimum results as compared to BBO method reported recently in the literature.

     

Prediction of drug synergy score using ensemble based differential evolution

Prediction of drug synergy score is an ill‐posed problem. It plays an efficient role in the medical field for inhibiting specific cancer agents. An efficient regression‐based machine learning technique has an ability to minimise the drug synergy prediction errors. Therefore, in this study, an efficient machine learning technique for drug synergy prediction technique is designed by using ensemble based differential evolution (DE) for optimising the support vector machine (SVM). Because the tuning of the attributes of SVM kernel regulates the prediction precision. The ensemble based DE employs two trial vector generation techniques and two control attributes settings. The initial generation technique has the best solution and the other is without the best solution. The proposed and existing competitive machine learning techniques are applied to drug synergy data. The extensive analysis demonstrates that the proposed technique outperforms others in terms of accuracy, root mean square error and coefficient of correlation.Inspec keywords: cancer, evolutionary computation, support vector machines, regression analysis, drugs, learning (artificial intelligence), medical computingOther keywords: ensemble based differential evolution, specific cancer agents, efficient regression‐based machine learning technique, drug synergy prediction errors, efficient machine learning technique, drug synergy prediction technique, support vector machine, prediction precision, trial vector generation techniques, initial generation technique, drug synergy data, drug synergy score prediction, medical field, SVM kernel attributes, ensemble based DE, control attribute settings, competitive machine learning techniques, root mean square error